/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_22-deref_read_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:02:13,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:02:13,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:02:13,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:02:13,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:02:13,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:02:13,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:02:13,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:02:13,230 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:02:13,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:02:13,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:02:13,234 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:02:13,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:02:13,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:02:13,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:02:13,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:02:13,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:02:13,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:02:13,237 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:02:13,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:02:13,237 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:02:13,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:02:13,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:02:13,238 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:02:13,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:02:13,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:02:13,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:02:13,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:02:13,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:02:13,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:02:13,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:02:13,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:02:13,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:02:13,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:02:13,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:02:13,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:02:13,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:02:13,499 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:02:13,499 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:02:13,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_22-deref_read_racefree.i [2023-12-09 15:02:14,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:02:14,969 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:02:14,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_22-deref_read_racefree.i [2023-12-09 15:02:14,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9266e2a2c/0a529340d67549c39bbbaf12b19025f9/FLAG8174a519e [2023-12-09 15:02:15,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9266e2a2c/0a529340d67549c39bbbaf12b19025f9 [2023-12-09 15:02:15,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:02:15,319 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:02:15,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:02:15,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:02:15,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:02:15,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f785041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15, skipping insertion in model container [2023-12-09 15:02:15,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,377 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:02:15,678 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_22-deref_read_racefree.i[30176,30189] [2023-12-09 15:02:15,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:02:15,718 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:02:15,762 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_22-deref_read_racefree.i[30176,30189] [2023-12-09 15:02:15,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:02:15,804 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:02:15,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15 WrapperNode [2023-12-09 15:02:15,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:02:15,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:02:15,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:02:15,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:02:15,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,851 INFO L138 Inliner]: procedures = 171, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-12-09 15:02:15,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:02:15,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:02:15,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:02:15,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:02:15,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,873 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:02:15,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:02:15,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:02:15,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:02:15,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (1/1) ... [2023-12-09 15:02:15,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:02:15,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:15,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:02:15,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:02:15,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 15:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-09 15:02:15,976 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-09 15:02:15,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:02:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:02:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 15:02:15,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:02:15,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:02:15,982 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:02:16,145 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:02:16,148 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:02:16,412 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:02:16,446 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:02:16,446 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-12-09 15:02:16,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:02:16 BoogieIcfgContainer [2023-12-09 15:02:16,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:02:16,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:02:16,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:02:16,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:02:16,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:02:15" (1/3) ... [2023-12-09 15:02:16,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0c12f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:02:16, skipping insertion in model container [2023-12-09 15:02:16,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:15" (2/3) ... [2023-12-09 15:02:16,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0c12f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:02:16, skipping insertion in model container [2023-12-09 15:02:16,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:02:16" (3/3) ... [2023-12-09 15:02:16,456 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_22-deref_read_racefree.i [2023-12-09 15:02:16,472 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:02:16,473 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:02:16,473 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:02:16,531 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 15:02:16,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 108 transitions, 220 flow [2023-12-09 15:02:16,634 INFO L124 PetriNetUnfolderBase]: 14/145 cut-off events. [2023-12-09 15:02:16,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:16,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 145 events. 14/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 357 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-12-09 15:02:16,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 108 transitions, 220 flow [2023-12-09 15:02:16,651 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 108 transitions, 220 flow [2023-12-09 15:02:16,661 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:16,667 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@732a19c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:16,667 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:16,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:16,685 INFO L124 PetriNetUnfolderBase]: 4/82 cut-off events. [2023-12-09 15:02:16,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:16,686 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:16,686 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:16,687 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:16,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1381795758, now seen corresponding path program 1 times [2023-12-09 15:02:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:16,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128126186] [2023-12-09 15:02:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:17,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:17,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128126186] [2023-12-09 15:02:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128126186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:17,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767700668] [2023-12-09 15:02:17,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:17,052 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:17,086 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2023-12-09 15:02:17,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 108 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:17,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:17,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2023-12-09 15:02:17,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:17,247 INFO L124 PetriNetUnfolderBase]: 66/405 cut-off events. [2023-12-09 15:02:17,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:17,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 405 events. 66/405 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1934 event pairs, 6 based on Foata normal form. 62/441 useless extension candidates. Maximal degree in co-relation 513. Up to 132 conditions per place. [2023-12-09 15:02:17,255 INFO L140 encePairwiseOnDemand]: 95/108 looper letters, 23 selfloop transitions, 2 changer transitions 11/105 dead transitions. [2023-12-09 15:02:17,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 105 transitions, 270 flow [2023-12-09 15:02:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-12-09 15:02:17,268 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8549382716049383 [2023-12-09 15:02:17,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-12-09 15:02:17,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-12-09 15:02:17,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:17,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-12-09 15:02:17,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:17,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:17,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:17,284 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-12-09 15:02:17,284 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 105 transitions, 270 flow [2023-12-09 15:02:17,284 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:17,284 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:17,284 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:17,285 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:02:17,285 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:17,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -789599805, now seen corresponding path program 1 times [2023-12-09 15:02:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:17,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486561574] [2023-12-09 15:02:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:17,331 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:17,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:17,395 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:17,397 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:17,398 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:17,399 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:02:17,399 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 15:02:17,404 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:17,404 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 15:02:17,448 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 15:02:17,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 144 transitions, 298 flow [2023-12-09 15:02:17,482 INFO L124 PetriNetUnfolderBase]: 24/223 cut-off events. [2023-12-09 15:02:17,482 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:02:17,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 223 events. 24/223 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 676 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 146. Up to 6 conditions per place. [2023-12-09 15:02:17,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 144 transitions, 298 flow [2023-12-09 15:02:17,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 144 transitions, 298 flow [2023-12-09 15:02:17,492 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:17,493 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@732a19c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:17,494 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:17,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:17,503 INFO L124 PetriNetUnfolderBase]: 4/82 cut-off events. [2023-12-09 15:02:17,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:17,503 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:17,504 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:17,504 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:17,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash -771948114, now seen corresponding path program 1 times [2023-12-09 15:02:17,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:17,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098280359] [2023-12-09 15:02:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098280359] [2023-12-09 15:02:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098280359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636798726] [2023-12-09 15:02:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:17,604 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:17,606 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 144 [2023-12-09 15:02:17,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 144 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:17,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:17,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 144 [2023-12-09 15:02:17,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:18,215 INFO L124 PetriNetUnfolderBase]: 1032/3506 cut-off events. [2023-12-09 15:02:18,215 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-12-09 15:02:18,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5241 conditions, 3506 events. 1032/3506 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 31041 event pairs, 468 based on Foata normal form. 811/4074 useless extension candidates. Maximal degree in co-relation 687. Up to 1686 conditions per place. [2023-12-09 15:02:18,235 INFO L140 encePairwiseOnDemand]: 125/144 looper letters, 32 selfloop transitions, 2 changer transitions 11/137 dead transitions. [2023-12-09 15:02:18,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 137 transitions, 358 flow [2023-12-09 15:02:18,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-12-09 15:02:18,240 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2023-12-09 15:02:18,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-12-09 15:02:18,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-12-09 15:02:18,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:18,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-12-09 15:02:18,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:18,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:18,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:18,258 INFO L308 CegarLoopForPetriNet]: 133 programPoint places, 1 predicate places. [2023-12-09 15:02:18,259 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 137 transitions, 358 flow [2023-12-09 15:02:18,259 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:18,259 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:18,259 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:18,259 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:02:18,260 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:18,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -155656579, now seen corresponding path program 1 times [2023-12-09 15:02:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:18,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368775890] [2023-12-09 15:02:18,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:18,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:18,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:18,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368775890] [2023-12-09 15:02:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368775890] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916650642] [2023-12-09 15:02:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:18,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:02:18,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:02:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:18,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:18,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:18,671 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916650642] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:18,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555261238] [2023-12-09 15:02:18,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:18,733 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:18,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:18,736 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 144 [2023-12-09 15:02:18,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 137 transitions, 358 flow. Second operand has 10 states, 10 states have (on average 101.6) internal successors, (1016), 10 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:18,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:18,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 144 [2023-12-09 15:02:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:19,024 INFO L124 PetriNetUnfolderBase]: 492/1346 cut-off events. [2023-12-09 15:02:19,025 INFO L125 PetriNetUnfolderBase]: For 358/681 co-relation queries the response was YES. [2023-12-09 15:02:19,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 1346 events. 492/1346 cut-off events. For 358/681 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9028 event pairs, 0 based on Foata normal form. 7/1320 useless extension candidates. Maximal degree in co-relation 391. Up to 754 conditions per place. [2023-12-09 15:02:19,035 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 75 selfloop transitions, 7 changer transitions 0/160 dead transitions. [2023-12-09 15:02:19,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 160 transitions, 654 flow [2023-12-09 15:02:19,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:02:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:02:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 975 transitions. [2023-12-09 15:02:19,038 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7523148148148148 [2023-12-09 15:02:19,039 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 975 transitions. [2023-12-09 15:02:19,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 975 transitions. [2023-12-09 15:02:19,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:19,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 975 transitions. [2023-12-09 15:02:19,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.33333333333333) internal successors, (975), 9 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 144.0) internal successors, (1440), 10 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,045 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 144.0) internal successors, (1440), 10 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,047 INFO L308 CegarLoopForPetriNet]: 133 programPoint places, -19 predicate places. [2023-12-09 15:02:19,048 INFO L500 AbstractCegarLoop]: Abstraction has has 114 places, 160 transitions, 654 flow [2023-12-09 15:02:19,048 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 101.6) internal successors, (1016), 10 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,049 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:19,049 INFO L233 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] [2023-12-09 15:02:19,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:02:19,255 WARN L482 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-12-09 15:02:19,256 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:19,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1078280679, now seen corresponding path program 1 times [2023-12-09 15:02:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:19,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411012494] [2023-12-09 15:02:19,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:19,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:19,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:19,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:19,317 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:19,318 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:19,318 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:19,318 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:02:19,318 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:02:19,319 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:19,319 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 15:02:19,357 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 15:02:19,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 180 transitions, 378 flow [2023-12-09 15:02:19,412 INFO L124 PetriNetUnfolderBase]: 34/301 cut-off events. [2023-12-09 15:02:19,413 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 15:02:19,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 301 events. 34/301 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1001 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 227. Up to 8 conditions per place. [2023-12-09 15:02:19,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 180 transitions, 378 flow [2023-12-09 15:02:19,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 180 transitions, 378 flow [2023-12-09 15:02:19,418 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:19,419 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@732a19c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:19,419 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:19,424 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:19,424 INFO L124 PetriNetUnfolderBase]: 4/82 cut-off events. [2023-12-09 15:02:19,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:19,424 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:19,424 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:19,425 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:19,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash 830839342, now seen corresponding path program 1 times [2023-12-09 15:02:19,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120935978] [2023-12-09 15:02:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:19,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:19,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:19,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:19,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120935978] [2023-12-09 15:02:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120935978] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:19,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483574766] [2023-12-09 15:02:19,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:19,485 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:19,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:19,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:19,487 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 180 [2023-12-09 15:02:19,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 180 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:19,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:19,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 180 [2023-12-09 15:02:19,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:23,630 INFO L124 PetriNetUnfolderBase]: 11322/32171 cut-off events. [2023-12-09 15:02:23,631 INFO L125 PetriNetUnfolderBase]: For 301/301 co-relation queries the response was YES. [2023-12-09 15:02:23,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48509 conditions, 32171 events. 11322/32171 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 388818 event pairs, 7230 based on Foata normal form. 8455/39745 useless extension candidates. Maximal degree in co-relation 5746. Up to 16092 conditions per place. [2023-12-09 15:02:23,862 INFO L140 encePairwiseOnDemand]: 155/180 looper letters, 39 selfloop transitions, 2 changer transitions 11/167 dead transitions. [2023-12-09 15:02:23,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 167 transitions, 440 flow [2023-12-09 15:02:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-12-09 15:02:23,962 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8203703703703704 [2023-12-09 15:02:23,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-12-09 15:02:23,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-12-09 15:02:23,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:23,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-12-09 15:02:23,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:23,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:23,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:23,966 INFO L308 CegarLoopForPetriNet]: 165 programPoint places, 1 predicate places. [2023-12-09 15:02:23,966 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 167 transitions, 440 flow [2023-12-09 15:02:23,966 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:23,966 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:23,967 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:23,967 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:02:23,967 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:23,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:23,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1684301024, now seen corresponding path program 1 times [2023-12-09 15:02:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:23,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598265744] [2023-12-09 15:02:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:24,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598265744] [2023-12-09 15:02:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598265744] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213496130] [2023-12-09 15:02:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:24,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:02:24,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:02:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:24,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:24,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:24,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-12-09 15:02:24,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213496130] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:24,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380366337] [2023-12-09 15:02:24,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:24,198 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:24,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:24,203 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 180 [2023-12-09 15:02:24,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 167 transitions, 440 flow. Second operand has 10 states, 10 states have (on average 124.6) internal successors, (1246), 10 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:24,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:24,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 180 [2023-12-09 15:02:24,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:26,990 INFO L124 PetriNetUnfolderBase]: 11664/27454 cut-off events. [2023-12-09 15:02:26,990 INFO L125 PetriNetUnfolderBase]: For 5846/11860 co-relation queries the response was YES. [2023-12-09 15:02:27,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60206 conditions, 27454 events. 11664/27454 cut-off events. For 5846/11860 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 294964 event pairs, 882 based on Foata normal form. 13/25964 useless extension candidates. Maximal degree in co-relation 6828. Up to 16042 conditions per place. [2023-12-09 15:02:27,169 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 106 selfloop transitions, 9 changer transitions 11/240 dead transitions. [2023-12-09 15:02:27,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 240 transitions, 964 flow [2023-12-09 15:02:27,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:02:27,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:02:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1218 transitions. [2023-12-09 15:02:27,172 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7518518518518519 [2023-12-09 15:02:27,172 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1218 transitions. [2023-12-09 15:02:27,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1218 transitions. [2023-12-09 15:02:27,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:27,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1218 transitions. [2023-12-09 15:02:27,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.33333333333334) internal successors, (1218), 9 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:27,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:27,178 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:27,179 INFO L308 CegarLoopForPetriNet]: 165 programPoint places, 9 predicate places. [2023-12-09 15:02:27,179 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 240 transitions, 964 flow [2023-12-09 15:02:27,180 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 124.6) internal successors, (1246), 10 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:27,180 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:27,180 INFO L233 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] [2023-12-09 15:02:27,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:02:27,384 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-09 15:02:27,385 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:27,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:27,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2105194166, now seen corresponding path program 1 times [2023-12-09 15:02:27,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:27,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743987051] [2023-12-09 15:02:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:27,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:27,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:27,449 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:27,449 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:27,449 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:27,450 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:02:27,450 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:02:27,450 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:27,451 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 15:02:27,486 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 15:02:27,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 216 transitions, 460 flow [2023-12-09 15:02:27,522 INFO L124 PetriNetUnfolderBase]: 44/379 cut-off events. [2023-12-09 15:02:27,522 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-09 15:02:27,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 379 events. 44/379 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1318 event pairs, 0 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 309. Up to 10 conditions per place. [2023-12-09 15:02:27,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 216 transitions, 460 flow [2023-12-09 15:02:27,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 216 transitions, 460 flow [2023-12-09 15:02:27,529 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:27,530 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@732a19c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:27,531 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:27,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:27,534 INFO L124 PetriNetUnfolderBase]: 4/82 cut-off events. [2023-12-09 15:02:27,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:27,535 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:27,535 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:27,535 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:27,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:27,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1895190830, now seen corresponding path program 1 times [2023-12-09 15:02:27,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:27,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544201639] [2023-12-09 15:02:27,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:27,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544201639] [2023-12-09 15:02:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544201639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:27,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:27,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:27,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923275017] [2023-12-09 15:02:27,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:27,600 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:27,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:27,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:27,601 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 216 [2023-12-09 15:02:27,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 216 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:02:27,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:27,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 216 [2023-12-09 15:02:27,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:01,135 INFO L124 PetriNetUnfolderBase]: 108048/257816 cut-off events. [2023-12-09 15:03:01,136 INFO L125 PetriNetUnfolderBase]: For 5446/5446 co-relation queries the response was YES. [2023-12-09 15:03:02,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401408 conditions, 257816 events. 108048/257816 cut-off events. For 5446/5446 co-relation queries the response was YES. Maximal size of possible extension queue 5928. Compared 3664705 event pairs, 79260 based on Foata normal form. 78280/330707 useless extension candidates. Maximal degree in co-relation 49104. Up to 141630 conditions per place. [2023-12-09 15:03:03,706 INFO L140 encePairwiseOnDemand]: 185/216 looper letters, 46 selfloop transitions, 2 changer transitions 11/197 dead transitions. [2023-12-09 15:03:03,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 197 transitions, 524 flow [2023-12-09 15:03:03,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-12-09 15:03:03,708 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8101851851851852 [2023-12-09 15:03:03,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-12-09 15:03:03,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-12-09 15:03:03,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:03,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-12-09 15:03:03,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:03,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:03,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:03,712 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, 1 predicate places. [2023-12-09 15:03:03,712 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 197 transitions, 524 flow [2023-12-09 15:03:03,713 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:03,713 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:03,713 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:03,713 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:03:03,713 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:03,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:03,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1363361725, now seen corresponding path program 1 times [2023-12-09 15:03:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926467244] [2023-12-09 15:03:03,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:03:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926467244] [2023-12-09 15:03:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926467244] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:03:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393447996] [2023-12-09 15:03:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:03,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:03:03,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:03,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:03:03,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:03:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:03,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:03:03,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:03:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:03:03,912 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:03:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:03:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393447996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:03:03,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:03:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:03:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668484262] [2023-12-09 15:03:03,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:03:03,946 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:03:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:03,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:03:03,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:03:03,949 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 216 [2023-12-09 15:03:03,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 197 transitions, 524 flow. Second operand has 10 states, 10 states have (on average 147.6) internal successors, (1476), 10 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:03,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:03,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 216 [2023-12-09 15:03:03,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:53,560 INFO L124 PetriNetUnfolderBase]: 116622/245870 cut-off events. [2023-12-09 15:03:53,561 INFO L125 PetriNetUnfolderBase]: For 41142/68350 co-relation queries the response was YES. [2023-12-09 15:03:55,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550279 conditions, 245870 events. 116622/245870 cut-off events. For 41142/68350 co-relation queries the response was YES. Maximal size of possible extension queue 5703. Compared 3194708 event pairs, 15315 based on Foata normal form. 4/235465 useless extension candidates. Maximal degree in co-relation 65369. Up to 149812 conditions per place. [2023-12-09 15:03:57,681 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 119 selfloop transitions, 9 changer transitions 11/276 dead transitions. [2023-12-09 15:03:57,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 276 transitions, 1098 flow [2023-12-09 15:03:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:03:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:03:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1438 transitions. [2023-12-09 15:03:57,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7397119341563786 [2023-12-09 15:03:57,710 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1438 transitions. [2023-12-09 15:03:57,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1438 transitions. [2023-12-09 15:03:57,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:57,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1438 transitions. [2023-12-09 15:03:57,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 159.77777777777777) internal successors, (1438), 9 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:57,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:57,733 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 216.0) internal successors, (2160), 10 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:57,733 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, 9 predicate places. [2023-12-09 15:03:57,734 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 276 transitions, 1098 flow [2023-12-09 15:03:57,734 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 147.6) internal successors, (1476), 10 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:57,734 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:57,734 INFO L233 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] [2023-12-09 15:03:57,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-09 15:03:57,935 WARN L482 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-12-09 15:03:57,935 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:57,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 196137904, now seen corresponding path program 1 times [2023-12-09 15:03:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:57,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457433040] [2023-12-09 15:03:57,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:57,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:03:58,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:58,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457433040] [2023-12-09 15:03:58,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457433040] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:03:58,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863759409] [2023-12-09 15:03:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:58,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:03:58,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:58,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:03:58,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:03:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:58,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:03:58,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:03:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:03:58,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:03:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:03:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863759409] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:03:58,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:03:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-12-09 15:03:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677434683] [2023-12-09 15:03:58,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:03:58,805 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:03:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:03:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:03:58,808 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 216 [2023-12-09 15:03:58,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 276 transitions, 1098 flow. Second operand has 18 states, 18 states have (on average 147.77777777777777) internal successors, (2660), 18 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:58,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:58,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 216 [2023-12-09 15:03:58,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand