/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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 --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 00:18:48,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 00:18:48,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 00:18:48,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 00:18:48,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 00:18:48,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 00:18:48,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 00:18:48,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 00:18:48,298 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 00:18:48,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 00:18:48,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 00:18:48,302 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 00:18:48,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 00:18:48,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 00:18:48,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 00:18:48,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 00:18:48,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 00:18:48,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 00:18:48,304 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 00:18:48,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 00:18:48,304 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 00:18:48,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 00:18:48,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 00:18:48,305 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 00:18:48,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 00:18:48,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:18:48,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 00:18:48,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 00:18:48,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 00:18:48,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 00:18:48,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 00:18:48,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 00:18:48,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 00:18:48,308 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 00:18:48,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 00:18:48,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 00:18:48,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 00:18:48,552 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 00:18:48,552 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 00:18:48,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-30 00:18:49,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 00:18:49,785 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 00:18:49,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2023-11-30 00:18:49,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe077a1d1/7efc3b35488445939708489409997701/FLAGcfbd59d29 [2023-11-30 00:18:49,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe077a1d1/7efc3b35488445939708489409997701 [2023-11-30 00:18:49,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 00:18:49,810 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 00:18:49,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 00:18:49,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 00:18:49,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 00:18:49,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:18:49" (1/1) ... [2023-11-30 00:18:49,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292d4449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:49, skipping insertion in model container [2023-11-30 00:18:49,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:18:49" (1/1) ... [2023-11-30 00:18:49,861 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 00:18:50,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:18:50,130 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 00:18:50,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 00:18:50,190 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 00:18:50,190 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 00:18:50,195 INFO L206 MainTranslator]: Completed translation [2023-11-30 00:18:50,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50 WrapperNode [2023-11-30 00:18:50,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 00:18:50,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 00:18:50,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 00:18:50,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 00:18:50,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,252 INFO L138 Inliner]: procedures = 170, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 118 [2023-11-30 00:18:50,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 00:18:50,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 00:18:50,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 00:18:50,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 00:18:50,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 00:18:50,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 00:18:50,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 00:18:50,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 00:18:50,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (1/1) ... [2023-11-30 00:18:50,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 00:18:50,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 00:18:50,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 00:18:50,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 00:18:50,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 00:18:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 00:18:50,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 00:18:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 00:18:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 00:18:50,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 00:18:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 00:18:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 00:18:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 00:18:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 00:18:50,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 00:18:50,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 00:18:50,348 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 00:18:50,476 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 00:18:50,479 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 00:18:50,734 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 00:18:50,961 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 00:18:50,961 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 00:18:50,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:18:50 BoogieIcfgContainer [2023-11-30 00:18:50,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 00:18:50,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 00:18:50,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 00:18:50,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 00:18:50,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:18:49" (1/3) ... [2023-11-30 00:18:50,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15326282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:18:50, skipping insertion in model container [2023-11-30 00:18:50,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:18:50" (2/3) ... [2023-11-30 00:18:50,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15326282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:18:50, skipping insertion in model container [2023-11-30 00:18:50,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:18:50" (3/3) ... [2023-11-30 00:18:50,970 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2023-11-30 00:18:50,981 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 00:18:50,982 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-30 00:18:50,982 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 00:18:51,030 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:18:51,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 62 transitions, 128 flow [2023-11-30 00:18:51,100 INFO L124 PetriNetUnfolderBase]: 5/73 cut-off events. [2023-11-30 00:18:51,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:18:51,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 73 events. 5/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2023-11-30 00:18:51,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 62 transitions, 128 flow [2023-11-30 00:18:51,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 62 transitions, 128 flow [2023-11-30 00:18:51,123 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:18:51,130 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;@bf157a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:18:51,130 INFO L363 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-30 00:18:51,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:18:51,139 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-11-30 00:18:51,139 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:18:51,139 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:51,139 INFO L232 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] [2023-11-30 00:18:51,140 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-30 00:18:51,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1160521855, now seen corresponding path program 1 times [2023-11-30 00:18:51,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:51,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67430409] [2023-11-30 00:18:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:18:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:18:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:18:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67430409] [2023-11-30 00:18:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67430409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:18:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:18:51,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:18:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253869932] [2023-11-30 00:18:51,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:18:51,465 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:18:51,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:18:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:18:51,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:18:51,484 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 62 [2023-11-30 00:18:51,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 128 flow. Second operand has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:18:51,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 62 [2023-11-30 00:18:51,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:18:51,531 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-30 00:18:51,532 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 00:18:51,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 52 events. 2/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 5/54 useless extension candidates. Maximal degree in co-relation 37. Up to 5 conditions per place. [2023-11-30 00:18:51,533 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 4 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2023-11-30 00:18:51,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 108 flow [2023-11-30 00:18:51,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:18:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:18:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2023-11-30 00:18:51,541 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8951612903225806 [2023-11-30 00:18:51,541 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 111 transitions. [2023-11-30 00:18:51,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 111 transitions. [2023-11-30 00:18:51,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:18:51,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 111 transitions. [2023-11-30 00:18:51,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,547 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,549 INFO L307 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2023-11-30 00:18:51,549 INFO L500 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 108 flow [2023-11-30 00:18:51,549 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,549 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:51,549 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:18:51,550 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 00:18:51,550 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2023-11-30 00:18:51,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:51,550 INFO L85 PathProgramCache]: Analyzing trace with hash 34926398, now seen corresponding path program 1 times [2023-11-30 00:18:51,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:51,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534475914] [2023-11-30 00:18:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:18:51,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:18:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:18:51,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:18:51,578 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:18:51,579 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-11-30 00:18:51,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-11-30 00:18:51,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-11-30 00:18:51,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-11-30 00:18:51,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2023-11-30 00:18:51,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-11-30 00:18:51,581 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-11-30 00:18:51,582 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-11-30 00:18:51,583 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 00:18:51,583 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-30 00:18:51,585 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:18:51,585 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 00:18:51,623 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:18:51,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 98 transitions, 206 flow [2023-11-30 00:18:51,642 INFO L124 PetriNetUnfolderBase]: 9/122 cut-off events. [2023-11-30 00:18:51,643 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 00:18:51,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 122 events. 9/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 83. Up to 6 conditions per place. [2023-11-30 00:18:51,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 98 transitions, 206 flow [2023-11-30 00:18:51,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 98 transitions, 206 flow [2023-11-30 00:18:51,646 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:18:51,646 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;@bf157a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:18:51,646 INFO L363 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-30 00:18:51,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:18:51,651 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-11-30 00:18:51,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:18:51,651 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:51,651 INFO L232 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] [2023-11-30 00:18:51,651 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-30 00:18:51,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1077818209, now seen corresponding path program 1 times [2023-11-30 00:18:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:51,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943959508] [2023-11-30 00:18:51,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:18:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:18:51,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:18:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943959508] [2023-11-30 00:18:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943959508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:18:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:18:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:18:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728237875] [2023-11-30 00:18:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:18:51,773 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:18:51,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:18:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:18:51,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:18:51,774 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2023-11-30 00:18:51,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 206 flow. Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:18:51,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2023-11-30 00:18:51,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:18:51,879 INFO L124 PetriNetUnfolderBase]: 24/199 cut-off events. [2023-11-30 00:18:51,879 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-30 00:18:51,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 199 events. 24/199 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 691 event pairs, 12 based on Foata normal form. 21/199 useless extension candidates. Maximal degree in co-relation 175. Up to 37 conditions per place. [2023-11-30 00:18:51,882 INFO L140 encePairwiseOnDemand]: 82/98 looper letters, 8 selfloop transitions, 0 changer transitions 0/77 dead transitions. [2023-11-30 00:18:51,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 180 flow [2023-11-30 00:18:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:18:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:18:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 172 transitions. [2023-11-30 00:18:51,883 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8775510204081632 [2023-11-30 00:18:51,883 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 172 transitions. [2023-11-30 00:18:51,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 172 transitions. [2023-11-30 00:18:51,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:18:51,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 172 transitions. [2023-11-30 00:18:51,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 86.0) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,885 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,886 INFO L307 CegarLoopForPetriNet]: 96 programPoint places, -17 predicate places. [2023-11-30 00:18:51,886 INFO L500 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 180 flow [2023-11-30 00:18:51,886 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:51,886 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:51,887 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:18:51,887 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 00:18:51,887 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2023-11-30 00:18:51,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 827488149, now seen corresponding path program 1 times [2023-11-30 00:18:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:51,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452209439] [2023-11-30 00:18:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:51,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:18:51,897 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:18:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:18:51,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:18:51,909 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:18:51,909 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2023-11-30 00:18:51,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2023-11-30 00:18:51,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2023-11-30 00:18:51,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2023-11-30 00:18:51,909 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2023-11-30 00:18:51,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2023-11-30 00:18:51,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2023-11-30 00:18:51,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2023-11-30 00:18:51,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2023-11-30 00:18:51,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2023-11-30 00:18:51,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2023-11-30 00:18:51,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2023-11-30 00:18:51,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2023-11-30 00:18:51,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2023-11-30 00:18:51,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2023-11-30 00:18:51,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2023-11-30 00:18:51,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2023-11-30 00:18:51,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2023-11-30 00:18:51,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2023-11-30 00:18:51,912 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2023-11-30 00:18:51,912 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2023-11-30 00:18:51,912 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2023-11-30 00:18:51,912 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 00:18:51,912 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-30 00:18:51,913 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:18:51,913 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 00:18:51,973 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:18:51,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 134 transitions, 286 flow [2023-11-30 00:18:51,997 INFO L124 PetriNetUnfolderBase]: 13/171 cut-off events. [2023-11-30 00:18:51,997 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 00:18:51,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 171 events. 13/171 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2023-11-30 00:18:51,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 134 transitions, 286 flow [2023-11-30 00:18:52,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 134 transitions, 286 flow [2023-11-30 00:18:52,001 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:18:52,002 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;@bf157a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:18:52,002 INFO L363 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-11-30 00:18:52,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:18:52,005 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-11-30 00:18:52,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:18:52,005 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:52,005 INFO L232 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] [2023-11-30 00:18:52,005 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:18:52,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash 481507678, now seen corresponding path program 1 times [2023-11-30 00:18:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:52,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804681457] [2023-11-30 00:18:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:52,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:18:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:18:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:18:52,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804681457] [2023-11-30 00:18:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804681457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:18:52,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:18:52,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:18:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827226930] [2023-11-30 00:18:52,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:18:52,078 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:18:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:18:52,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:18:52,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:18:52,079 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 134 [2023-11-30 00:18:52,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 286 flow. Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:52,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:18:52,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 134 [2023-11-30 00:18:52,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:18:52,361 INFO L124 PetriNetUnfolderBase]: 174/842 cut-off events. [2023-11-30 00:18:52,362 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-30 00:18:52,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1153 conditions, 842 events. 174/842 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5418 event pairs, 108 based on Foata normal form. 85/821 useless extension candidates. Maximal degree in co-relation 811. Up to 229 conditions per place. [2023-11-30 00:18:52,371 INFO L140 encePairwiseOnDemand]: 111/134 looper letters, 12 selfloop transitions, 0 changer transitions 0/106 dead transitions. [2023-11-30 00:18:52,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 254 flow [2023-11-30 00:18:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:18:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:18:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 233 transitions. [2023-11-30 00:18:52,377 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8694029850746269 [2023-11-30 00:18:52,377 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 233 transitions. [2023-11-30 00:18:52,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 233 transitions. [2023-11-30 00:18:52,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:18:52,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 233 transitions. [2023-11-30 00:18:52,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:52,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:52,382 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:52,383 INFO L307 CegarLoopForPetriNet]: 131 programPoint places, -23 predicate places. [2023-11-30 00:18:52,383 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 254 flow [2023-11-30 00:18:52,384 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:52,384 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:52,384 INFO L232 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] [2023-11-30 00:18:52,384 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 00:18:52,386 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:18:52,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash 774160657, now seen corresponding path program 1 times [2023-11-30 00:18:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:52,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425923456] [2023-11-30 00:18:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:18:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:18:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:18:52,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425923456] [2023-11-30 00:18:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425923456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:18:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:18:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 00:18:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603744958] [2023-11-30 00:18:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:18:52,680 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 00:18:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:18:52,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 00:18:52,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 00:18:52,681 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 134 [2023-11-30 00:18:52,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:52,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:18:52,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 134 [2023-11-30 00:18:52,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:18:54,644 INFO L124 PetriNetUnfolderBase]: 5667/11507 cut-off events. [2023-11-30 00:18:54,645 INFO L125 PetriNetUnfolderBase]: For 4500/4511 co-relation queries the response was YES. [2023-11-30 00:18:54,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23734 conditions, 11507 events. 5667/11507 cut-off events. For 4500/4511 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 100929 event pairs, 2105 based on Foata normal form. 0/10290 useless extension candidates. Maximal degree in co-relation 20502. Up to 5327 conditions per place. [2023-11-30 00:18:54,835 INFO L140 encePairwiseOnDemand]: 123/134 looper letters, 111 selfloop transitions, 16 changer transitions 0/197 dead transitions. [2023-11-30 00:18:54,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 197 transitions, 808 flow [2023-11-30 00:18:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 00:18:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 00:18:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 578 transitions. [2023-11-30 00:18:54,838 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7189054726368159 [2023-11-30 00:18:54,838 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 578 transitions. [2023-11-30 00:18:54,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 578 transitions. [2023-11-30 00:18:54,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:18:54,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 578 transitions. [2023-11-30 00:18:54,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:54,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:54,842 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:54,843 INFO L307 CegarLoopForPetriNet]: 131 programPoint places, -18 predicate places. [2023-11-30 00:18:54,843 INFO L500 AbstractCegarLoop]: Abstraction has has 113 places, 197 transitions, 808 flow [2023-11-30 00:18:54,843 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.66666666666667) internal successors, (460), 6 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:54,843 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:54,843 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:18:54,843 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 00:18:54,843 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2023-11-30 00:18:54,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:54,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1627251037, now seen corresponding path program 1 times [2023-11-30 00:18:54,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:54,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517413001] [2023-11-30 00:18:54,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:54,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:18:54,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:18:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:18:54,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:18:54,864 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:18:54,864 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2023-11-30 00:18:54,864 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2023-11-30 00:18:54,864 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2023-11-30 00:18:54,865 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2023-11-30 00:18:54,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2023-11-30 00:18:54,867 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2023-11-30 00:18:54,867 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2023-11-30 00:18:54,867 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2023-11-30 00:18:54,867 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2023-11-30 00:18:54,867 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2023-11-30 00:18:54,867 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 00:18:54,867 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 00:18:54,868 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:18:54,868 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 00:18:54,943 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:18:54,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 170 transitions, 368 flow [2023-11-30 00:18:54,976 INFO L124 PetriNetUnfolderBase]: 17/220 cut-off events. [2023-11-30 00:18:54,977 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 00:18:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 220 events. 17/220 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 782 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 179. Up to 10 conditions per place. [2023-11-30 00:18:54,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 170 transitions, 368 flow [2023-11-30 00:18:54,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 170 transitions, 368 flow [2023-11-30 00:18:54,982 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:18:54,982 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;@bf157a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:18:54,982 INFO L363 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2023-11-30 00:18:54,984 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:18:54,984 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-11-30 00:18:54,984 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:18:54,984 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:54,985 INFO L232 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] [2023-11-30 00:18:54,985 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:18:54,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1412315198, now seen corresponding path program 1 times [2023-11-30 00:18:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:54,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966846602] [2023-11-30 00:18:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:18:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:18:55,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:18:55,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966846602] [2023-11-30 00:18:55,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966846602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:18:55,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:18:55,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:18:55,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436137189] [2023-11-30 00:18:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:18:55,066 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:18:55,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:18:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:18:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:18:55,068 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 170 [2023-11-30 00:18:55,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 170 transitions, 368 flow. Second operand has 2 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:55,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:18:55,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 170 [2023-11-30 00:18:55,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:18:55,601 INFO L124 PetriNetUnfolderBase]: 1028/3661 cut-off events. [2023-11-30 00:18:55,601 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2023-11-30 00:18:55,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5317 conditions, 3661 events. 1028/3661 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 32474 event pairs, 684 based on Foata normal form. 341/3544 useless extension candidates. Maximal degree in co-relation 3727. Up to 1253 conditions per place. [2023-11-30 00:18:55,630 INFO L140 encePairwiseOnDemand]: 140/170 looper letters, 16 selfloop transitions, 0 changer transitions 0/135 dead transitions. [2023-11-30 00:18:55,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 330 flow [2023-11-30 00:18:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:18:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:18:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2023-11-30 00:18:55,632 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8647058823529412 [2023-11-30 00:18:55,632 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 294 transitions. [2023-11-30 00:18:55,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 294 transitions. [2023-11-30 00:18:55,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:18:55,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 294 transitions. [2023-11-30 00:18:55,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:55,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:55,634 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:55,636 INFO L307 CegarLoopForPetriNet]: 166 programPoint places, -29 predicate places. [2023-11-30 00:18:55,636 INFO L500 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 330 flow [2023-11-30 00:18:55,636 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:55,636 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:18:55,636 INFO L232 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] [2023-11-30 00:18:55,637 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 00:18:55,637 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:18:55,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:18:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 241195134, now seen corresponding path program 1 times [2023-11-30 00:18:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:18:55,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122202317] [2023-11-30 00:18:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:18:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:18:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:18:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:18:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:18:55,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122202317] [2023-11-30 00:18:55,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122202317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:18:55,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:18:55,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 00:18:55,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550583559] [2023-11-30 00:18:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:18:55,833 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 00:18:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:18:55,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 00:18:55,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 00:18:55,835 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 170 [2023-11-30 00:18:55,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 135 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:18:55,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:18:55,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 170 [2023-11-30 00:18:55,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:19:14,078 INFO L124 PetriNetUnfolderBase]: 83379/142581 cut-off events. [2023-11-30 00:19:14,079 INFO L125 PetriNetUnfolderBase]: For 67631/67657 co-relation queries the response was YES. [2023-11-30 00:19:14,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306292 conditions, 142581 events. 83379/142581 cut-off events. For 67631/67657 co-relation queries the response was YES. Maximal size of possible extension queue 4210. Compared 1461290 event pairs, 35980 based on Foata normal form. 0/127568 useless extension candidates. Maximal degree in co-relation 263432. Up to 71486 conditions per place. [2023-11-30 00:19:15,570 INFO L140 encePairwiseOnDemand]: 158/170 looper letters, 157 selfloop transitions, 20 changer transitions 0/266 dead transitions. [2023-11-30 00:19:15,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 266 transitions, 1132 flow [2023-11-30 00:19:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 00:19:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 00:19:15,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 742 transitions. [2023-11-30 00:19:15,572 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7274509803921568 [2023-11-30 00:19:15,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 742 transitions. [2023-11-30 00:19:15,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 742 transitions. [2023-11-30 00:19:15,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:19:15,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 742 transitions. [2023-11-30 00:19:15,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:19:15,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:19:15,576 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:19:15,578 INFO L307 CegarLoopForPetriNet]: 166 programPoint places, -24 predicate places. [2023-11-30 00:19:15,578 INFO L500 AbstractCegarLoop]: Abstraction has has 142 places, 266 transitions, 1132 flow [2023-11-30 00:19:15,578 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:19:15,578 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:19:15,578 INFO L232 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] [2023-11-30 00:19:15,578 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 00:19:15,578 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:19:15,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:19:15,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1040364241, now seen corresponding path program 1 times [2023-11-30 00:19:15,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:19:15,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879603199] [2023-11-30 00:19:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:19:15,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:19:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:19:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-30 00:19:15,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:19:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879603199] [2023-11-30 00:19:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879603199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:19:15,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:19:15,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 00:19:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474627088] [2023-11-30 00:19:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:19:15,802 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 00:19:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:19:15,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 00:19:15,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 00:19:15,803 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 170 [2023-11-30 00:19:15,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 266 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:19:15,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:19:15,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 170 [2023-11-30 00:19:15,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:19:58,179 INFO L124 PetriNetUnfolderBase]: 203099/336907 cut-off events. [2023-11-30 00:19:58,185 INFO L125 PetriNetUnfolderBase]: For 243585/255296 co-relation queries the response was YES. [2023-11-30 00:19:59,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941365 conditions, 336907 events. 203099/336907 cut-off events. For 243585/255296 co-relation queries the response was YES. Maximal size of possible extension queue 9254. Compared 3636995 event pairs, 51909 based on Foata normal form. 144/304931 useless extension candidates. Maximal degree in co-relation 821833. Up to 157282 conditions per place. [2023-11-30 00:20:02,499 INFO L140 encePairwiseOnDemand]: 158/170 looper letters, 596 selfloop transitions, 80 changer transitions 0/769 dead transitions. [2023-11-30 00:20:02,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 769 transitions, 5206 flow [2023-11-30 00:20:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 00:20:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 00:20:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2023-11-30 00:20:02,503 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2023-11-30 00:20:02,503 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2023-11-30 00:20:02,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2023-11-30 00:20:02,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:20:02,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2023-11-30 00:20:02,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:02,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:02,506 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:02,508 INFO L307 CegarLoopForPetriNet]: 166 programPoint places, -19 predicate places. [2023-11-30 00:20:02,508 INFO L500 AbstractCegarLoop]: Abstraction has has 147 places, 769 transitions, 5206 flow [2023-11-30 00:20:02,509 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:02,509 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:20:02,509 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 00:20:02,509 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 00:20:02,509 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2023-11-30 00:20:02,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:20:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash 16193130, now seen corresponding path program 1 times [2023-11-30 00:20:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:20:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224072807] [2023-11-30 00:20:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:20:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:20:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:20:02,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 00:20:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 00:20:02,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 00:20:02,542 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 00:20:02,543 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2023-11-30 00:20:02,543 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2023-11-30 00:20:02,543 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2023-11-30 00:20:02,543 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2023-11-30 00:20:02,544 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2023-11-30 00:20:02,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2023-11-30 00:20:02,546 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2023-11-30 00:20:02,547 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2023-11-30 00:20:02,547 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2023-11-30 00:20:02,547 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 00:20:02,547 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-30 00:20:02,547 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 00:20:02,547 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 00:20:02,621 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 00:20:02,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 206 transitions, 452 flow [2023-11-30 00:20:02,646 INFO L124 PetriNetUnfolderBase]: 21/269 cut-off events. [2023-11-30 00:20:02,646 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 00:20:02,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 269 events. 21/269 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 967 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 233. Up to 12 conditions per place. [2023-11-30 00:20:02,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 206 transitions, 452 flow [2023-11-30 00:20:02,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 206 transitions, 452 flow [2023-11-30 00:20:02,652 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 00:20:02,652 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;@bf157a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 00:20:02,652 INFO L363 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2023-11-30 00:20:02,654 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 00:20:02,654 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2023-11-30 00:20:02,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 00:20:02,654 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:20:02,654 INFO L232 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] [2023-11-30 00:20:02,654 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2023-11-30 00:20:02,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:20:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -524928552, now seen corresponding path program 1 times [2023-11-30 00:20:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:20:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711438845] [2023-11-30 00:20:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:20:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:20:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:20:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:20:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:20:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711438845] [2023-11-30 00:20:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711438845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:20:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:20:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-30 00:20:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301464914] [2023-11-30 00:20:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:20:02,718 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-30 00:20:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:20:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-30 00:20:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-30 00:20:02,718 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 206 [2023-11-30 00:20:02,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 206 transitions, 452 flow. Second operand has 2 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:02,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:20:02,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 206 [2023-11-30 00:20:02,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 00:20:04,787 INFO L124 PetriNetUnfolderBase]: 5466/15952 cut-off events. [2023-11-30 00:20:04,788 INFO L125 PetriNetUnfolderBase]: For 4599/4599 co-relation queries the response was YES. [2023-11-30 00:20:04,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24265 conditions, 15952 events. 5466/15952 cut-off events. For 4599/4599 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 171999 event pairs, 3756 based on Foata normal form. 1365/15440 useless extension candidates. Maximal degree in co-relation 16915. Up to 6373 conditions per place. [2023-11-30 00:20:04,991 INFO L140 encePairwiseOnDemand]: 169/206 looper letters, 20 selfloop transitions, 0 changer transitions 0/164 dead transitions. [2023-11-30 00:20:04,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 164 transitions, 408 flow [2023-11-30 00:20:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-30 00:20:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-30 00:20:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2023-11-30 00:20:04,993 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8616504854368932 [2023-11-30 00:20:04,993 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 355 transitions. [2023-11-30 00:20:04,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 355 transitions. [2023-11-30 00:20:04,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 00:20:04,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 355 transitions. [2023-11-30 00:20:04,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 177.5) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:04,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:04,994 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:04,995 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -35 predicate places. [2023-11-30 00:20:04,995 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 408 flow [2023-11-30 00:20:04,995 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:04,995 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 00:20:04,995 INFO L232 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] [2023-11-30 00:20:04,995 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 00:20:04,995 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err6ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err4ASSERT_VIOLATIONDATA_RACE (and 39 more)] === [2023-11-30 00:20:04,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 00:20:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1223094095, now seen corresponding path program 1 times [2023-11-30 00:20:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 00:20:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689964399] [2023-11-30 00:20:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 00:20:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 00:20:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 00:20:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 00:20:05,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 00:20:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689964399] [2023-11-30 00:20:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689964399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 00:20:05,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 00:20:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 00:20:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974621310] [2023-11-30 00:20:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 00:20:05,156 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 00:20:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 00:20:05,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 00:20:05,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 00:20:05,157 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 206 [2023-11-30 00:20:05,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 408 flow. Second operand has 6 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 00:20:05,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 00:20:05,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 206 [2023-11-30 00:20:05,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand