/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_51-mutexptr_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:03:18,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:03:19,020 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:03:19,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:03:19,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:03:19,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:03:19,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:03:19,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:03:19,038 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:03:19,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:03:19,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:03:19,039 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:03:19,039 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:03:19,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:03:19,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:03:19,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:03:19,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:03:19,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:03:19,040 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:03:19,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:03:19,041 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:03:19,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:03:19,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:03:19,044 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:03:19,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:03:19,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:03:19,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:03:19,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:03:19,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:03:19,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:03:19,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:03:19,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:03:19,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:03:19,046 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:03:19,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:03:19,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:03:19,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:03:19,413 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:03:19,413 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:03:19,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2023-12-09 15:03:20,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:03:20,666 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:03:20,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_51-mutexptr_racefree.i [2023-12-09 15:03:20,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a04ed093/2296532b57964b5d9841b65ad15700e3/FLAGfd70ea5ed [2023-12-09 15:03:20,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a04ed093/2296532b57964b5d9841b65ad15700e3 [2023-12-09 15:03:20,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:03:20,692 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:03:20,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:03:20,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:03:20,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:03:20,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:03:20" (1/1) ... [2023-12-09 15:03:20,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4232db31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:20, skipping insertion in model container [2023-12-09 15:03:20,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:03:20" (1/1) ... [2023-12-09 15:03:20,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:03:20,902 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_51-mutexptr_racefree.i[30176,30189] [2023-12-09 15:03:20,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:03:20,925 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:03:20,968 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_51-mutexptr_racefree.i[30176,30189] [2023-12-09 15:03:20,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:03:21,021 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:03:21,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21 WrapperNode [2023-12-09 15:03:21,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:03:21,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:03:21,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:03:21,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:03:21,030 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:03:21" (1/1) ... [2023-12-09 15:03:21,054 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:03:21" (1/1) ... [2023-12-09 15:03:21,078 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2023-12-09 15:03:21,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:03:21,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:03:21,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:03:21,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:03:21,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:03:21,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:03:21,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:03:21,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:03:21,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (1/1) ... [2023-12-09 15:03:21,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:03:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:21,142 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:03:21,144 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:03:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:03:21,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-09 15:03:21,180 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 15:03:21,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:03:21,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:03:21,181 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:03:21,328 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:03:21,330 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:03:21,571 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:03:21,601 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:03:21,601 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-09 15:03:21,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:03:21 BoogieIcfgContainer [2023-12-09 15:03:21,603 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:03:21,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:03:21,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:03:21,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:03:21,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:03:20" (1/3) ... [2023-12-09 15:03:21,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141c6212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:03:21, skipping insertion in model container [2023-12-09 15:03:21,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:03:21" (2/3) ... [2023-12-09 15:03:21,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141c6212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:03:21, skipping insertion in model container [2023-12-09 15:03:21,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:03:21" (3/3) ... [2023-12-09 15:03:21,609 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_51-mutexptr_racefree.i [2023-12-09 15:03:21,621 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:03:21,622 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:03:21,622 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:03:21,671 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-09 15:03:21,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 133 transitions, 273 flow [2023-12-09 15:03:21,771 INFO L124 PetriNetUnfolderBase]: 17/176 cut-off events. [2023-12-09 15:03:21,771 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 15:03:21,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 176 events. 17/176 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 437 event pairs, 0 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2023-12-09 15:03:21,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 133 transitions, 273 flow [2023-12-09 15:03:21,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 128 transitions, 260 flow [2023-12-09 15:03:21,805 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:21,811 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;@65c3f5bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:21,811 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:21,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:21,833 INFO L124 PetriNetUnfolderBase]: 3/87 cut-off events. [2023-12-09 15:03:21,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:21,833 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:21,833 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:21,834 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:21,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash -791660909, now seen corresponding path program 1 times [2023-12-09 15:03:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:21,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385814026] [2023-12-09 15:03:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:21,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:22,120 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:03:22,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385814026] [2023-12-09 15:03:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385814026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:22,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024040788] [2023-12-09 15:03:22,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:22,131 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:22,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:22,170 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 133 [2023-12-09 15:03:22,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 260 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:03:22,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:22,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 133 [2023-12-09 15:03:22,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:22,295 INFO L124 PetriNetUnfolderBase]: 66/432 cut-off events. [2023-12-09 15:03:22,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:22,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 432 events. 66/432 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2108 event pairs, 6 based on Foata normal form. 69/472 useless extension candidates. Maximal degree in co-relation 529. Up to 132 conditions per place. [2023-12-09 15:03:22,302 INFO L140 encePairwiseOnDemand]: 119/133 looper letters, 23 selfloop transitions, 2 changer transitions 16/124 dead transitions. [2023-12-09 15:03:22,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 124 transitions, 308 flow [2023-12-09 15:03:22,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-12-09 15:03:22,312 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8696741854636592 [2023-12-09 15:03:22,313 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-12-09 15:03:22,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-12-09 15:03:22,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:22,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-12-09 15:03:22,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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:22,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:22,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:22,327 INFO L308 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2023-12-09 15:03:22,328 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 124 transitions, 308 flow [2023-12-09 15:03:22,328 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:03:22,328 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:22,328 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:22,329 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:03:22,329 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:22,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1548095326, now seen corresponding path program 1 times [2023-12-09 15:03:22,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158923466] [2023-12-09 15:03:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:22,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:03:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:22,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:03:22,412 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:03:22,413 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:03:22,414 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:03:22,414 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:03:22,415 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 15:03:22,417 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:03:22,417 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 15:03:22,440 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:03:22,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 173 transitions, 362 flow [2023-12-09 15:03:22,491 INFO L124 PetriNetUnfolderBase]: 31/285 cut-off events. [2023-12-09 15:03:22,491 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-09 15:03:22,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 285 events. 31/285 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 908 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 178. Up to 8 conditions per place. [2023-12-09 15:03:22,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 173 transitions, 362 flow [2023-12-09 15:03:22,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 173 transitions, 362 flow [2023-12-09 15:03:22,498 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:22,500 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;@65c3f5bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:22,500 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:22,509 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:22,509 INFO L124 PetriNetUnfolderBase]: 3/87 cut-off events. [2023-12-09 15:03:22,509 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:22,509 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:22,509 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:22,510 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:22,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1988111104, now seen corresponding path program 1 times [2023-12-09 15:03:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106754539] [2023-12-09 15:03:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:22,586 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:03:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:22,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106754539] [2023-12-09 15:03:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106754539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:22,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:22,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521803017] [2023-12-09 15:03:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:22,588 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:22,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:22,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:22,589 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 173 [2023-12-09 15:03:22,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 173 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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:22,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:22,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 173 [2023-12-09 15:03:22,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:23,092 INFO L124 PetriNetUnfolderBase]: 1058/3829 cut-off events. [2023-12-09 15:03:23,093 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-12-09 15:03:23,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5622 conditions, 3829 events. 1058/3829 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 33824 event pairs, 856 based on Foata normal form. 906/4465 useless extension candidates. Maximal degree in co-relation 712. Up to 1728 conditions per place. [2023-12-09 15:03:23,110 INFO L140 encePairwiseOnDemand]: 153/173 looper letters, 32 selfloop transitions, 2 changer transitions 22/165 dead transitions. [2023-12-09 15:03:23,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 165 transitions, 424 flow [2023-12-09 15:03:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-12-09 15:03:23,114 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8516377649325626 [2023-12-09 15:03:23,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-12-09 15:03:23,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-12-09 15:03:23,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:23,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-12-09 15:03:23,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 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:23,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:23,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:23,126 INFO L308 CegarLoopForPetriNet]: 159 programPoint places, 1 predicate places. [2023-12-09 15:03:23,127 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 165 transitions, 424 flow [2023-12-09 15:03:23,127 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 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:23,127 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:23,127 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:23,127 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:03:23,127 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:23,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash -501913837, now seen corresponding path program 1 times [2023-12-09 15:03:23,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:23,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808779548] [2023-12-09 15:03:23,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:23,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:23,269 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:23,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:23,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808779548] [2023-12-09 15:03:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808779548] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:03:23,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027349093] [2023-12-09 15:03:23,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:23,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:03:23,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:23,290 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:03:23,301 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:03:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:23,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:03:23,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:03:23,472 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:23,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:03:23,527 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:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027349093] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:03:23,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:03:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:03:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033381098] [2023-12-09 15:03:23,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:03:23,530 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:03:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:03:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:03:23,535 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 173 [2023-12-09 15:03:23,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 165 transitions, 424 flow. Second operand has 10 states, 10 states have (on average 127.6) internal successors, (1276), 10 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:23,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:23,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 173 [2023-12-09 15:03:23,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:23,800 INFO L124 PetriNetUnfolderBase]: 492/1439 cut-off events. [2023-12-09 15:03:23,800 INFO L125 PetriNetUnfolderBase]: For 394/781 co-relation queries the response was YES. [2023-12-09 15:03:23,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 1439 events. 492/1439 cut-off events. For 394/781 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 9958 event pairs, 36 based on Foata normal form. 4/1402 useless extension candidates. Maximal degree in co-relation 402. Up to 754 conditions per place. [2023-12-09 15:03:23,810 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 75 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2023-12-09 15:03:23,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 177 transitions, 688 flow [2023-12-09 15:03:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:03:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:03:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1209 transitions. [2023-12-09 15:03:23,812 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7764932562620424 [2023-12-09 15:03:23,813 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1209 transitions. [2023-12-09 15:03:23,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1209 transitions. [2023-12-09 15:03:23,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:23,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1209 transitions. [2023-12-09 15:03:23,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 0 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:23,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:23,818 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:03:23,819 INFO L308 CegarLoopForPetriNet]: 159 programPoint places, -28 predicate places. [2023-12-09 15:03:23,819 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 177 transitions, 688 flow [2023-12-09 15:03:23,820 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.6) internal successors, (1276), 10 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:23,820 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:23,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:23,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:03:24,027 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:03:24,028 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:24,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash 659313231, now seen corresponding path program 1 times [2023-12-09 15:03:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727046878] [2023-12-09 15:03:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:24,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:03:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:24,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:03:24,083 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:03:24,083 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:03:24,083 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:03:24,083 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:03:24,084 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:03:24,084 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:03:24,084 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 15:03:24,126 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:03:24,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 213 transitions, 453 flow [2023-12-09 15:03:24,198 INFO L124 PetriNetUnfolderBase]: 50/429 cut-off events. [2023-12-09 15:03:24,198 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-09 15:03:24,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 429 events. 50/429 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1538 event pairs, 1 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 293. Up to 16 conditions per place. [2023-12-09 15:03:24,201 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 213 transitions, 453 flow [2023-12-09 15:03:24,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 213 transitions, 453 flow [2023-12-09 15:03:24,206 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:24,210 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;@65c3f5bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:24,210 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:24,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:24,215 INFO L124 PetriNetUnfolderBase]: 3/87 cut-off events. [2023-12-09 15:03:24,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:24,215 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:24,215 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:24,215 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:24,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash 262762901, now seen corresponding path program 1 times [2023-12-09 15:03:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:24,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173002361] [2023-12-09 15:03:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:24,279 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:03:24,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:24,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173002361] [2023-12-09 15:03:24,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173002361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:24,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:24,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:24,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882284111] [2023-12-09 15:03:24,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:24,280 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:24,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:24,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:24,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:24,281 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 213 [2023-12-09 15:03:24,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 213 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 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:24,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:24,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 213 [2023-12-09 15:03:24,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:28,178 INFO L124 PetriNetUnfolderBase]: 11851/32112 cut-off events. [2023-12-09 15:03:28,178 INFO L125 PetriNetUnfolderBase]: For 1759/1759 co-relation queries the response was YES. [2023-12-09 15:03:28,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49397 conditions, 32112 events. 11851/32112 cut-off events. For 1759/1759 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 369971 event pairs, 7555 based on Foata normal form. 9386/39564 useless extension candidates. Maximal degree in co-relation 5610. Up to 16847 conditions per place. [2023-12-09 15:03:28,612 INFO L140 encePairwiseOnDemand]: 187/213 looper letters, 39 selfloop transitions, 2 changer transitions 23/199 dead transitions. [2023-12-09 15:03:28,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 199 transitions, 519 flow [2023-12-09 15:03:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:03:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:03:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-12-09 15:03:28,614 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8356807511737089 [2023-12-09 15:03:28,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-12-09 15:03:28,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-12-09 15:03:28,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:28,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-12-09 15:03:28,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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:28,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:28,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 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:28,620 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 1 predicate places. [2023-12-09 15:03:28,620 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 199 transitions, 519 flow [2023-12-09 15:03:28,620 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 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:28,621 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:28,621 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:28,621 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:03:28,621 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:28,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1646426834, now seen corresponding path program 1 times [2023-12-09 15:03:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936479448] [2023-12-09 15:03:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:28,717 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:28,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:28,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936479448] [2023-12-09 15:03:28,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936479448] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:03:28,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046208339] [2023-12-09 15:03:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:28,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:03:28,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:03:28,719 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:03:28,745 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:03:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:28,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:03:28,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:03:28,853 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:28,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:03:28,885 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:28,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046208339] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:03:28,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:03:28,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:03:28,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18637498] [2023-12-09 15:03:28,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:03:28,890 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:03:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:28,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:03:28,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:03:28,892 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 213 [2023-12-09 15:03:28,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 199 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 153.6) internal successors, (1536), 10 states have internal predecessors, (1536), 0 states have call successors, (0), 0 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:28,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:28,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 213 [2023-12-09 15:03:28,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:03:32,917 INFO L124 PetriNetUnfolderBase]: 12227/34835 cut-off events. [2023-12-09 15:03:32,917 INFO L125 PetriNetUnfolderBase]: For 6265/10384 co-relation queries the response was YES. [2023-12-09 15:03:33,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69581 conditions, 34835 events. 12227/34835 cut-off events. For 6265/10384 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 410549 event pairs, 3094 based on Foata normal form. 3/32714 useless extension candidates. Maximal degree in co-relation 7810. Up to 16943 conditions per place. [2023-12-09 15:03:33,157 INFO L140 encePairwiseOnDemand]: 207/213 looper letters, 106 selfloop transitions, 9 changer transitions 23/272 dead transitions. [2023-12-09 15:03:33,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 272 transitions, 1049 flow [2023-12-09 15:03:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:03:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:03:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1482 transitions. [2023-12-09 15:03:33,161 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7730829420970265 [2023-12-09 15:03:33,161 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1482 transitions. [2023-12-09 15:03:33,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1482 transitions. [2023-12-09 15:03:33,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:03:33,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1482 transitions. [2023-12-09 15:03:33,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 164.66666666666666) internal successors, (1482), 9 states have internal predecessors, (1482), 0 states have call successors, (0), 0 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:33,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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:33,167 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 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:33,169 INFO L308 CegarLoopForPetriNet]: 194 programPoint places, 9 predicate places. [2023-12-09 15:03:33,169 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 272 transitions, 1049 flow [2023-12-09 15:03:33,170 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 153.6) internal successors, (1536), 10 states have internal predecessors, (1536), 0 states have call successors, (0), 0 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:33,170 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:33,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:33,183 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:03:33,375 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:03:33,375 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:33,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash -218884239, now seen corresponding path program 1 times [2023-12-09 15:03:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868143585] [2023-12-09 15:03:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:33,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:03:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:03:33,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:03:33,438 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:03:33,438 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:03:33,439 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:03:33,439 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:03:33,439 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:03:33,439 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:03:33,439 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 15:03:33,473 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-09 15:03:33,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 253 transitions, 546 flow [2023-12-09 15:03:33,537 INFO L124 PetriNetUnfolderBase]: 81/645 cut-off events. [2023-12-09 15:03:33,538 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-09 15:03:33,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 645 events. 81/645 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2642 event pairs, 6 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 449. Up to 32 conditions per place. [2023-12-09 15:03:33,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 253 transitions, 546 flow [2023-12-09 15:03:33,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 229 places, 253 transitions, 546 flow [2023-12-09 15:03:33,550 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:03:33,550 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;@65c3f5bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:03:33,550 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:03:33,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:03:33,554 INFO L124 PetriNetUnfolderBase]: 3/87 cut-off events. [2023-12-09 15:03:33,554 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:03:33,555 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:03:33,555 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:03:33,555 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:03:33,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:03:33,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1665993810, now seen corresponding path program 1 times [2023-12-09 15:03:33,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:03:33,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141419146] [2023-12-09 15:03:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:03:33,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:03:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:03:33,586 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:03:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:03:33,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141419146] [2023-12-09 15:03:33,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141419146] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:03:33,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:03:33,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:03:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167395628] [2023-12-09 15:03:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:03:33,588 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:03:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:03:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:03:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:03:33,589 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 253 [2023-12-09 15:03:33,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 253 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:33,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:03:33,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 253 [2023-12-09 15:03:33,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:04:09,781 INFO L124 PetriNetUnfolderBase]: 115940/265421 cut-off events. [2023-12-09 15:04:09,781 INFO L125 PetriNetUnfolderBase]: For 22762/22762 co-relation queries the response was YES. [2023-12-09 15:04:11,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421545 conditions, 265421 events. 115940/265421 cut-off events. For 22762/22762 co-relation queries the response was YES. Maximal size of possible extension queue 5217. Compared 3586086 event pairs, 84882 based on Foata normal form. 88088/339416 useless extension candidates. Maximal degree in co-relation 49443. Up to 152114 conditions per place. [2023-12-09 15:04:13,341 INFO L140 encePairwiseOnDemand]: 221/253 looper letters, 46 selfloop transitions, 2 changer transitions 24/233 dead transitions. [2023-12-09 15:04:13,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 233 transitions, 616 flow [2023-12-09 15:04:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:04:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:04:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2023-12-09 15:04:13,344 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8247694334650857 [2023-12-09 15:04:13,344 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2023-12-09 15:04:13,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2023-12-09 15:04:13,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:04:13,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2023-12-09 15:04:13,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 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:04:13,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:04:13,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 253.0) internal successors, (1012), 4 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:04:13,348 INFO L308 CegarLoopForPetriNet]: 229 programPoint places, 1 predicate places. [2023-12-09 15:04:13,348 INFO L500 AbstractCegarLoop]: Abstraction has has 230 places, 233 transitions, 616 flow [2023-12-09 15:04:13,349 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:04:13,349 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:04:13,349 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:04:13,349 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:04:13,349 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:04:13,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:04:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1395545999, now seen corresponding path program 1 times [2023-12-09 15:04:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:04:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565123751] [2023-12-09 15:04:13,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:04:13,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:04:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:04:13,426 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:04:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:04:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565123751] [2023-12-09 15:04:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565123751] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:04:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759401646] [2023-12-09 15:04:13,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:04:13,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:04:13,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:04:13,440 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:04:13,512 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:04:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:04:13,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:04:13,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:04:13,625 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:04:13,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:04:13,668 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:04:13,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759401646] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:04:13,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:04:13,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:04:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942232719] [2023-12-09 15:04:13,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:04:13,669 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:04:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:04:13,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:04:13,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:04:13,670 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 253 [2023-12-09 15:04:13,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 233 transitions, 616 flow. Second operand has 10 states, 10 states have (on average 179.6) internal successors, (1796), 10 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:04:13,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:04:13,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 253 [2023-12-09 15:04:13,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand