./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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/per-thread-array-index.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 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:02:22,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:02:22,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 06:02:22,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:02:22,716 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:02:22,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:02:22,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:02:22,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:02:22,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:02:22,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:02:22,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:02:22,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:02:22,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:02:22,743 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:02:22,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:02:22,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:02:22,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:02:22,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:02:22,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:02:22,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:02:22,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:02:22,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:02:22,745 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 06:02:22,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:02:22,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:02:22,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:02:22,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:02:22,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:02:22,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:02:22,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:02:22,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:02:22,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:02:22,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:02:22,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:02:22,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 06:02:22,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:02:22,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:02:22,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:02:22,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:02:22,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:02:22,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:02:22,750 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 -> 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 [2024-11-19 06:02:22,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:02:22,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:02:22,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:02:22,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:02:22,998 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:02:22,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-11-19 06:02:24,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:02:24,442 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:02:24,442 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-index.i [2024-11-19 06:02:24,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9b504a4/c0a0e97a7d0e4b97a80ab52c780b3771/FLAG63f06a9e4 [2024-11-19 06:02:24,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab9b504a4/c0a0e97a7d0e4b97a80ab52c780b3771 [2024-11-19 06:02:24,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:02:24,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:02:24,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:02:24,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:02:24,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:02:24,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:02:24" (1/1) ... [2024-11-19 06:02:24,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8ddb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:24, skipping insertion in model container [2024-11-19 06:02:24,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:02:24" (1/1) ... [2024-11-19 06:02:24,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:02:25,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:02:25,223 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:02:25,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:02:25,351 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:02:25,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25 WrapperNode [2024-11-19 06:02:25,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:02:25,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:02:25,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:02:25,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:02:25,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,398 INFO L138 Inliner]: procedures = 261, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-11-19 06:02:25,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:02:25,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:02:25,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:02:25,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:02:25,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:02:25,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:02:25,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:02:25,426 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:02:25,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (1/1) ... [2024-11-19 06:02:25,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:02:25,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:02:25,455 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-19 06:02:25,458 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-19 06:02:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:02:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 06:02:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 06:02:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:02:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-19 06:02:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-19 06:02:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:02:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:02:25,501 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 06:02:25,627 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:02:25,629 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:02:25,839 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 06:02:25,842 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:02:25,860 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:02:25,860 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:02:25,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:02:25 BoogieIcfgContainer [2024-11-19 06:02:25,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:02:25,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:02:25,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:02:25,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:02:25,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:02:24" (1/3) ... [2024-11-19 06:02:25,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65dba382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:02:25, skipping insertion in model container [2024-11-19 06:02:25,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:02:25" (2/3) ... [2024-11-19 06:02:25,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65dba382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:02:25, skipping insertion in model container [2024-11-19 06:02:25,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:02:25" (3/3) ... [2024-11-19 06:02:25,869 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2024-11-19 06:02:25,887 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:02:25,887 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-19 06:02:25,887 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 06:02:25,935 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 06:02:25,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 96 transitions, 199 flow [2024-11-19 06:02:26,005 INFO L124 PetriNetUnfolderBase]: 6/131 cut-off events. [2024-11-19 06:02:26,005 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 06:02:26,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 131 events. 6/131 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 229 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. [2024-11-19 06:02:26,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 96 transitions, 199 flow [2024-11-19 06:02:26,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 96 transitions, 199 flow [2024-11-19 06:02:26,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:02:26,028 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;@24127583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:02:26,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-19 06:02:26,036 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:02:26,037 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-19 06:02:26,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:02:26,040 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:26,041 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] [2024-11-19 06:02:26,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:02:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -544149586, now seen corresponding path program 1 times [2024-11-19 06:02:26,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:26,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555077326] [2024-11-19 06:02:26,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:26,262 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-19 06:02:26,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:26,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555077326] [2024-11-19 06:02:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555077326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:26,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:26,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987129215] [2024-11-19 06:02:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:26,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:26,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:26,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 96 [2024-11-19 06:02:26,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:26,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:26,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 96 [2024-11-19 06:02:26,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:26,382 INFO L124 PetriNetUnfolderBase]: 3/161 cut-off events. [2024-11-19 06:02:26,383 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 06:02:26,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 161 events. 3/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 330 event pairs, 2 based on Foata normal form. 5/147 useless extension candidates. Maximal degree in co-relation 101. Up to 15 conditions per place. [2024-11-19 06:02:26,385 INFO L140 encePairwiseOnDemand]: 90/96 looper letters, 8 selfloop transitions, 2 changer transitions 1/92 dead transitions. [2024-11-19 06:02:26,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 92 transitions, 211 flow [2024-11-19 06:02:26,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:26,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-11-19 06:02:26,396 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-11-19 06:02:26,397 INFO L175 Difference]: Start difference. First operand has 95 places, 96 transitions, 199 flow. Second operand 3 states and 260 transitions. [2024-11-19 06:02:26,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 92 transitions, 211 flow [2024-11-19 06:02:26,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:26,403 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 193 flow [2024-11-19 06:02:26,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2024-11-19 06:02:26,409 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 1 predicate places. [2024-11-19 06:02:26,410 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 193 flow [2024-11-19 06:02:26,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:26,410 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:26,410 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] [2024-11-19 06:02:26,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:02:26,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:02:26,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:26,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1305463396, now seen corresponding path program 1 times [2024-11-19 06:02:26,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:26,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162699785] [2024-11-19 06:02:26,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:26,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:26,495 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-19 06:02:26,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:26,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162699785] [2024-11-19 06:02:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162699785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:26,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:26,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:26,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984572566] [2024-11-19 06:02:26,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:26,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:26,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:26,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:26,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:26,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2024-11-19 06:02:26,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-19 06:02:26,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:26,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2024-11-19 06:02:26,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:26,551 INFO L124 PetriNetUnfolderBase]: 5/169 cut-off events. [2024-11-19 06:02:26,553 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-19 06:02:26,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 169 events. 5/169 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 335 event pairs, 2 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2024-11-19 06:02:26,555 INFO L140 encePairwiseOnDemand]: 92/96 looper letters, 7 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2024-11-19 06:02:26,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 91 transitions, 211 flow [2024-11-19 06:02:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-19 06:02:26,558 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2024-11-19 06:02:26,558 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 193 flow. Second operand 3 states and 263 transitions. [2024-11-19 06:02:26,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 91 transitions, 211 flow [2024-11-19 06:02:26,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:26,560 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 199 flow [2024-11-19 06:02:26,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2024-11-19 06:02:26,561 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2024-11-19 06:02:26,561 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 199 flow [2024-11-19 06:02:26,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-19 06:02:26,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:26,561 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] [2024-11-19 06:02:26,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:02:26,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:02:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1732395560, now seen corresponding path program 1 times [2024-11-19 06:02:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:26,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034987070] [2024-11-19 06:02:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:27,027 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-19 06:02:27,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:27,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034987070] [2024-11-19 06:02:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034987070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:27,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:27,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:27,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345184464] [2024-11-19 06:02:27,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:27,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:27,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:27,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:27,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2024-11-19 06:02:27,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-19 06:02:27,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:27,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2024-11-19 06:02:27,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:27,313 INFO L124 PetriNetUnfolderBase]: 73/402 cut-off events. [2024-11-19 06:02:27,313 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 06:02:27,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 402 events. 73/402 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1947 event pairs, 35 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 501. Up to 159 conditions per place. [2024-11-19 06:02:27,317 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 23 selfloop transitions, 22 changer transitions 0/112 dead transitions. [2024-11-19 06:02:27,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 112 transitions, 331 flow [2024-11-19 06:02:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 460 transitions. [2024-11-19 06:02:27,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7986111111111112 [2024-11-19 06:02:27,323 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 199 flow. Second operand 6 states and 460 transitions. [2024-11-19 06:02:27,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 112 transitions, 331 flow [2024-11-19 06:02:27,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:27,327 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 349 flow [2024-11-19 06:02:27,328 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2024-11-19 06:02:27,329 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 9 predicate places. [2024-11-19 06:02:27,329 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 349 flow [2024-11-19 06:02:27,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.5) internal successors, (423), 6 states have internal predecessors, (423), 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-19 06:02:27,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:27,330 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] [2024-11-19 06:02:27,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 06:02:27,331 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:02:27,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1866357126, now seen corresponding path program 1 times [2024-11-19 06:02:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31767077] [2024-11-19 06:02:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:27,444 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-19 06:02:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:27,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31767077] [2024-11-19 06:02:27,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31767077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:27,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:27,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:27,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530727478] [2024-11-19 06:02:27,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:27,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:02:27,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:27,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:02:27,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:02:27,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 96 [2024-11-19 06:02:27,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-19 06:02:27,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:27,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 96 [2024-11-19 06:02:27,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:27,612 INFO L124 PetriNetUnfolderBase]: 34/262 cut-off events. [2024-11-19 06:02:27,612 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-11-19 06:02:27,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 262 events. 34/262 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 933 event pairs, 0 based on Foata normal form. 2/254 useless extension candidates. Maximal degree in co-relation 335. Up to 49 conditions per place. [2024-11-19 06:02:27,616 INFO L140 encePairwiseOnDemand]: 88/96 looper letters, 11 selfloop transitions, 2 changer transitions 5/117 dead transitions. [2024-11-19 06:02:27,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 117 transitions, 395 flow [2024-11-19 06:02:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 499 transitions. [2024-11-19 06:02:27,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8663194444444444 [2024-11-19 06:02:27,620 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 349 flow. Second operand 6 states and 499 transitions. [2024-11-19 06:02:27,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 117 transitions, 395 flow [2024-11-19 06:02:27,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 117 transitions, 395 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:27,625 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 367 flow [2024-11-19 06:02:27,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=367, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2024-11-19 06:02:27,626 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 18 predicate places. [2024-11-19 06:02:27,627 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 367 flow [2024-11-19 06:02:27,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 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-19 06:02:27,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:27,627 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] [2024-11-19 06:02:27,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:02:27,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:02:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:27,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1957891883, now seen corresponding path program 1 times [2024-11-19 06:02:27,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044559714] [2024-11-19 06:02:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:27,994 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-19 06:02:27,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:27,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044559714] [2024-11-19 06:02:27,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044559714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:27,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:27,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:27,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574020566] [2024-11-19 06:02:27,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:27,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:27,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:27,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:27,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:28,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96 [2024-11-19 06:02:28,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 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-19 06:02:28,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:28,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96 [2024-11-19 06:02:28,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:28,187 INFO L124 PetriNetUnfolderBase]: 131/506 cut-off events. [2024-11-19 06:02:28,187 INFO L125 PetriNetUnfolderBase]: For 135/137 co-relation queries the response was YES. [2024-11-19 06:02:28,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 506 events. 131/506 cut-off events. For 135/137 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2624 event pairs, 23 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 1034. Up to 240 conditions per place. [2024-11-19 06:02:28,191 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 35 selfloop transitions, 48 changer transitions 12/155 dead transitions. [2024-11-19 06:02:28,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 155 transitions, 689 flow [2024-11-19 06:02:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2024-11-19 06:02:28,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8524305555555556 [2024-11-19 06:02:28,194 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 367 flow. Second operand 6 states and 491 transitions. [2024-11-19 06:02:28,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 155 transitions, 689 flow [2024-11-19 06:02:28,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 155 transitions, 675 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-19 06:02:28,201 INFO L231 Difference]: Finished difference. Result has 115 places, 143 transitions, 710 flow [2024-11-19 06:02:28,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=115, PETRI_TRANSITIONS=143} [2024-11-19 06:02:28,202 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 20 predicate places. [2024-11-19 06:02:28,203 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 143 transitions, 710 flow [2024-11-19 06:02:28,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.33333333333333) internal successors, (446), 6 states have internal predecessors, (446), 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-19 06:02:28,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:28,204 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] [2024-11-19 06:02:28,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 06:02:28,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:02:28,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:28,204 INFO L85 PathProgramCache]: Analyzing trace with hash -676534449, now seen corresponding path program 1 times [2024-11-19 06:02:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131318324] [2024-11-19 06:02:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:28,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:02:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:28,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131318324] [2024-11-19 06:02:28,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131318324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:28,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:28,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:28,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891021917] [2024-11-19 06:02:28,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:28,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:28,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:28,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:28,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:28,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96 [2024-11-19 06:02:28,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 143 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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-19 06:02:28,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:28,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96 [2024-11-19 06:02:28,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:28,675 INFO L124 PetriNetUnfolderBase]: 142/512 cut-off events. [2024-11-19 06:02:28,675 INFO L125 PetriNetUnfolderBase]: For 432/436 co-relation queries the response was YES. [2024-11-19 06:02:28,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 512 events. 142/512 cut-off events. For 432/436 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2815 event pairs, 10 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1505. Up to 241 conditions per place. [2024-11-19 06:02:28,679 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 73 selfloop transitions, 25 changer transitions 13/171 dead transitions. [2024-11-19 06:02:28,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 171 transitions, 1093 flow [2024-11-19 06:02:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 469 transitions. [2024-11-19 06:02:28,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8142361111111112 [2024-11-19 06:02:28,680 INFO L175 Difference]: Start difference. First operand has 115 places, 143 transitions, 710 flow. Second operand 6 states and 469 transitions. [2024-11-19 06:02:28,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 171 transitions, 1093 flow [2024-11-19 06:02:28,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1074 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-11-19 06:02:28,687 INFO L231 Difference]: Finished difference. Result has 114 places, 158 transitions, 926 flow [2024-11-19 06:02:28,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=926, PETRI_PLACES=114, PETRI_TRANSITIONS=158} [2024-11-19 06:02:28,688 INFO L277 CegarLoopForPetriNet]: 95 programPoint places, 19 predicate places. [2024-11-19 06:02:28,688 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 158 transitions, 926 flow [2024-11-19 06:02:28,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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-19 06:02:28,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:28,689 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-19 06:02:28,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 06:02:28,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-19 06:02:28,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash 360110075, now seen corresponding path program 1 times [2024-11-19 06:02:28,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983512318] [2024-11-19 06:02:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:28,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:02:28,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:02:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:02:28,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:02:28,749 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:02:28,750 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-19 06:02:28,751 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-19 06:02:28,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-19 06:02:28,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-19 06:02:28,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-19 06:02:28,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-19 06:02:28,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-19 06:02:28,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-19 06:02:28,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-19 06:02:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:02:28,753 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:28,755 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:02:28,756 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 06:02:28,768 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 06:02:28,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 117 transitions, 250 flow [2024-11-19 06:02:28,782 INFO L124 PetriNetUnfolderBase]: 11/223 cut-off events. [2024-11-19 06:02:28,783 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 06:02:28,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 223 events. 11/223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 488 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 133. Up to 8 conditions per place. [2024-11-19 06:02:28,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 117 transitions, 250 flow [2024-11-19 06:02:28,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 117 transitions, 250 flow [2024-11-19 06:02:28,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:02:28,785 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;@24127583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:02:28,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-19 06:02:28,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:02:28,787 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-19 06:02:28,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:02:28,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:28,787 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] [2024-11-19 06:02:28,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1771504451, now seen corresponding path program 1 times [2024-11-19 06:02:28,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:28,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562722109] [2024-11-19 06:02:28,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:28,808 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-19 06:02:28,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:28,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562722109] [2024-11-19 06:02:28,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562722109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:28,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:28,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:28,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852468188] [2024-11-19 06:02:28,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:28,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:28,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:28,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:28,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:28,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-11-19 06:02:28,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-19 06:02:28,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:28,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-11-19 06:02:28,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:28,889 INFO L124 PetriNetUnfolderBase]: 19/441 cut-off events. [2024-11-19 06:02:28,889 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 06:02:28,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 441 events. 19/441 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1876 event pairs, 16 based on Foata normal form. 9/393 useless extension candidates. Maximal degree in co-relation 287. Up to 50 conditions per place. [2024-11-19 06:02:28,891 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 11 selfloop transitions, 2 changer transitions 1/113 dead transitions. [2024-11-19 06:02:28,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 268 flow [2024-11-19 06:02:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2024-11-19 06:02:28,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9031339031339032 [2024-11-19 06:02:28,893 INFO L175 Difference]: Start difference. First operand has 117 places, 117 transitions, 250 flow. Second operand 3 states and 317 transitions. [2024-11-19 06:02:28,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 268 flow [2024-11-19 06:02:28,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:28,895 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 244 flow [2024-11-19 06:02:28,895 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2024-11-19 06:02:28,897 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-19 06:02:28,897 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 244 flow [2024-11-19 06:02:28,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-19 06:02:28,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:28,898 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] [2024-11-19 06:02:28,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 06:02:28,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1558441532, now seen corresponding path program 1 times [2024-11-19 06:02:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440028970] [2024-11-19 06:02:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:28,929 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-19 06:02:28,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440028970] [2024-11-19 06:02:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440028970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:28,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:28,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:28,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123083246] [2024-11-19 06:02:28,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:28,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:28,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:28,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:28,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 117 [2024-11-19 06:02:28,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-19 06:02:28,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:28,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 117 [2024-11-19 06:02:28,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:29,001 INFO L124 PetriNetUnfolderBase]: 48/598 cut-off events. [2024-11-19 06:02:29,002 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 06:02:29,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 598 events. 48/598 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2965 event pairs, 27 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 692. Up to 97 conditions per place. [2024-11-19 06:02:29,006 INFO L140 encePairwiseOnDemand]: 111/117 looper letters, 12 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2024-11-19 06:02:29,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 113 transitions, 281 flow [2024-11-19 06:02:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2024-11-19 06:02:29,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905982905982906 [2024-11-19 06:02:29,008 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 244 flow. Second operand 3 states and 318 transitions. [2024-11-19 06:02:29,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 113 transitions, 281 flow [2024-11-19 06:02:29,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:29,011 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 255 flow [2024-11-19 06:02:29,011 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2024-11-19 06:02:29,011 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2024-11-19 06:02:29,012 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 255 flow [2024-11-19 06:02:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-19 06:02:29,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:29,012 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] [2024-11-19 06:02:29,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 06:02:29,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:29,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1701174552, now seen corresponding path program 1 times [2024-11-19 06:02:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088968267] [2024-11-19 06:02:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:29,194 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-19 06:02:29,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:29,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088968267] [2024-11-19 06:02:29,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088968267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:29,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:29,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:29,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151519880] [2024-11-19 06:02:29,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:29,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:29,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:29,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:29,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 117 [2024-11-19 06:02:29,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-19 06:02:29,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:29,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 117 [2024-11-19 06:02:29,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:29,700 INFO L124 PetriNetUnfolderBase]: 1014/3169 cut-off events. [2024-11-19 06:02:29,701 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-19 06:02:29,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 3169 events. 1014/3169 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 26242 event pairs, 586 based on Foata normal form. 0/2847 useless extension candidates. Maximal degree in co-relation 4117. Up to 1592 conditions per place. [2024-11-19 06:02:29,717 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 30 selfloop transitions, 38 changer transitions 0/150 dead transitions. [2024-11-19 06:02:29,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 472 flow [2024-11-19 06:02:29,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 573 transitions. [2024-11-19 06:02:29,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8162393162393162 [2024-11-19 06:02:29,719 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 255 flow. Second operand 6 states and 573 transitions. [2024-11-19 06:02:29,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 472 flow [2024-11-19 06:02:29,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:29,724 INFO L231 Difference]: Finished difference. Result has 125 places, 149 transitions, 509 flow [2024-11-19 06:02:29,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=509, PETRI_PLACES=125, PETRI_TRANSITIONS=149} [2024-11-19 06:02:29,725 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2024-11-19 06:02:29,726 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 149 transitions, 509 flow [2024-11-19 06:02:29,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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-19 06:02:29,726 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:29,726 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] [2024-11-19 06:02:29,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:02:29,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:29,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1567212986, now seen corresponding path program 1 times [2024-11-19 06:02:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:29,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342998431] [2024-11-19 06:02:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:29,775 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-19 06:02:29,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:29,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342998431] [2024-11-19 06:02:29,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342998431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:29,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:29,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:29,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907324947] [2024-11-19 06:02:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:29,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:02:29,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:02:29,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:02:29,841 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 117 [2024-11-19 06:02:29,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 149 transitions, 509 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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-19 06:02:29,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:29,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 117 [2024-11-19 06:02:29,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:30,036 INFO L124 PetriNetUnfolderBase]: 481/1741 cut-off events. [2024-11-19 06:02:30,036 INFO L125 PetriNetUnfolderBase]: For 382/462 co-relation queries the response was YES. [2024-11-19 06:02:30,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 1741 events. 481/1741 cut-off events. For 382/462 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 12358 event pairs, 131 based on Foata normal form. 2/1643 useless extension candidates. Maximal degree in co-relation 2638. Up to 615 conditions per place. [2024-11-19 06:02:30,046 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 14 selfloop transitions, 2 changer transitions 5/155 dead transitions. [2024-11-19 06:02:30,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 155 transitions, 563 flow [2024-11-19 06:02:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:30,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2024-11-19 06:02:30,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8774928774928775 [2024-11-19 06:02:30,048 INFO L175 Difference]: Start difference. First operand has 125 places, 149 transitions, 509 flow. Second operand 6 states and 616 transitions. [2024-11-19 06:02:30,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 155 transitions, 563 flow [2024-11-19 06:02:30,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 155 transitions, 563 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:30,053 INFO L231 Difference]: Finished difference. Result has 134 places, 150 transitions, 531 flow [2024-11-19 06:02:30,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=134, PETRI_TRANSITIONS=150} [2024-11-19 06:02:30,054 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2024-11-19 06:02:30,054 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 150 transitions, 531 flow [2024-11-19 06:02:30,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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-19 06:02:30,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:30,055 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] [2024-11-19 06:02:30,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 06:02:30,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1925682072, now seen corresponding path program 1 times [2024-11-19 06:02:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250134725] [2024-11-19 06:02:30,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:30,270 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-19 06:02:30,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250134725] [2024-11-19 06:02:30,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250134725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:30,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:30,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:30,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697323375] [2024-11-19 06:02:30,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:30,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:30,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:30,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:30,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:30,363 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-11-19 06:02:30,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 150 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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-19 06:02:30,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:30,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-11-19 06:02:30,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:31,197 INFO L124 PetriNetUnfolderBase]: 2425/6842 cut-off events. [2024-11-19 06:02:31,198 INFO L125 PetriNetUnfolderBase]: For 1864/2249 co-relation queries the response was YES. [2024-11-19 06:02:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14933 conditions, 6842 events. 2425/6842 cut-off events. For 1864/2249 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 62494 event pairs, 537 based on Foata normal form. 17/6325 useless extension candidates. Maximal degree in co-relation 14831. Up to 2882 conditions per place. [2024-11-19 06:02:31,242 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 86 selfloop transitions, 86 changer transitions 0/260 dead transitions. [2024-11-19 06:02:31,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 260 transitions, 1359 flow [2024-11-19 06:02:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2024-11-19 06:02:31,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8874643874643875 [2024-11-19 06:02:31,249 INFO L175 Difference]: Start difference. First operand has 134 places, 150 transitions, 531 flow. Second operand 6 states and 623 transitions. [2024-11-19 06:02:31,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 260 transitions, 1359 flow [2024-11-19 06:02:31,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 260 transitions, 1347 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 06:02:31,260 INFO L231 Difference]: Finished difference. Result has 136 places, 233 transitions, 1245 flow [2024-11-19 06:02:31,261 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1245, PETRI_PLACES=136, PETRI_TRANSITIONS=233} [2024-11-19 06:02:31,261 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2024-11-19 06:02:31,262 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 233 transitions, 1245 flow [2024-11-19 06:02:31,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.33333333333333) internal successors, (536), 6 states have internal predecessors, (536), 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-19 06:02:31,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:31,262 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] [2024-11-19 06:02:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:02:31,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:31,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1833776535, now seen corresponding path program 1 times [2024-11-19 06:02:31,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:31,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177749814] [2024-11-19 06:02:31,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:31,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:02:31,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177749814] [2024-11-19 06:02:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177749814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:31,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:31,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745599255] [2024-11-19 06:02:31,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:31,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 117 [2024-11-19 06:02:31,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 233 transitions, 1245 flow. Second operand has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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-19 06:02:31,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:31,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 117 [2024-11-19 06:02:31,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:32,618 INFO L124 PetriNetUnfolderBase]: 3064/8860 cut-off events. [2024-11-19 06:02:32,619 INFO L125 PetriNetUnfolderBase]: For 6913/7212 co-relation queries the response was YES. [2024-11-19 06:02:32,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24607 conditions, 8860 events. 3064/8860 cut-off events. For 6913/7212 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 88155 event pairs, 525 based on Foata normal form. 14/8296 useless extension candidates. Maximal degree in co-relation 23620. Up to 4186 conditions per place. [2024-11-19 06:02:32,701 INFO L140 encePairwiseOnDemand]: 102/117 looper letters, 135 selfloop transitions, 71 changer transitions 0/301 dead transitions. [2024-11-19 06:02:32,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 301 transitions, 2101 flow [2024-11-19 06:02:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2024-11-19 06:02:32,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8319088319088319 [2024-11-19 06:02:32,703 INFO L175 Difference]: Start difference. First operand has 136 places, 233 transitions, 1245 flow. Second operand 6 states and 584 transitions. [2024-11-19 06:02:32,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 301 transitions, 2101 flow [2024-11-19 06:02:32,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 301 transitions, 2083 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:32,745 INFO L231 Difference]: Finished difference. Result has 146 places, 299 transitions, 2007 flow [2024-11-19 06:02:32,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2007, PETRI_PLACES=146, PETRI_TRANSITIONS=299} [2024-11-19 06:02:32,747 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2024-11-19 06:02:32,747 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 299 transitions, 2007 flow [2024-11-19 06:02:32,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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-19 06:02:32,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:32,748 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-19 06:02:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 06:02:32,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2096755450, now seen corresponding path program 1 times [2024-11-19 06:02:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013504022] [2024-11-19 06:02:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:02:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013504022] [2024-11-19 06:02:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013504022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:02:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473018822] [2024-11-19 06:02:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:33,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:02:33,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:02:33,194 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-19 06:02:33,195 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-19 06:02:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:33,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:02:33,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:02:33,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 06:02:33,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:02:33,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:02:33,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 06:02:33,494 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 28 treesize of output 27 [2024-11-19 06:02:33,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:02:33,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-19 06:02:33,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:02:33,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-19 06:02:33,663 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 56 treesize of output 45 [2024-11-19 06:02:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:02:33,673 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:02:33,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-19 06:02:33,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_249 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet10#1| (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1))) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_249 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_249) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse2)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-19 06:02:37,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:02:37,862 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 4 case distinctions, treesize of input 50 treesize of output 66 [2024-11-19 06:02:37,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:02:37,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2024-11-19 06:02:37,883 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 06:02:37,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 06:02:37,889 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 06:02:37,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 06:02:37,897 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 06:02:37,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 06:02:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 6 trivial. 1 not checked. [2024-11-19 06:02:37,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473018822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:02:37,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:02:37,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-19 06:02:37,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867489395] [2024-11-19 06:02:37,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:02:37,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:02:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:37,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:02:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=147, Unknown=20, NotChecked=54, Total=272 [2024-11-19 06:02:38,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 117 [2024-11-19 06:02:38,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 299 transitions, 2007 flow. Second operand has 17 states, 17 states have (on average 64.29411764705883) internal successors, (1093), 17 states have internal predecessors, (1093), 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-19 06:02:38,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:38,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 117 [2024-11-19 06:02:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:40,838 INFO L124 PetriNetUnfolderBase]: 8340/18854 cut-off events. [2024-11-19 06:02:40,838 INFO L125 PetriNetUnfolderBase]: For 24174/24181 co-relation queries the response was YES. [2024-11-19 06:02:40,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58389 conditions, 18854 events. 8340/18854 cut-off events. For 24174/24181 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 186968 event pairs, 2798 based on Foata normal form. 172/18023 useless extension candidates. Maximal degree in co-relation 56426. Up to 8310 conditions per place. [2024-11-19 06:02:40,987 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 389 selfloop transitions, 36 changer transitions 0/490 dead transitions. [2024-11-19 06:02:40,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 490 transitions, 4293 flow [2024-11-19 06:02:40,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:02:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 06:02:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 942 transitions. [2024-11-19 06:02:40,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6193293885601578 [2024-11-19 06:02:40,990 INFO L175 Difference]: Start difference. First operand has 146 places, 299 transitions, 2007 flow. Second operand 13 states and 942 transitions. [2024-11-19 06:02:40,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 490 transitions, 4293 flow [2024-11-19 06:02:41,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 490 transitions, 4153 flow, removed 70 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:41,068 INFO L231 Difference]: Finished difference. Result has 157 places, 298 transitions, 1935 flow [2024-11-19 06:02:41,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1935, PETRI_PLACES=157, PETRI_TRANSITIONS=298} [2024-11-19 06:02:41,070 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 40 predicate places. [2024-11-19 06:02:41,070 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 298 transitions, 1935 flow [2024-11-19 06:02:41,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 64.29411764705883) internal successors, (1093), 17 states have internal predecessors, (1093), 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-19 06:02:41,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:41,071 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-19 06:02:41,085 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-19 06:02:41,271 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,SelfDestructingSolverStorable13 [2024-11-19 06:02:41,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:41,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:41,272 INFO L85 PathProgramCache]: Analyzing trace with hash 210699178, now seen corresponding path program 1 times [2024-11-19 06:02:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765329623] [2024-11-19 06:02:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:02:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:41,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765329623] [2024-11-19 06:02:41,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765329623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:41,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:41,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:02:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773996543] [2024-11-19 06:02:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:41,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:02:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:41,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:02:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:02:42,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-11-19 06:02:42,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 298 transitions, 1935 flow. Second operand has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 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-19 06:02:42,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:42,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-11-19 06:02:42,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:43,873 INFO L124 PetriNetUnfolderBase]: 5098/13026 cut-off events. [2024-11-19 06:02:43,873 INFO L125 PetriNetUnfolderBase]: For 18390/20337 co-relation queries the response was YES. [2024-11-19 06:02:43,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43817 conditions, 13026 events. 5098/13026 cut-off events. For 18390/20337 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 129019 event pairs, 584 based on Foata normal form. 295/12780 useless extension candidates. Maximal degree in co-relation 39905. Up to 3171 conditions per place. [2024-11-19 06:02:43,977 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 339 selfloop transitions, 262 changer transitions 6/687 dead transitions. [2024-11-19 06:02:43,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 687 transitions, 6029 flow [2024-11-19 06:02:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 06:02:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-19 06:02:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1593 transitions. [2024-11-19 06:02:43,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7564102564102564 [2024-11-19 06:02:43,981 INFO L175 Difference]: Start difference. First operand has 157 places, 298 transitions, 1935 flow. Second operand 18 states and 1593 transitions. [2024-11-19 06:02:43,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 687 transitions, 6029 flow [2024-11-19 06:02:44,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 687 transitions, 5885 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-19 06:02:44,045 INFO L231 Difference]: Finished difference. Result has 172 places, 504 transitions, 4571 flow [2024-11-19 06:02:44,045 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=1863, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4571, PETRI_PLACES=172, PETRI_TRANSITIONS=504} [2024-11-19 06:02:44,046 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 55 predicate places. [2024-11-19 06:02:44,046 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 504 transitions, 4571 flow [2024-11-19 06:02:44,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.9090909090909) internal successors, (879), 11 states have internal predecessors, (879), 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-19 06:02:44,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:44,046 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] [2024-11-19 06:02:44,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:02:44,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:44,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1121471070, now seen corresponding path program 1 times [2024-11-19 06:02:44,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:44,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159065481] [2024-11-19 06:02:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:02:44,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159065481] [2024-11-19 06:02:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159065481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:44,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:44,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:02:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914586171] [2024-11-19 06:02:44,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:44,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:02:44,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:02:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:02:44,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 117 [2024-11-19 06:02:44,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 504 transitions, 4571 flow. Second operand has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 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-19 06:02:44,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:44,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 117 [2024-11-19 06:02:44,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:46,744 INFO L124 PetriNetUnfolderBase]: 4493/12055 cut-off events. [2024-11-19 06:02:46,745 INFO L125 PetriNetUnfolderBase]: For 34759/35368 co-relation queries the response was YES. [2024-11-19 06:02:46,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48086 conditions, 12055 events. 4493/12055 cut-off events. For 34759/35368 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 121277 event pairs, 446 based on Foata normal form. 184/11667 useless extension candidates. Maximal degree in co-relation 46711. Up to 3248 conditions per place. [2024-11-19 06:02:46,843 INFO L140 encePairwiseOnDemand]: 103/117 looper letters, 495 selfloop transitions, 44 changer transitions 0/656 dead transitions. [2024-11-19 06:02:46,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 656 transitions, 7534 flow [2024-11-19 06:02:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:02:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 06:02:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1098 transitions. [2024-11-19 06:02:46,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7218934911242604 [2024-11-19 06:02:46,846 INFO L175 Difference]: Start difference. First operand has 172 places, 504 transitions, 4571 flow. Second operand 13 states and 1098 transitions. [2024-11-19 06:02:46,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 656 transitions, 7534 flow [2024-11-19 06:02:47,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 656 transitions, 7456 flow, removed 34 selfloop flow, removed 5 redundant places. [2024-11-19 06:02:47,026 INFO L231 Difference]: Finished difference. Result has 178 places, 503 transitions, 4585 flow [2024-11-19 06:02:47,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4585, PETRI_PLACES=178, PETRI_TRANSITIONS=503} [2024-11-19 06:02:47,027 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2024-11-19 06:02:47,027 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 503 transitions, 4585 flow [2024-11-19 06:02:47,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 79.81818181818181) internal successors, (878), 11 states have internal predecessors, (878), 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-19 06:02:47,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:47,028 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-19 06:02:47,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 06:02:47,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:47,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:47,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1249667111, now seen corresponding path program 1 times [2024-11-19 06:02:47,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:47,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28811564] [2024-11-19 06:02:47,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:02:47,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:47,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28811564] [2024-11-19 06:02:47,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28811564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:47,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:47,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:47,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107436879] [2024-11-19 06:02:47,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:47,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:47,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:47,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:47,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2024-11-19 06:02:47,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 503 transitions, 4585 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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-19 06:02:47,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:47,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2024-11-19 06:02:47,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:48,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([359] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread2of2ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread2of2ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_3|, ~datas~0.offset=v_~datas~0.offset_5, threadThread2of2ForFork0_~i~0=v_threadThread2of2ForFork0_~i~0_5} AuxVars[] AssignedVars[#race][342], [Black: 130#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 132#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 131#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 129#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), 66#L1022-7true, 118#true, 95#L1022-11true, Black: 140#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 579#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 577#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 571#true, 67#L1036-1true, Black: 593#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 581#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 597#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 154#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 578#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 151#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))), Black: 595#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 152#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 153#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 591#(and (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= (select |#valid| |ULTIMATE.start_main_~tids~0#1.base|) 1)), Black: 580#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4) 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of2ForFork0_~i~0 4))))), Black: 161#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0), Black: 162#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 164#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), Black: 163#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ (* |ULTIMATE.start_main_~i~2#1| 4) |ULTIMATE.start_main_~tids~0#1.offset| 1)) 0)), 149#true, 159#true, 125#(= |#race~datas~0| 0), 116#true, 637#(= |threadThread2of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread2of2ForFork0_~i~0 4) ~datas~0.offset))), 613#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 576#(not (= ~datas~0.base |ULTIMATE.start_main_~tids~0#1.base|)), 127#true, Black: 123#true]) [2024-11-19 06:02:48,389 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2024-11-19 06:02:48,389 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-19 06:02:48,389 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-19 06:02:48,389 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2024-11-19 06:02:50,433 INFO L124 PetriNetUnfolderBase]: 9680/22056 cut-off events. [2024-11-19 06:02:50,433 INFO L125 PetriNetUnfolderBase]: For 74960/76100 co-relation queries the response was YES. [2024-11-19 06:02:50,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90124 conditions, 22056 events. 9680/22056 cut-off events. For 74960/76100 co-relation queries the response was YES. Maximal size of possible extension queue 1324. Compared 226486 event pairs, 1081 based on Foata normal form. 11/20925 useless extension candidates. Maximal degree in co-relation 88034. Up to 11088 conditions per place. [2024-11-19 06:02:50,695 INFO L140 encePairwiseOnDemand]: 98/117 looper letters, 362 selfloop transitions, 355 changer transitions 12/860 dead transitions. [2024-11-19 06:02:50,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 860 transitions, 9417 flow [2024-11-19 06:02:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2024-11-19 06:02:50,697 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8817663817663818 [2024-11-19 06:02:50,697 INFO L175 Difference]: Start difference. First operand has 178 places, 503 transitions, 4585 flow. Second operand 6 states and 619 transitions. [2024-11-19 06:02:50,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 860 transitions, 9417 flow [2024-11-19 06:02:51,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 860 transitions, 9181 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-19 06:02:51,194 INFO L231 Difference]: Finished difference. Result has 175 places, 778 transitions, 8336 flow [2024-11-19 06:02:51,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=4497, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8336, PETRI_PLACES=175, PETRI_TRANSITIONS=778} [2024-11-19 06:02:51,195 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 58 predicate places. [2024-11-19 06:02:51,195 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 778 transitions, 8336 flow [2024-11-19 06:02:51,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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-19 06:02:51,195 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:51,195 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 06:02:51,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 06:02:51,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-19 06:02:51,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:51,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1645103095, now seen corresponding path program 1 times [2024-11-19 06:02:51,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:51,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038992441] [2024-11-19 06:02:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:02:51,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 06:02:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 06:02:51,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 06:02:51,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 06:02:51,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-19 06:02:51,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-19 06:02:51,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-19 06:02:51,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-19 06:02:51,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-19 06:02:51,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-19 06:02:51,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-19 06:02:51,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-19 06:02:51,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-19 06:02:51,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-19 06:02:51,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-19 06:02:51,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 06:02:51,241 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:02:51,241 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 06:02:51,241 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 06:02:51,264 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 06:02:51,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 138 transitions, 303 flow [2024-11-19 06:02:51,301 INFO L124 PetriNetUnfolderBase]: 21/368 cut-off events. [2024-11-19 06:02:51,301 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2024-11-19 06:02:51,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 368 events. 21/368 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1024 event pairs, 1 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 231. Up to 16 conditions per place. [2024-11-19 06:02:51,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 138 transitions, 303 flow [2024-11-19 06:02:51,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 138 transitions, 303 flow [2024-11-19 06:02:51,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:02:51,306 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;@24127583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:02:51,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-19 06:02:51,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 06:02:51,308 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2024-11-19 06:02:51,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 06:02:51,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:51,308 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] [2024-11-19 06:02:51,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-19 06:02:51,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:51,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1113706995, now seen corresponding path program 1 times [2024-11-19 06:02:51,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:51,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528608300] [2024-11-19 06:02:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:51,326 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-19 06:02:51,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:51,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528608300] [2024-11-19 06:02:51,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528608300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:51,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066168417] [2024-11-19 06:02:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:51,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:51,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-19 06:02:51,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 303 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-19 06:02:51,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:51,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-19 06:02:51,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:51,612 INFO L124 PetriNetUnfolderBase]: 90/1260 cut-off events. [2024-11-19 06:02:51,612 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-19 06:02:51,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1260 events. 90/1260 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8329 event pairs, 81 based on Foata normal form. 25/1116 useless extension candidates. Maximal degree in co-relation 877. Up to 178 conditions per place. [2024-11-19 06:02:51,617 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 2 changer transitions 1/134 dead transitions. [2024-11-19 06:02:51,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 134 transitions, 327 flow [2024-11-19 06:02:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-19 06:02:51,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2024-11-19 06:02:51,619 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 303 flow. Second operand 3 states and 374 transitions. [2024-11-19 06:02:51,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 134 transitions, 327 flow [2024-11-19 06:02:51,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:51,621 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 297 flow [2024-11-19 06:02:51,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2024-11-19 06:02:51,622 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 1 predicate places. [2024-11-19 06:02:51,622 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 297 flow [2024-11-19 06:02:51,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-19 06:02:51,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:51,623 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] [2024-11-19 06:02:51,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 06:02:51,623 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-19 06:02:51,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1671261316, now seen corresponding path program 1 times [2024-11-19 06:02:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618103201] [2024-11-19 06:02:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:51,640 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-19 06:02:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618103201] [2024-11-19 06:02:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618103201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:51,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:51,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:02:51,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796935357] [2024-11-19 06:02:51,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:51,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:02:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:51,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:02:51,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:02:51,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-11-19 06:02:51,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 297 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-19 06:02:51,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:51,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-11-19 06:02:51,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:51,827 INFO L124 PetriNetUnfolderBase]: 307/2452 cut-off events. [2024-11-19 06:02:51,828 INFO L125 PetriNetUnfolderBase]: For 239/264 co-relation queries the response was YES. [2024-11-19 06:02:51,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3073 conditions, 2452 events. 307/2452 cut-off events. For 239/264 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 19851 event pairs, 214 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 3039. Up to 507 conditions per place. [2024-11-19 06:02:51,841 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 17 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-11-19 06:02:51,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 135 transitions, 355 flow [2024-11-19 06:02:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:02:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 06:02:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-19 06:02:51,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-11-19 06:02:51,843 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 297 flow. Second operand 3 states and 373 transitions. [2024-11-19 06:02:51,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 135 transitions, 355 flow [2024-11-19 06:02:51,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 06:02:51,844 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 313 flow [2024-11-19 06:02:51,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-11-19 06:02:51,845 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, -3 predicate places. [2024-11-19 06:02:51,845 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 313 flow [2024-11-19 06:02:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-19 06:02:51,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:51,846 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] [2024-11-19 06:02:51,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 06:02:51,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-19 06:02:51,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:51,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1076870248, now seen corresponding path program 1 times [2024-11-19 06:02:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:51,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372716899] [2024-11-19 06:02:51,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:51,975 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-19 06:02:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372716899] [2024-11-19 06:02:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372716899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:51,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929401841] [2024-11-19 06:02:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:51,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:51,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:51,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:52,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 138 [2024-11-19 06:02:52,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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-19 06:02:52,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:52,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 138 [2024-11-19 06:02:52,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:54,237 INFO L124 PetriNetUnfolderBase]: 10379/23786 cut-off events. [2024-11-19 06:02:54,237 INFO L125 PetriNetUnfolderBase]: For 1187/1187 co-relation queries the response was YES. [2024-11-19 06:02:54,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39831 conditions, 23786 events. 10379/23786 cut-off events. For 1187/1187 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 241511 event pairs, 6716 based on Foata normal form. 0/21792 useless extension candidates. Maximal degree in co-relation 32196. Up to 14165 conditions per place. [2024-11-19 06:02:54,385 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 37 selfloop transitions, 54 changer transitions 0/188 dead transitions. [2024-11-19 06:02:54,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 617 flow [2024-11-19 06:02:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2024-11-19 06:02:54,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2024-11-19 06:02:54,387 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 313 flow. Second operand 6 states and 686 transitions. [2024-11-19 06:02:54,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 617 flow [2024-11-19 06:02:54,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 188 transitions, 617 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:54,391 INFO L231 Difference]: Finished difference. Result has 146 places, 186 transitions, 671 flow [2024-11-19 06:02:54,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=671, PETRI_PLACES=146, PETRI_TRANSITIONS=186} [2024-11-19 06:02:54,392 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 7 predicate places. [2024-11-19 06:02:54,392 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 186 transitions, 671 flow [2024-11-19 06:02:54,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 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-19 06:02:54,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:54,392 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] [2024-11-19 06:02:54,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 06:02:54,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-19 06:02:54,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1210831814, now seen corresponding path program 1 times [2024-11-19 06:02:54,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:54,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937941977] [2024-11-19 06:02:54,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:54,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:54,443 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-19 06:02:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:54,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937941977] [2024-11-19 06:02:54,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937941977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:54,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:54,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140221947] [2024-11-19 06:02:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:54,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:02:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:02:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:02:54,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-19 06:02:54,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 186 transitions, 671 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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-19 06:02:54,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:54,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-19 06:02:54,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:55,675 INFO L124 PetriNetUnfolderBase]: 4742/12157 cut-off events. [2024-11-19 06:02:55,675 INFO L125 PetriNetUnfolderBase]: For 3135/3635 co-relation queries the response was YES. [2024-11-19 06:02:55,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23497 conditions, 12157 events. 4742/12157 cut-off events. For 3135/3635 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 114328 event pairs, 1822 based on Foata normal form. 2/11490 useless extension candidates. Maximal degree in co-relation 19222. Up to 5587 conditions per place. [2024-11-19 06:02:55,759 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 16 selfloop transitions, 2 changer transitions 5/192 dead transitions. [2024-11-19 06:02:55,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 192 transitions, 729 flow [2024-11-19 06:02:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:02:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:02:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 732 transitions. [2024-11-19 06:02:55,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-11-19 06:02:55,761 INFO L175 Difference]: Start difference. First operand has 146 places, 186 transitions, 671 flow. Second operand 6 states and 732 transitions. [2024-11-19 06:02:55,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 192 transitions, 729 flow [2024-11-19 06:02:55,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 192 transitions, 729 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 06:02:55,783 INFO L231 Difference]: Finished difference. Result has 155 places, 187 transitions, 693 flow [2024-11-19 06:02:55,783 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=155, PETRI_TRANSITIONS=187} [2024-11-19 06:02:55,784 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 16 predicate places. [2024-11-19 06:02:55,784 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 187 transitions, 693 flow [2024-11-19 06:02:55,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 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-19 06:02:55,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:02:55,785 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] [2024-11-19 06:02:55,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 06:02:55,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-19 06:02:55,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:02:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1389642421, now seen corresponding path program 1 times [2024-11-19 06:02:55,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:02:55,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053386822] [2024-11-19 06:02:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:02:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:02:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:02:55,928 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-19 06:02:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:02:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053386822] [2024-11-19 06:02:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053386822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:02:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:02:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:02:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811741515] [2024-11-19 06:02:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:02:55,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:02:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:02:55,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:02:55,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:02:56,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 138 [2024-11-19 06:02:56,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 187 transitions, 693 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:02:56,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:02:56,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 138 [2024-11-19 06:02:56,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:02:59,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [88#L1022-7true, Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-19 06:02:59,181 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-19 06:02:59,181 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-19 06:02:59,181 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-19 06:02:59,182 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-19 06:02:59,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 78#L1022-8true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-19 06:02:59,435 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2024-11-19 06:02:59,435 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-19 06:02:59,435 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-19 06:02:59,435 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-11-19 06:02:59,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 171#true, 34#L1022-9true, 115#L1022-7true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-19 06:02:59,655 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-11-19 06:02:59,655 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-19 06:02:59,655 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-19 06:02:59,655 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-19 06:02:59,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([478] L1022-6-->L1022-7: Formula: (= (store |v_#race_22| v_~datas~0.base_5 (store (select |v_#race_22| v_~datas~0.base_5) (+ (* v_threadThread3of3ForFork0_~i~0_5 4) v_~datas~0.offset_5) |v_threadThread3of3ForFork0_#t~nondet4_3|)) |v_#race_21|) InVars {#race=|v_#race_22|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} OutVars{#race=|v_#race_21|, ~datas~0.base=v_~datas~0.base_5, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, threadThread3of3ForFork0_~i~0=v_threadThread3of3ForFork0_~i~0_5, ~datas~0.offset=v_~datas~0.offset_5} AuxVars[] AssignedVars[#race][287], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 164#(and (<= |ULTIMATE.start_main_~threads_total~0#1| 0) (= |ULTIMATE.start_main_~i~2#1| 0)), Black: 166#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 163#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), 149#true, 38#L1022-11true, 136#true, 115#L1022-7true, 171#true, 147#(= |#race~datas~0| 0), 140#true, Black: 145#true, 160#true, 138#true, 103#L1031-9true, 93#L1022-10true, Black: 154#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 151#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|), Black: 152#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|)), Black: 153#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) |ULTIMATE.start_main_#t~nondet10#1|) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) |ULTIMATE.start_main_#t~nondet10#1|))]) [2024-11-19 06:02:59,951 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2024-11-19 06:02:59,951 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-19 06:02:59,951 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-19 06:02:59,951 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-11-19 06:03:02,640 INFO L124 PetriNetUnfolderBase]: 29047/67038 cut-off events. [2024-11-19 06:03:02,640 INFO L125 PetriNetUnfolderBase]: For 19554/23332 co-relation queries the response was YES. [2024-11-19 06:03:03,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151012 conditions, 67038 events. 29047/67038 cut-off events. For 19554/23332 co-relation queries the response was YES. Maximal size of possible extension queue 2164. Compared 771800 event pairs, 6939 based on Foata normal form. 87/61871 useless extension candidates. Maximal degree in co-relation 150909. Up to 28700 conditions per place. [2024-11-19 06:03:03,335 INFO L140 encePairwiseOnDemand]: 115/138 looper letters, 128 selfloop transitions, 118 changer transitions 0/349 dead transitions. [2024-11-19 06:03:03,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 349 transitions, 1957 flow [2024-11-19 06:03:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2024-11-19 06:03:03,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8973429951690821 [2024-11-19 06:03:03,337 INFO L175 Difference]: Start difference. First operand has 155 places, 187 transitions, 693 flow. Second operand 6 states and 743 transitions. [2024-11-19 06:03:03,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 349 transitions, 1957 flow [2024-11-19 06:03:03,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 349 transitions, 1945 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 06:03:03,459 INFO L231 Difference]: Finished difference. Result has 157 places, 304 transitions, 1754 flow [2024-11-19 06:03:03,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1754, PETRI_PLACES=157, PETRI_TRANSITIONS=304} [2024-11-19 06:03:03,460 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 18 predicate places. [2024-11-19 06:03:03,460 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 304 transitions, 1754 flow [2024-11-19 06:03:03,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:03:03,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:03,460 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] [2024-11-19 06:03:03,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 06:03:03,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-19 06:03:03,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1362260044, now seen corresponding path program 1 times [2024-11-19 06:03:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415243648] [2024-11-19 06:03:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:03,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:03:03,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:03,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415243648] [2024-11-19 06:03:03,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415243648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:03:03,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:03:03,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:03:03,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488938731] [2024-11-19 06:03:03,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:03:03,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:03:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:03,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:03:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:03:03,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 138 [2024-11-19 06:03:03,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 304 transitions, 1754 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 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-19 06:03:03,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:03,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 138 [2024-11-19 06:03:03,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 06:03:12,883 INFO L124 PetriNetUnfolderBase]: 35337/82836 cut-off events. [2024-11-19 06:03:12,883 INFO L125 PetriNetUnfolderBase]: For 74578/77386 co-relation queries the response was YES. [2024-11-19 06:03:13,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242202 conditions, 82836 events. 35337/82836 cut-off events. For 74578/77386 co-relation queries the response was YES. Maximal size of possible extension queue 2670. Compared 1002516 event pairs, 8904 based on Foata normal form. 186/77295 useless extension candidates. Maximal degree in co-relation 232468. Up to 43542 conditions per place. [2024-11-19 06:03:13,715 INFO L140 encePairwiseOnDemand]: 119/138 looper letters, 192 selfloop transitions, 110 changer transitions 0/412 dead transitions. [2024-11-19 06:03:13,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 412 transitions, 3086 flow [2024-11-19 06:03:13,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:03:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 06:03:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2024-11-19 06:03:13,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417874396135265 [2024-11-19 06:03:13,716 INFO L175 Difference]: Start difference. First operand has 157 places, 304 transitions, 1754 flow. Second operand 6 states and 697 transitions. [2024-11-19 06:03:13,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 412 transitions, 3086 flow [2024-11-19 06:03:14,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 412 transitions, 3068 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-19 06:03:14,405 INFO L231 Difference]: Finished difference. Result has 167 places, 409 transitions, 2981 flow [2024-11-19 06:03:14,406 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1736, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2981, PETRI_PLACES=167, PETRI_TRANSITIONS=409} [2024-11-19 06:03:14,406 INFO L277 CegarLoopForPetriNet]: 139 programPoint places, 28 predicate places. [2024-11-19 06:03:14,406 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 409 transitions, 2981 flow [2024-11-19 06:03:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 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-19 06:03:14,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 06:03:14,406 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-19 06:03:14,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 06:03:14,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-19 06:03:14,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:03:14,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1695343455, now seen corresponding path program 1 times [2024-11-19 06:03:14,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:03:14,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738668495] [2024-11-19 06:03:14,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:14,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:03:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:03:14,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:03:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738668495] [2024-11-19 06:03:14,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738668495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:03:14,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660165828] [2024-11-19 06:03:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:03:14,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:03:14,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:03:14,661 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-19 06:03:14,662 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-19 06:03:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:03:14,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 06:03:14,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:03:14,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-19 06:03:14,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:03:14,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:03:14,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 06:03:14,796 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 28 treesize of output 27 [2024-11-19 06:03:14,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:03:14,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-11-19 06:03:14,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:03:14,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-11-19 06:03:14,902 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 56 treesize of output 45 [2024-11-19 06:03:14,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 06:03:14,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:03:14,933 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse0)) |c_ULTIMATE.start_main_#t~nondet10#1|)))) is different from false [2024-11-19 06:03:15,023 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-19 06:03:15,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse1)) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-19 06:03:15,051 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~tids~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse3 |c_ULTIMATE.start_main_#t~nondet10#1|) .cse2 |c_ULTIMATE.start_main_#t~nondet10#1|)))) (and (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet10#1|)) (forall ((v_ArrVal_515 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_515) |c_ULTIMATE.start_main_~tids~0#1.base|) (+ |c_ULTIMATE.start_main_~tids~0#1.offset| .cse4)) |c_ULTIMATE.start_main_#t~nondet10#1|)))))) is different from false [2024-11-19 06:03:15,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:03:15,065 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 4 case distinctions, treesize of input 51 treesize of output 67 [2024-11-19 06:03:15,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:03:15,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 35 [2024-11-19 06:03:15,077 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 06:03:15,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 06:03:15,082 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 06:03:15,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-11-19 06:03:15,086 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-11-19 06:03:15,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-11-19 06:03:15,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2024-11-19 06:03:15,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660165828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:03:15,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:03:15,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2024-11-19 06:03:15,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121535893] [2024-11-19 06:03:15,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:03:15,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 06:03:15,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:03:15,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 06:03:15,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=124, Unknown=4, NotChecked=100, Total=272 [2024-11-19 06:03:15,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 138 [2024-11-19 06:03:15,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 409 transitions, 2981 flow. Second operand has 17 states, 17 states have (on average 76.29411764705883) internal successors, (1297), 17 states have internal predecessors, (1297), 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-19 06:03:15,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 06:03:15,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 138 [2024-11-19 06:03:15,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand