./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:45:07,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:45:07,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:45:07,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:45:07,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:45:07,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:45:07,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:45:07,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:45:07,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:45:07,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:45:07,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:45:07,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:45:07,201 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:45:07,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:45:07,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:45:07,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:45:07,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:45:07,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:45:07,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:45:07,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:45:07,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:45:07,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:45:07,208 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:45:07,209 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:45:07,209 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:45:07,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:45:07,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:45:07,210 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:45:07,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:45:07,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:45:07,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:45:07,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:45:07,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:45:07,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:45:07,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:45:07,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:45:07,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:45:07,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:45:07,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:45:07,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:45:07,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:45:07,215 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb [2024-11-10 14:45:07,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:45:07,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:45:07,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:45:07,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:45:07,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:45:07,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-10 14:45:08,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:45:09,197 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:45:09,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i [2024-11-10 14:45:09,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64706f4e9/2fa014dc14634351bbf88d22f5e27d00/FLAGcf62abdda [2024-11-10 14:45:09,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64706f4e9/2fa014dc14634351bbf88d22f5e27d00 [2024-11-10 14:45:09,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:45:09,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:45:09,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:45:09,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:45:09,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:45:09,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,234 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ddceef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09, skipping insertion in model container [2024-11-10 14:45:09,234 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:45:09,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:45:09,639 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:45:09,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:45:09,733 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:45:09,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09 WrapperNode [2024-11-10 14:45:09,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:45:09,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:45:09,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:45:09,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:45:09,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,791 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2024-11-10 14:45:09,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:45:09,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:45:09,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:45:09,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:45:09,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:45:09,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:45:09,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:45:09,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:45:09,837 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (1/1) ... [2024-11-10 14:45:09,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:45:09,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:45:09,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:45:09,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:45:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:45:09,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:45:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:45:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:45:09,909 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:45:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:45:09,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:45:09,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:45:09,911 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:45:10,039 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:45:10,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:45:10,368 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:45:10,368 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:45:10,416 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:45:10,417 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:45:10,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:45:10 BoogieIcfgContainer [2024-11-10 14:45:10,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:45:10,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:45:10,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:45:10,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:45:10,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:45:09" (1/3) ... [2024-11-10 14:45:10,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b63f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:45:10, skipping insertion in model container [2024-11-10 14:45:10,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:45:09" (2/3) ... [2024-11-10 14:45:10,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b63f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:45:10, skipping insertion in model container [2024-11-10 14:45:10,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:45:10" (3/3) ... [2024-11-10 14:45:10,428 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i [2024-11-10 14:45:10,446 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:45:10,446 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-10 14:45:10,446 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:45:10,509 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:45:10,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 233 transitions, 470 flow [2024-11-10 14:45:10,675 INFO L124 PetriNetUnfolderBase]: 7/276 cut-off events. [2024-11-10 14:45:10,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:10,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 276 events. 7/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 245 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 194. Up to 4 conditions per place. [2024-11-10 14:45:10,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 233 transitions, 470 flow [2024-11-10 14:45:10,693 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 233 transitions, 470 flow [2024-11-10 14:45:10,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:45:10,714 INFO L333 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, 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;@1fff1619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:45:10,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-10 14:45:10,802 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:45:10,802 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:45:10,802 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:10,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:10,804 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:10,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:10,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:10,810 INFO L85 PathProgramCache]: Analyzing trace with hash -154585405, now seen corresponding path program 1 times [2024-11-10 14:45:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949000904] [2024-11-10 14:45:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:10,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:11,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:11,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949000904] [2024-11-10 14:45:11,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949000904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:11,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:11,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621104798] [2024-11-10 14:45:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:11,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:11,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:11,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:11,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 233 [2024-11-10 14:45:11,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:11,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:11,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 233 [2024-11-10 14:45:11,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:11,576 INFO L124 PetriNetUnfolderBase]: 98/686 cut-off events. [2024-11-10 14:45:11,577 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:45:11,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 686 events. 98/686 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3171 event pairs, 33 based on Foata normal form. 9/639 useless extension candidates. Maximal degree in co-relation 708. Up to 138 conditions per place. [2024-11-10 14:45:11,584 INFO L140 encePairwiseOnDemand]: 219/233 looper letters, 32 selfloop transitions, 8 changer transitions 1/248 dead transitions. [2024-11-10 14:45:11,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 248 transitions, 580 flow [2024-11-10 14:45:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:11,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2024-11-10 14:45:11,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9613733905579399 [2024-11-10 14:45:11,607 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 470 flow. Second operand 3 states and 672 transitions. [2024-11-10 14:45:11,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 248 transitions, 580 flow [2024-11-10 14:45:11,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 248 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:45:11,621 INFO L231 Difference]: Finished difference. Result has 236 places, 237 transitions, 532 flow [2024-11-10 14:45:11,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=236, PETRI_TRANSITIONS=237} [2024-11-10 14:45:11,629 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 4 predicate places. [2024-11-10 14:45:11,629 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 237 transitions, 532 flow [2024-11-10 14:45:11,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:11,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:11,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:11,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:45:11,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:11,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1644813482, now seen corresponding path program 1 times [2024-11-10 14:45:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:11,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732337] [2024-11-10 14:45:11,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:11,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732337] [2024-11-10 14:45:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:11,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:11,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831519418] [2024-11-10 14:45:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:11,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:11,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:11,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:11,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:11,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 233 [2024-11-10 14:45:11,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 237 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:11,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:11,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 233 [2024-11-10 14:45:11,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:12,069 INFO L124 PetriNetUnfolderBase]: 114/814 cut-off events. [2024-11-10 14:45:12,069 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES. [2024-11-10 14:45:12,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 814 events. 114/814 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4267 event pairs, 72 based on Foata normal form. 5/764 useless extension candidates. Maximal degree in co-relation 1026. Up to 226 conditions per place. [2024-11-10 14:45:12,078 INFO L140 encePairwiseOnDemand]: 227/233 looper letters, 29 selfloop transitions, 7 changer transitions 0/246 dead transitions. [2024-11-10 14:45:12,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 246 transitions, 632 flow [2024-11-10 14:45:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-11-10 14:45:12,081 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9370529327610873 [2024-11-10 14:45:12,081 INFO L175 Difference]: Start difference. First operand has 236 places, 237 transitions, 532 flow. Second operand 3 states and 655 transitions. [2024-11-10 14:45:12,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 246 transitions, 632 flow [2024-11-10 14:45:12,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 246 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:12,093 INFO L231 Difference]: Finished difference. Result has 237 places, 242 transitions, 572 flow [2024-11-10 14:45:12,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=237, PETRI_TRANSITIONS=242} [2024-11-10 14:45:12,095 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 5 predicate places. [2024-11-10 14:45:12,095 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 242 transitions, 572 flow [2024-11-10 14:45:12,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:12,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:12,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:12,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:45:12,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash 531481113, now seen corresponding path program 1 times [2024-11-10 14:45:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075074967] [2024-11-10 14:45:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:12,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075074967] [2024-11-10 14:45:12,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075074967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:12,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:12,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:12,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576544064] [2024-11-10 14:45:12,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:12,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:12,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 233 [2024-11-10 14:45:12,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 242 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:12,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:12,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 233 [2024-11-10 14:45:12,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:12,370 INFO L124 PetriNetUnfolderBase]: 83/736 cut-off events. [2024-11-10 14:45:12,370 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES. [2024-11-10 14:45:12,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 736 events. 83/736 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3727 event pairs, 45 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 839. Up to 114 conditions per place. [2024-11-10 14:45:12,375 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 17 selfloop transitions, 3 changer transitions 1/248 dead transitions. [2024-11-10 14:45:12,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 248 transitions, 626 flow [2024-11-10 14:45:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2024-11-10 14:45:12,378 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542203147353362 [2024-11-10 14:45:12,378 INFO L175 Difference]: Start difference. First operand has 237 places, 242 transitions, 572 flow. Second operand 3 states and 667 transitions. [2024-11-10 14:45:12,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 248 transitions, 626 flow [2024-11-10 14:45:12,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 248 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:12,385 INFO L231 Difference]: Finished difference. Result has 239 places, 244 transitions, 580 flow [2024-11-10 14:45:12,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=239, PETRI_TRANSITIONS=244} [2024-11-10 14:45:12,386 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 7 predicate places. [2024-11-10 14:45:12,387 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 244 transitions, 580 flow [2024-11-10 14:45:12,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:12,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:12,388 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:12,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:45:12,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1696417030, now seen corresponding path program 1 times [2024-11-10 14:45:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178281633] [2024-11-10 14:45:12,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:12,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:12,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178281633] [2024-11-10 14:45:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178281633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347217849] [2024-11-10 14:45:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:12,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:12,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:12,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 233 [2024-11-10 14:45:12,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 244 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:12,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:12,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 233 [2024-11-10 14:45:12,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:12,635 INFO L124 PetriNetUnfolderBase]: 92/749 cut-off events. [2024-11-10 14:45:12,635 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES. [2024-11-10 14:45:12,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 749 events. 92/749 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3959 event pairs, 54 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 916. Up to 141 conditions per place. [2024-11-10 14:45:12,639 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 22 selfloop transitions, 5 changer transitions 0/253 dead transitions. [2024-11-10 14:45:12,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 253 transitions, 656 flow [2024-11-10 14:45:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2024-11-10 14:45:12,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9527896995708155 [2024-11-10 14:45:12,642 INFO L175 Difference]: Start difference. First operand has 239 places, 244 transitions, 580 flow. Second operand 3 states and 666 transitions. [2024-11-10 14:45:12,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 253 transitions, 656 flow [2024-11-10 14:45:12,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 253 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:12,648 INFO L231 Difference]: Finished difference. Result has 241 places, 247 transitions, 610 flow [2024-11-10 14:45:12,649 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=241, PETRI_TRANSITIONS=247} [2024-11-10 14:45:12,650 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 9 predicate places. [2024-11-10 14:45:12,650 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 247 transitions, 610 flow [2024-11-10 14:45:12,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:12,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:12,652 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:12,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:45:12,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:12,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash 821572620, now seen corresponding path program 1 times [2024-11-10 14:45:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853795292] [2024-11-10 14:45:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853795292] [2024-11-10 14:45:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853795292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:12,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737506889] [2024-11-10 14:45:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:12,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:12,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 233 [2024-11-10 14:45:12,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 247 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:12,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:12,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 233 [2024-11-10 14:45:12,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:12,897 INFO L124 PetriNetUnfolderBase]: 159/929 cut-off events. [2024-11-10 14:45:12,898 INFO L125 PetriNetUnfolderBase]: For 210/216 co-relation queries the response was YES. [2024-11-10 14:45:12,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1612 conditions, 929 events. 159/929 cut-off events. For 210/216 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5168 event pairs, 73 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 1386. Up to 275 conditions per place. [2024-11-10 14:45:12,901 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 29 selfloop transitions, 11 changer transitions 4/260 dead transitions. [2024-11-10 14:45:12,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 260 transitions, 732 flow [2024-11-10 14:45:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2024-11-10 14:45:12,903 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470672389127325 [2024-11-10 14:45:12,903 INFO L175 Difference]: Start difference. First operand has 241 places, 247 transitions, 610 flow. Second operand 3 states and 662 transitions. [2024-11-10 14:45:12,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 260 transitions, 732 flow [2024-11-10 14:45:12,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 260 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:12,910 INFO L231 Difference]: Finished difference. Result has 243 places, 251 transitions, 676 flow [2024-11-10 14:45:12,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=243, PETRI_TRANSITIONS=251} [2024-11-10 14:45:12,912 INFO L277 CegarLoopForPetriNet]: 232 programPoint places, 11 predicate places. [2024-11-10 14:45:12,912 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 251 transitions, 676 flow [2024-11-10 14:45:12,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:12,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:12,914 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:12,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:45:12,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-10 14:45:12,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:12,915 INFO L85 PathProgramCache]: Analyzing trace with hash -790436554, now seen corresponding path program 1 times [2024-11-10 14:45:12,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:12,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808288647] [2024-11-10 14:45:12,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:12,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:12,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:45:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:13,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:45:13,062 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:45:13,063 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-10 14:45:13,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-10 14:45:13,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-10 14:45:13,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-10 14:45:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-10 14:45:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-10 14:45:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-10 14:45:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-10 14:45:13,068 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-10 14:45:13,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-10 14:45:13,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-10 14:45:13,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:45:13,071 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:45:13,075 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:45:13,075 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:45:13,101 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:45:13,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 263 transitions, 536 flow [2024-11-10 14:45:13,168 INFO L124 PetriNetUnfolderBase]: 10/357 cut-off events. [2024-11-10 14:45:13,169 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:45:13,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 357 events. 10/357 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 421 event pairs, 0 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 277. Up to 6 conditions per place. [2024-11-10 14:45:13,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 263 transitions, 536 flow [2024-11-10 14:45:13,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 263 transitions, 536 flow [2024-11-10 14:45:13,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:45:13,174 INFO L333 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, 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;@1fff1619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:45:13,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-10 14:45:13,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:45:13,185 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:45:13,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:13,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:13,186 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:13,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:13,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1210372202, now seen corresponding path program 1 times [2024-11-10 14:45:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:13,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385465811] [2024-11-10 14:45:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:13,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:13,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385465811] [2024-11-10 14:45:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385465811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:13,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929137690] [2024-11-10 14:45:13,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:13,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:13,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:13,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 263 [2024-11-10 14:45:13,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:13,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:13,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 263 [2024-11-10 14:45:13,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:14,337 INFO L124 PetriNetUnfolderBase]: 2216/6766 cut-off events. [2024-11-10 14:45:14,338 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-10 14:45:14,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10470 conditions, 6766 events. 2216/6766 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 63882 event pairs, 879 based on Foata normal form. 92/6153 useless extension candidates. Maximal degree in co-relation 8873. Up to 2089 conditions per place. [2024-11-10 14:45:14,383 INFO L140 encePairwiseOnDemand]: 245/263 looper letters, 46 selfloop transitions, 11 changer transitions 1/286 dead transitions. [2024-11-10 14:45:14,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 286 transitions, 701 flow [2024-11-10 14:45:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-10 14:45:14,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9543726235741445 [2024-11-10 14:45:14,386 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 536 flow. Second operand 3 states and 753 transitions. [2024-11-10 14:45:14,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 286 transitions, 701 flow [2024-11-10 14:45:14,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 286 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:45:14,392 INFO L231 Difference]: Finished difference. Result has 268 places, 270 transitions, 624 flow [2024-11-10 14:45:14,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=268, PETRI_TRANSITIONS=270} [2024-11-10 14:45:14,393 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 4 predicate places. [2024-11-10 14:45:14,393 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 270 transitions, 624 flow [2024-11-10 14:45:14,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:14,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:14,394 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:14,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:45:14,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:14,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:14,395 INFO L85 PathProgramCache]: Analyzing trace with hash -218832214, now seen corresponding path program 1 times [2024-11-10 14:45:14,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:14,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524487234] [2024-11-10 14:45:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:14,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:14,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:14,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524487234] [2024-11-10 14:45:14,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524487234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:14,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:14,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:14,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451958274] [2024-11-10 14:45:14,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:14,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:14,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:14,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:14,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:14,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 263 [2024-11-10 14:45:14,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 270 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:14,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:14,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 263 [2024-11-10 14:45:14,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:15,985 INFO L124 PetriNetUnfolderBase]: 2480/8567 cut-off events. [2024-11-10 14:45:15,986 INFO L125 PetriNetUnfolderBase]: For 2802/2998 co-relation queries the response was YES. [2024-11-10 14:45:16,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15333 conditions, 8567 events. 2480/8567 cut-off events. For 2802/2998 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 87911 event pairs, 1597 based on Foata normal form. 70/7878 useless extension candidates. Maximal degree in co-relation 13172. Up to 3442 conditions per place. [2024-11-10 14:45:16,046 INFO L140 encePairwiseOnDemand]: 255/263 looper letters, 42 selfloop transitions, 12 changer transitions 0/288 dead transitions. [2024-11-10 14:45:16,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 288 transitions, 792 flow [2024-11-10 14:45:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 737 transitions. [2024-11-10 14:45:16,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9340937896070975 [2024-11-10 14:45:16,048 INFO L175 Difference]: Start difference. First operand has 268 places, 270 transitions, 624 flow. Second operand 3 states and 737 transitions. [2024-11-10 14:45:16,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 288 transitions, 792 flow [2024-11-10 14:45:16,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 288 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:16,062 INFO L231 Difference]: Finished difference. Result has 269 places, 280 transitions, 708 flow [2024-11-10 14:45:16,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=269, PETRI_TRANSITIONS=280} [2024-11-10 14:45:16,064 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 5 predicate places. [2024-11-10 14:45:16,064 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 280 transitions, 708 flow [2024-11-10 14:45:16,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:16,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:16,065 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:16,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:45:16,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:16,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1406960352, now seen corresponding path program 1 times [2024-11-10 14:45:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15691038] [2024-11-10 14:45:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:16,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15691038] [2024-11-10 14:45:16,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15691038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:16,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:16,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:16,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239690273] [2024-11-10 14:45:16,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:16,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:16,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:16,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:16,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 263 [2024-11-10 14:45:16,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 280 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:16,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:16,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 263 [2024-11-10 14:45:16,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:17,588 INFO L124 PetriNetUnfolderBase]: 1878/7693 cut-off events. [2024-11-10 14:45:17,588 INFO L125 PetriNetUnfolderBase]: For 1100/1917 co-relation queries the response was YES. [2024-11-10 14:45:17,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12623 conditions, 7693 events. 1878/7693 cut-off events. For 1100/1917 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 82703 event pairs, 1092 based on Foata normal form. 7/6762 useless extension candidates. Maximal degree in co-relation 10920. Up to 1725 conditions per place. [2024-11-10 14:45:17,638 INFO L140 encePairwiseOnDemand]: 258/263 looper letters, 28 selfloop transitions, 4 changer transitions 0/291 dead transitions. [2024-11-10 14:45:17,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 291 transitions, 794 flow [2024-11-10 14:45:17,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-10 14:45:17,641 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9505703422053232 [2024-11-10 14:45:17,641 INFO L175 Difference]: Start difference. First operand has 269 places, 280 transitions, 708 flow. Second operand 3 states and 750 transitions. [2024-11-10 14:45:17,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 291 transitions, 794 flow [2024-11-10 14:45:17,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 291 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:17,653 INFO L231 Difference]: Finished difference. Result has 271 places, 283 transitions, 714 flow [2024-11-10 14:45:17,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=271, PETRI_TRANSITIONS=283} [2024-11-10 14:45:17,655 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 7 predicate places. [2024-11-10 14:45:17,655 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 283 transitions, 714 flow [2024-11-10 14:45:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:17,656 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:17,656 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:17,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:45:17,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:17,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:17,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1439949673, now seen corresponding path program 1 times [2024-11-10 14:45:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861856177] [2024-11-10 14:45:17,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:17,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861856177] [2024-11-10 14:45:17,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861856177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:17,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:17,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606718930] [2024-11-10 14:45:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:17,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:17,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 263 [2024-11-10 14:45:17,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:17,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:17,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 263 [2024-11-10 14:45:17,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:19,253 INFO L124 PetriNetUnfolderBase]: 2430/9841 cut-off events. [2024-11-10 14:45:19,254 INFO L125 PetriNetUnfolderBase]: For 1597/2561 co-relation queries the response was YES. [2024-11-10 14:45:19,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16536 conditions, 9841 events. 2430/9841 cut-off events. For 1597/2561 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 113040 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14740. Up to 2447 conditions per place. [2024-11-10 14:45:19,331 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 34 selfloop transitions, 7 changer transitions 0/299 dead transitions. [2024-11-10 14:45:19,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 299 transitions, 843 flow [2024-11-10 14:45:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-10 14:45:19,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9505703422053232 [2024-11-10 14:45:19,334 INFO L175 Difference]: Start difference. First operand has 271 places, 283 transitions, 714 flow. Second operand 3 states and 750 transitions. [2024-11-10 14:45:19,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 299 transitions, 843 flow [2024-11-10 14:45:19,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 299 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:19,350 INFO L231 Difference]: Finished difference. Result has 273 places, 288 transitions, 762 flow [2024-11-10 14:45:19,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=273, PETRI_TRANSITIONS=288} [2024-11-10 14:45:19,352 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 9 predicate places. [2024-11-10 14:45:19,353 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 288 transitions, 762 flow [2024-11-10 14:45:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:19,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:19,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:19,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:45:19,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:19,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:19,356 INFO L85 PathProgramCache]: Analyzing trace with hash -466660561, now seen corresponding path program 1 times [2024-11-10 14:45:19,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:19,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120329484] [2024-11-10 14:45:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:19,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:19,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:19,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120329484] [2024-11-10 14:45:19,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120329484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:19,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:19,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358492059] [2024-11-10 14:45:19,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:19,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:19,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 263 [2024-11-10 14:45:19,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 288 transitions, 762 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:19,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:19,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 263 [2024-11-10 14:45:19,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:21,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][268], [265#true, Black: 274#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 282#true, 6#L695-4true, Black: 279#(= |#race~data~0| 0), 263#true, Black: 284#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 217#L695true, 287#true, Black: 267#true]) [2024-11-10 14:45:21,060 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-10 14:45:21,060 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-10 14:45:21,060 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:45:21,061 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-10 14:45:21,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [265#true, Black: 274#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 282#true, 6#L695-4true, Black: 279#(= |#race~data~0| 0), 263#true, Black: 284#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 261#L697-3true, Black: 267#true, 287#true]) [2024-11-10 14:45:21,273 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-10 14:45:21,273 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:21,273 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:21,273 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:45:21,320 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [265#true, 40#L697true, Black: 274#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 282#true, 6#L695-4true, Black: 279#(= |#race~data~0| 0), 263#true, Black: 284#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 267#true, 287#true]) [2024-11-10 14:45:21,320 INFO L294 olderBase$Statistics]: this new event has 256 ancestors and is cut-off event [2024-11-10 14:45:21,320 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:45:21,320 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-11-10 14:45:21,320 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-10 14:45:21,516 INFO L124 PetriNetUnfolderBase]: 4089/13251 cut-off events. [2024-11-10 14:45:21,517 INFO L125 PetriNetUnfolderBase]: For 5493/5817 co-relation queries the response was YES. [2024-11-10 14:45:21,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25635 conditions, 13251 events. 4089/13251 cut-off events. For 5493/5817 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 146634 event pairs, 2075 based on Foata normal form. 79/11934 useless extension candidates. Maximal degree in co-relation 21565. Up to 5204 conditions per place. [2024-11-10 14:45:21,620 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 49 selfloop transitions, 19 changer transitions 0/314 dead transitions. [2024-11-10 14:45:21,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 314 transitions, 999 flow [2024-11-10 14:45:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2024-11-10 14:45:21,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944233206590621 [2024-11-10 14:45:21,624 INFO L175 Difference]: Start difference. First operand has 273 places, 288 transitions, 762 flow. Second operand 3 states and 745 transitions. [2024-11-10 14:45:21,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 314 transitions, 999 flow [2024-11-10 14:45:21,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 314 transitions, 985 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:21,634 INFO L231 Difference]: Finished difference. Result has 275 places, 303 transitions, 930 flow [2024-11-10 14:45:21,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=275, PETRI_TRANSITIONS=303} [2024-11-10 14:45:21,635 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 11 predicate places. [2024-11-10 14:45:21,635 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 303 transitions, 930 flow [2024-11-10 14:45:21,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:21,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:21,636 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:21,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:45:21,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:21,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1354085320, now seen corresponding path program 1 times [2024-11-10 14:45:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:21,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731783667] [2024-11-10 14:45:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:21,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731783667] [2024-11-10 14:45:21,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731783667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:45:21,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513402457] [2024-11-10 14:45:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:21,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:45:21,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:45:21,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:45:21,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:45:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:22,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:45:22,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:45:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:22,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:45:22,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513402457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:22,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:45:22,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-10 14:45:22,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891311694] [2024-11-10 14:45:22,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:22,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:45:22,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:22,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:45:22,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:45:22,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 263 [2024-11-10 14:45:22,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 303 transitions, 930 flow. Second operand has 5 states, 5 states have (on average 236.4) internal successors, (1182), 5 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:22,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:22,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 263 [2024-11-10 14:45:22,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:24,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][279], [265#true, Black: 289#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 274#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 292#true, Black: 279#(= |#race~data~0| 0), 6#L695-4true, 263#true, Black: 284#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 217#L695true, 287#true, Black: 267#true]) [2024-11-10 14:45:24,250 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-10 14:45:24,251 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-10 14:45:24,251 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:45:24,251 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-10 14:45:24,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][279], [265#true, Black: 289#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 274#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, Black: 279#(= |#race~data~0| 0), 6#L695-4true, 296#(<= 1 ~threads_alive~0), 263#true, Black: 284#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 217#L695true, 287#true, Black: 267#true]) [2024-11-10 14:45:24,253 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-10 14:45:24,253 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-10 14:45:24,253 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-10 14:45:24,253 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-10 14:45:24,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [265#true, Black: 289#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 274#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 292#true, Black: 279#(= |#race~data~0| 0), 6#L695-4true, 263#true, Black: 284#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 267#true, 287#true, 261#L697-3true]) [2024-11-10 14:45:24,403 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-10 14:45:24,403 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:24,403 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:24,403 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:45:24,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L712-->L712-2: Formula: (= 0 |v_#race~threads_alive~0_3|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_3|} AuxVars[] AssignedVars[#race~threads_alive~0][172], [265#true, Black: 289#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 274#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 61#L712-2true, 6#L695-4true, Black: 279#(= |#race~data~0| 0), 296#(<= 1 ~threads_alive~0), 263#true, Black: 284#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 287#true, 261#L697-3true, Black: 267#true]) [2024-11-10 14:45:24,405 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-10 14:45:24,405 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:24,405 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-10 14:45:24,405 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-10 14:45:24,961 INFO L124 PetriNetUnfolderBase]: 5622/18926 cut-off events. [2024-11-10 14:45:24,961 INFO L125 PetriNetUnfolderBase]: For 9771/10895 co-relation queries the response was YES. [2024-11-10 14:45:25,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38403 conditions, 18926 events. 5622/18926 cut-off events. For 9771/10895 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 229178 event pairs, 1257 based on Foata normal form. 132/17178 useless extension candidates. Maximal degree in co-relation 30508. Up to 3127 conditions per place. [2024-11-10 14:45:25,100 INFO L140 encePairwiseOnDemand]: 255/263 looper letters, 69 selfloop transitions, 14 changer transitions 3/362 dead transitions. [2024-11-10 14:45:25,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 362 transitions, 1221 flow [2024-11-10 14:45:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:45:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 14:45:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1725 transitions. [2024-11-10 14:45:25,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9369907658881043 [2024-11-10 14:45:25,106 INFO L175 Difference]: Start difference. First operand has 275 places, 303 transitions, 930 flow. Second operand 7 states and 1725 transitions. [2024-11-10 14:45:25,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 362 transitions, 1221 flow [2024-11-10 14:45:25,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 362 transitions, 1183 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:25,168 INFO L231 Difference]: Finished difference. Result has 282 places, 316 transitions, 971 flow [2024-11-10 14:45:25,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=971, PETRI_PLACES=282, PETRI_TRANSITIONS=316} [2024-11-10 14:45:25,170 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 18 predicate places. [2024-11-10 14:45:25,170 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 316 transitions, 971 flow [2024-11-10 14:45:25,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 236.4) internal successors, (1182), 5 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:25,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:25,172 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:25,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:45:25,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-10 14:45:25,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:25,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1778644422, now seen corresponding path program 1 times [2024-11-10 14:45:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962786509] [2024-11-10 14:45:25,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:25,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:45:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962786509] [2024-11-10 14:45:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962786509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:25,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 14:45:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863935656] [2024-11-10 14:45:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:45:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:45:25,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:45:25,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 263 [2024-11-10 14:45:25,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 316 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:25,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:25,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 263 [2024-11-10 14:45:25,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:26,383 INFO L124 PetriNetUnfolderBase]: 216/1816 cut-off events. [2024-11-10 14:45:26,383 INFO L125 PetriNetUnfolderBase]: For 464/477 co-relation queries the response was YES. [2024-11-10 14:45:26,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3231 conditions, 1816 events. 216/1816 cut-off events. For 464/477 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 12862 event pairs, 65 based on Foata normal form. 79/1816 useless extension candidates. Maximal degree in co-relation 2648. Up to 212 conditions per place. [2024-11-10 14:45:26,391 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 11 selfloop transitions, 12 changer transitions 0/276 dead transitions. [2024-11-10 14:45:26,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 276 transitions, 764 flow [2024-11-10 14:45:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:45:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:45:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1238 transitions. [2024-11-10 14:45:26,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9414448669201521 [2024-11-10 14:45:26,394 INFO L175 Difference]: Start difference. First operand has 282 places, 316 transitions, 971 flow. Second operand 5 states and 1238 transitions. [2024-11-10 14:45:26,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 276 transitions, 764 flow [2024-11-10 14:45:26,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 276 transitions, 716 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-11-10 14:45:26,402 INFO L231 Difference]: Finished difference. Result has 274 places, 271 transitions, 679 flow [2024-11-10 14:45:26,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=274, PETRI_TRANSITIONS=271} [2024-11-10 14:45:26,404 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 10 predicate places. [2024-11-10 14:45:26,404 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 271 transitions, 679 flow [2024-11-10 14:45:26,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:26,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:26,406 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:26,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:45:26,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:26,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -685372919, now seen corresponding path program 1 times [2024-11-10 14:45:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506186157] [2024-11-10 14:45:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 14:45:26,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:26,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506186157] [2024-11-10 14:45:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506186157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:26,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187671658] [2024-11-10 14:45:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:26,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:26,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 263 [2024-11-10 14:45:26,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 271 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:26,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:26,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 263 [2024-11-10 14:45:26,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:26,776 INFO L124 PetriNetUnfolderBase]: 647/2740 cut-off events. [2024-11-10 14:45:26,776 INFO L125 PetriNetUnfolderBase]: For 860/872 co-relation queries the response was YES. [2024-11-10 14:45:26,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 2740 events. 647/2740 cut-off events. For 860/872 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 21913 event pairs, 351 based on Foata normal form. 0/2591 useless extension candidates. Maximal degree in co-relation 4639. Up to 908 conditions per place. [2024-11-10 14:45:26,788 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 34 selfloop transitions, 7 changer transitions 0/285 dead transitions. [2024-11-10 14:45:26,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 285 transitions, 813 flow [2024-11-10 14:45:26,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-11-10 14:45:26,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9493029150823827 [2024-11-10 14:45:26,791 INFO L175 Difference]: Start difference. First operand has 274 places, 271 transitions, 679 flow. Second operand 3 states and 749 transitions. [2024-11-10 14:45:26,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 285 transitions, 813 flow [2024-11-10 14:45:26,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 285 transitions, 792 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:45:26,798 INFO L231 Difference]: Finished difference. Result has 275 places, 275 transitions, 720 flow [2024-11-10 14:45:26,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2024-11-10 14:45:26,798 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 11 predicate places. [2024-11-10 14:45:26,799 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 720 flow [2024-11-10 14:45:26,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:26,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:26,800 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:26,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:45:26,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:26,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2119222800, now seen corresponding path program 1 times [2024-11-10 14:45:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:26,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933586206] [2024-11-10 14:45:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 14:45:26,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:26,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933586206] [2024-11-10 14:45:26,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933586206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:26,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:26,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:45:26,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958239593] [2024-11-10 14:45:26,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:26,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:26,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:26,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:26,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:26,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 263 [2024-11-10 14:45:26,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:26,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:26,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 263 [2024-11-10 14:45:26,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:27,381 INFO L124 PetriNetUnfolderBase]: 334/2618 cut-off events. [2024-11-10 14:45:27,381 INFO L125 PetriNetUnfolderBase]: For 742/808 co-relation queries the response was YES. [2024-11-10 14:45:27,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4510 conditions, 2618 events. 334/2618 cut-off events. For 742/808 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 22663 event pairs, 93 based on Foata normal form. 12/2552 useless extension candidates. Maximal degree in co-relation 3261. Up to 495 conditions per place. [2024-11-10 14:45:27,390 INFO L140 encePairwiseOnDemand]: 254/263 looper letters, 21 selfloop transitions, 9 changer transitions 0/288 dead transitions. [2024-11-10 14:45:27,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 288 transitions, 821 flow [2024-11-10 14:45:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 761 transitions. [2024-11-10 14:45:27,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9645120405576679 [2024-11-10 14:45:27,392 INFO L175 Difference]: Start difference. First operand has 275 places, 275 transitions, 720 flow. Second operand 3 states and 761 transitions. [2024-11-10 14:45:27,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 288 transitions, 821 flow [2024-11-10 14:45:27,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 288 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:45:27,399 INFO L231 Difference]: Finished difference. Result has 276 places, 282 transitions, 766 flow [2024-11-10 14:45:27,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=276, PETRI_TRANSITIONS=282} [2024-11-10 14:45:27,400 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 12 predicate places. [2024-11-10 14:45:27,400 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 282 transitions, 766 flow [2024-11-10 14:45:27,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:27,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:27,401 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:45:27,401 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:27,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:27,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1922033648, now seen corresponding path program 2 times [2024-11-10 14:45:27,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:27,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287530875] [2024-11-10 14:45:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:27,703 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:45:27,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287530875] [2024-11-10 14:45:27,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287530875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:45:27,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474685597] [2024-11-10 14:45:27,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:45:27,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:45:27,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:45:27,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:45:27,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:45:27,888 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 14:45:27,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:45:27,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 14:45:27,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:45:28,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 14:45:28,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:45:28,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 14:45:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 14:45:28,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:45:28,468 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_1109) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false [2024-11-10 14:45:28,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:45:28,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2024-11-10 14:45:28,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-10 14:45:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 11 not checked. [2024-11-10 14:45:28,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474685597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:45:28,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:45:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-10 14:45:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220202373] [2024-11-10 14:45:28,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:45:28,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:45:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:28,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:45:28,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-10 14:45:28,785 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 263 [2024-11-10 14:45:28,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 282 transitions, 766 flow. Second operand has 12 states, 12 states have (on average 235.58333333333334) internal successors, (2827), 12 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:28,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:28,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 263 [2024-11-10 14:45:28,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:29,095 INFO L124 PetriNetUnfolderBase]: 193/1854 cut-off events. [2024-11-10 14:45:29,095 INFO L125 PetriNetUnfolderBase]: For 617/715 co-relation queries the response was YES. [2024-11-10 14:45:29,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 1854 events. 193/1854 cut-off events. For 617/715 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 13407 event pairs, 43 based on Foata normal form. 45/1855 useless extension candidates. Maximal degree in co-relation 2678. Up to 248 conditions per place. [2024-11-10 14:45:29,106 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 38 selfloop transitions, 8 changer transitions 2/291 dead transitions. [2024-11-10 14:45:29,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 291 transitions, 889 flow [2024-11-10 14:45:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:45:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:45:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1201 transitions. [2024-11-10 14:45:29,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9133079847908745 [2024-11-10 14:45:29,109 INFO L175 Difference]: Start difference. First operand has 276 places, 282 transitions, 766 flow. Second operand 5 states and 1201 transitions. [2024-11-10 14:45:29,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 291 transitions, 889 flow [2024-11-10 14:45:29,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 291 transitions, 878 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 14:45:29,118 INFO L231 Difference]: Finished difference. Result has 279 places, 278 transitions, 747 flow [2024-11-10 14:45:29,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=747, PETRI_PLACES=279, PETRI_TRANSITIONS=278} [2024-11-10 14:45:29,119 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 15 predicate places. [2024-11-10 14:45:29,119 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 278 transitions, 747 flow [2024-11-10 14:45:29,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 235.58333333333334) internal successors, (2827), 12 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:29,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:29,121 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:29,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:45:29,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 14:45:29,322 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1439660145, now seen corresponding path program 1 times [2024-11-10 14:45:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:29,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402727225] [2024-11-10 14:45:29,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-10 14:45:29,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:29,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402727225] [2024-11-10 14:45:29,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402727225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:29,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:29,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:29,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801442056] [2024-11-10 14:45:29,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:29,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:29,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:29,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:29,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:29,443 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 263 [2024-11-10 14:45:29,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 278 transitions, 747 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:29,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:29,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 263 [2024-11-10 14:45:29,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:45:29,801 INFO L124 PetriNetUnfolderBase]: 304/2286 cut-off events. [2024-11-10 14:45:29,801 INFO L125 PetriNetUnfolderBase]: For 1370/1466 co-relation queries the response was YES. [2024-11-10 14:45:29,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4564 conditions, 2286 events. 304/2286 cut-off events. For 1370/1466 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 18108 event pairs, 154 based on Foata normal form. 3/2228 useless extension candidates. Maximal degree in co-relation 3774. Up to 664 conditions per place. [2024-11-10 14:45:29,809 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 37 selfloop transitions, 2 changer transitions 2/280 dead transitions. [2024-11-10 14:45:29,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 280 transitions, 841 flow [2024-11-10 14:45:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:45:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:45:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-11-10 14:45:29,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9226869455006337 [2024-11-10 14:45:29,811 INFO L175 Difference]: Start difference. First operand has 279 places, 278 transitions, 747 flow. Second operand 3 states and 728 transitions. [2024-11-10 14:45:29,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 280 transitions, 841 flow [2024-11-10 14:45:29,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 280 transitions, 829 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:45:29,818 INFO L231 Difference]: Finished difference. Result has 277 places, 275 transitions, 732 flow [2024-11-10 14:45:29,818 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=277, PETRI_TRANSITIONS=275} [2024-11-10 14:45:29,819 INFO L277 CegarLoopForPetriNet]: 264 programPoint places, 13 predicate places. [2024-11-10 14:45:29,819 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 275 transitions, 732 flow [2024-11-10 14:45:29,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:29,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:29,821 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:29,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:45:29,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-10 14:45:29,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:29,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2044554924, now seen corresponding path program 1 times [2024-11-10 14:45:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107667786] [2024-11-10 14:45:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:29,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:29,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:45:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:45:29,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:45:29,926 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:45:29,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2024-11-10 14:45:29,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-10 14:45:29,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-10 14:45:29,926 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-10 14:45:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-10 14:45:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2024-11-10 14:45:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-10 14:45:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-10 14:45:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-10 14:45:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-10 14:45:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-10 14:45:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-10 14:45:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-10 14:45:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-10 14:45:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:45:29,928 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:29,929 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:45:29,929 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:45:29,953 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:45:29,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 296 places, 293 transitions, 604 flow [2024-11-10 14:45:29,999 INFO L124 PetriNetUnfolderBase]: 13/438 cut-off events. [2024-11-10 14:45:29,999 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:45:30,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 438 events. 13/438 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 601 event pairs, 0 based on Foata normal form. 0/396 useless extension candidates. Maximal degree in co-relation 361. Up to 8 conditions per place. [2024-11-10 14:45:30,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 296 places, 293 transitions, 604 flow [2024-11-10 14:45:30,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 296 places, 293 transitions, 604 flow [2024-11-10 14:45:30,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:45:30,005 INFO L333 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, 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;@1fff1619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:45:30,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-10 14:45:30,014 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:45:30,014 INFO L124 PetriNetUnfolderBase]: 2/164 cut-off events. [2024-11-10 14:45:30,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:45:30,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:45:30,014 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:45:30,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2024-11-10 14:45:30,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:45:30,015 INFO L85 PathProgramCache]: Analyzing trace with hash 918323567, now seen corresponding path program 1 times [2024-11-10 14:45:30,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:45:30,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337467402] [2024-11-10 14:45:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:45:30,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:45:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:45:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:45:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:45:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337467402] [2024-11-10 14:45:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337467402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:45:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:45:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:45:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469911495] [2024-11-10 14:45:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:45:30,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:45:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:45:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:45:30,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:45:30,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 293 [2024-11-10 14:45:30,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 293 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:45:30,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:45:30,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 293 [2024-11-10 14:45:30,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand