./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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/weaver/popl20-more-vector-add.wvr.c -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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:02:30,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:02:30,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:02:30,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:02:30,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:02:30,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:02:30,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:02:30,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:02:30,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:02:30,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:02:30,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:02:30,804 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:02:30,805 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:02:30,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:02:30,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:02:30,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:02:30,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:02:30,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:02:30,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:02:30,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:02:30,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:02:30,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:02:30,811 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:02:30,812 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:02:30,812 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:02:30,812 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:02:30,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:02:30,813 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:02:30,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:02:30,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:02:30,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:02:30,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:02:30,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:02:30,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:02:30,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:02:30,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:02:30,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:02:30,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:02:30,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:02:30,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:02:30,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:02:30,818 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2024-11-09 07:02:31,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:02:31,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:02:31,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:02:31,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:02:31,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:02:31,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-09 07:02:32,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:02:32,759 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:02:32,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2024-11-09 07:02:32,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08553863a/4756c400dece400c8b14dd0f9aac2c56/FLAGe18cc74b9 [2024-11-09 07:02:32,781 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08553863a/4756c400dece400c8b14dd0f9aac2c56 [2024-11-09 07:02:32,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:02:32,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:02:32,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:02:32,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:02:32,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:02:32,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:02:32" (1/1) ... [2024-11-09 07:02:32,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b31ba9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:32, skipping insertion in model container [2024-11-09 07:02:32,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:02:32" (1/1) ... [2024-11-09 07:02:32,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:02:33,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:02:33,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:02:33,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:02:33,154 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:02:33,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33 WrapperNode [2024-11-09 07:02:33,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:02:33,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:02:33,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:02:33,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:02:33,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,222 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 277 [2024-11-09 07:02:33,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:02:33,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:02:33,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:02:33,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:02:33,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:02:33,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:02:33,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:02:33,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:02:33,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:02:33,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:02:33,370 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-09 07:02:33,377 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-09 07:02:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:02:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:02:33,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:02:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:02:33,444 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:02:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:02:33,445 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:02:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:02:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:02:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:02:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:02:33,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:02:33,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:02:33,447 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:02:33,553 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:02:33,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:02:34,274 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:02:34,275 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:02:34,314 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:02:34,314 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-09 07:02:34,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:34 BoogieIcfgContainer [2024-11-09 07:02:34,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:02:34,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:02:34,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:02:34,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:02:34,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:02:32" (1/3) ... [2024-11-09 07:02:34,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740e304f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:34, skipping insertion in model container [2024-11-09 07:02:34,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (2/3) ... [2024-11-09 07:02:34,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740e304f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:34, skipping insertion in model container [2024-11-09 07:02:34,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:34" (3/3) ... [2024-11-09 07:02:34,327 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2024-11-09 07:02:34,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:02:34,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-09 07:02:34,344 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:02:34,483 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 07:02:34,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 493 places, 510 transitions, 1041 flow [2024-11-09 07:02:34,701 INFO L124 PetriNetUnfolderBase]: 27/507 cut-off events. [2024-11-09 07:02:34,702 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 07:02:34,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 507 events. 27/507 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 717 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 396. Up to 2 conditions per place. [2024-11-09 07:02:34,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 493 places, 510 transitions, 1041 flow [2024-11-09 07:02:34,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 472 places, 488 transitions, 994 flow [2024-11-09 07:02:34,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:02:34,745 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;@7712afa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:02:34,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2024-11-09 07:02:34,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:02:34,751 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-09 07:02:34,751 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:02:34,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:34,752 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-09 07:02:34,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:34,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1336570435, now seen corresponding path program 1 times [2024-11-09 07:02:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704779261] [2024-11-09 07:02:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:34,978 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-09 07:02:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704779261] [2024-11-09 07:02:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704779261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:34,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963723088] [2024-11-09 07:02:34,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:34,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:34,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:35,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:35,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 510 [2024-11-09 07:02:35,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 488 transitions, 994 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-09 07:02:35,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:35,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 510 [2024-11-09 07:02:35,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:35,319 INFO L124 PetriNetUnfolderBase]: 23/763 cut-off events. [2024-11-09 07:02:35,319 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-09 07:02:35,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 763 events. 23/763 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2635 event pairs, 7 based on Foata normal form. 26/674 useless extension candidates. Maximal degree in co-relation 423. Up to 31 conditions per place. [2024-11-09 07:02:35,332 INFO L140 encePairwiseOnDemand]: 490/510 looper letters, 13 selfloop transitions, 2 changer transitions 10/470 dead transitions. [2024-11-09 07:02:35,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 470 transitions, 988 flow [2024-11-09 07:02:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1455 transitions. [2024-11-09 07:02:35,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509803921568627 [2024-11-09 07:02:35,362 INFO L175 Difference]: Start difference. First operand has 472 places, 488 transitions, 994 flow. Second operand 3 states and 1455 transitions. [2024-11-09 07:02:35,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 470 transitions, 988 flow [2024-11-09 07:02:35,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 470 transitions, 976 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 07:02:35,382 INFO L231 Difference]: Finished difference. Result has 467 places, 460 transitions, 930 flow [2024-11-09 07:02:35,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=930, PETRI_PLACES=467, PETRI_TRANSITIONS=460} [2024-11-09 07:02:35,391 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -5 predicate places. [2024-11-09 07:02:35,392 INFO L471 AbstractCegarLoop]: Abstraction has has 467 places, 460 transitions, 930 flow [2024-11-09 07:02:35,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-09 07:02:35,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:35,393 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] [2024-11-09 07:02:35,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:02:35,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:35,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 599438832, now seen corresponding path program 1 times [2024-11-09 07:02:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:35,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98830072] [2024-11-09 07:02:35,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:35,478 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-09 07:02:35,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98830072] [2024-11-09 07:02:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98830072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:35,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581726931] [2024-11-09 07:02:35,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:35,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:35,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:35,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 470 out of 510 [2024-11-09 07:02:35,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 460 transitions, 930 flow. Second operand has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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-09 07:02:35,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:35,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 470 of 510 [2024-11-09 07:02:35,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:35,647 INFO L124 PetriNetUnfolderBase]: 17/604 cut-off events. [2024-11-09 07:02:35,648 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:02:35,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 604 events. 17/604 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1615 event pairs, 5 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 615. Up to 31 conditions per place. [2024-11-09 07:02:35,655 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 17 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2024-11-09 07:02:35,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 459 transitions, 966 flow [2024-11-09 07:02:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1430 transitions. [2024-11-09 07:02:35,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934640522875817 [2024-11-09 07:02:35,661 INFO L175 Difference]: Start difference. First operand has 467 places, 460 transitions, 930 flow. Second operand 3 states and 1430 transitions. [2024-11-09 07:02:35,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 459 transitions, 966 flow [2024-11-09 07:02:35,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 459 transitions, 962 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:35,670 INFO L231 Difference]: Finished difference. Result has 456 places, 459 transitions, 928 flow [2024-11-09 07:02:35,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=456, PETRI_TRANSITIONS=459} [2024-11-09 07:02:35,672 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2024-11-09 07:02:35,672 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 459 transitions, 928 flow [2024-11-09 07:02:35,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 471.3333333333333) internal successors, (1414), 3 states have internal predecessors, (1414), 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-09 07:02:35,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:35,674 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] [2024-11-09 07:02:35,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:02:35,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:35,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1133413882, now seen corresponding path program 1 times [2024-11-09 07:02:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:35,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116130366] [2024-11-09 07:02:35,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:35,746 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-09 07:02:35,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116130366] [2024-11-09 07:02:35,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116130366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:35,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:35,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:35,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184643428] [2024-11-09 07:02:35,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:35,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:35,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:35,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:35,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 510 [2024-11-09 07:02:35,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 459 transitions, 928 flow. Second operand has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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-09 07:02:35,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:35,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 510 [2024-11-09 07:02:35,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:36,031 INFO L124 PetriNetUnfolderBase]: 29/735 cut-off events. [2024-11-09 07:02:36,032 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-09 07:02:36,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 735 events. 29/735 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2618 event pairs, 12 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 763. Up to 54 conditions per place. [2024-11-09 07:02:36,044 INFO L140 encePairwiseOnDemand]: 501/510 looper letters, 22 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-11-09 07:02:36,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 958 flow [2024-11-09 07:02:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1411 transitions. [2024-11-09 07:02:36,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9222222222222223 [2024-11-09 07:02:36,049 INFO L175 Difference]: Start difference. First operand has 456 places, 459 transitions, 928 flow. Second operand 3 states and 1411 transitions. [2024-11-09 07:02:36,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 958 flow [2024-11-09 07:02:36,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:36,060 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2024-11-09 07:02:36,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2024-11-09 07:02:36,063 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2024-11-09 07:02:36,063 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2024-11-09 07:02:36,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.0) internal successors, (1383), 3 states have internal predecessors, (1383), 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-09 07:02:36,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:36,064 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:36,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:02:36,065 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:36,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1725255605, now seen corresponding path program 1 times [2024-11-09 07:02:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:36,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439094620] [2024-11-09 07:02:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:36,720 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-09 07:02:36,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439094620] [2024-11-09 07:02:36,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439094620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:36,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:36,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:36,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855302453] [2024-11-09 07:02:36,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:36,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:36,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:36,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:37,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 510 [2024-11-09 07:02:37,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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-09 07:02:37,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:37,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 510 [2024-11-09 07:02:37,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:40,969 INFO L124 PetriNetUnfolderBase]: 5286/18618 cut-off events. [2024-11-09 07:02:40,970 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-11-09 07:02:41,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26699 conditions, 18618 events. 5286/18618 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 211803 event pairs, 4536 based on Foata normal form. 0/15895 useless extension candidates. Maximal degree in co-relation 26661. Up to 7875 conditions per place. [2024-11-09 07:02:41,136 INFO L140 encePairwiseOnDemand]: 486/510 looper letters, 82 selfloop transitions, 20 changer transitions 0/447 dead transitions. [2024-11-09 07:02:41,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 447 transitions, 1106 flow [2024-11-09 07:02:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2416 transitions. [2024-11-09 07:02:41,143 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7895424836601307 [2024-11-09 07:02:41,143 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2416 transitions. [2024-11-09 07:02:41,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 447 transitions, 1106 flow [2024-11-09 07:02:41,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 447 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:41,151 INFO L231 Difference]: Finished difference. Result has 448 places, 447 transitions, 941 flow [2024-11-09 07:02:41,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=448, PETRI_TRANSITIONS=447} [2024-11-09 07:02:41,154 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -24 predicate places. [2024-11-09 07:02:41,155 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 447 transitions, 941 flow [2024-11-09 07:02:41,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.5) internal successors, (2319), 6 states have internal predecessors, (2319), 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-09 07:02:41,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:02:41,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:41,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,161 INFO L85 PathProgramCache]: Analyzing trace with hash -813396907, now seen corresponding path program 1 times [2024-11-09 07:02:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273643190] [2024-11-09 07:02:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,203 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-09 07:02:41,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273643190] [2024-11-09 07:02:41,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273643190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568512913] [2024-11-09 07:02:41,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-09 07:02:41,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 447 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:41,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-09 07:02:41,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,328 INFO L124 PetriNetUnfolderBase]: 28/674 cut-off events. [2024-11-09 07:02:41,328 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:02:41,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 674 events. 28/674 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2251 event pairs, 15 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 707. Up to 40 conditions per place. [2024-11-09 07:02:41,335 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2024-11-09 07:02:41,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 446 transitions, 967 flow [2024-11-09 07:02:41,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2024-11-09 07:02:41,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-09 07:02:41,338 INFO L175 Difference]: Start difference. First operand has 448 places, 447 transitions, 941 flow. Second operand 3 states and 1440 transitions. [2024-11-09 07:02:41,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 446 transitions, 967 flow [2024-11-09 07:02:41,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 446 transitions, 927 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:02:41,346 INFO L231 Difference]: Finished difference. Result has 444 places, 446 transitions, 903 flow [2024-11-09 07:02:41,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=444, PETRI_TRANSITIONS=446} [2024-11-09 07:02:41,350 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -28 predicate places. [2024-11-09 07:02:41,351 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 446 transitions, 903 flow [2024-11-09 07:02:41,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:41,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,352 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:02:41,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:41,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -67140239, now seen corresponding path program 1 times [2024-11-09 07:02:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572388510] [2024-11-09 07:02:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,415 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-09 07:02:41,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572388510] [2024-11-09 07:02:41,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572388510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380511206] [2024-11-09 07:02:41,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-09 07:02:41,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 446 transitions, 903 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:41,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-09 07:02:41,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,519 INFO L124 PetriNetUnfolderBase]: 28/673 cut-off events. [2024-11-09 07:02:41,519 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:02:41,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 673 events. 28/673 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2201 event pairs, 15 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 688. Up to 40 conditions per place. [2024-11-09 07:02:41,526 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2024-11-09 07:02:41,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 445 transitions, 929 flow [2024-11-09 07:02:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2024-11-09 07:02:41,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-09 07:02:41,530 INFO L175 Difference]: Start difference. First operand has 444 places, 446 transitions, 903 flow. Second operand 3 states and 1440 transitions. [2024-11-09 07:02:41,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 445 transitions, 929 flow [2024-11-09 07:02:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 445 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:41,537 INFO L231 Difference]: Finished difference. Result has 443 places, 445 transitions, 901 flow [2024-11-09 07:02:41,538 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=443, PETRI_TRANSITIONS=445} [2024-11-09 07:02:41,538 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -29 predicate places. [2024-11-09 07:02:41,539 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 445 transitions, 901 flow [2024-11-09 07:02:41,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:41,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,540 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:02:41,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:41,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash 848299110, now seen corresponding path program 1 times [2024-11-09 07:02:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024754623] [2024-11-09 07:02:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,601 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-09 07:02:41,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024754623] [2024-11-09 07:02:41,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024754623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481647606] [2024-11-09 07:02:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 476 out of 510 [2024-11-09 07:02:41,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 445 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-09 07:02:41,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 476 of 510 [2024-11-09 07:02:41,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,738 INFO L124 PetriNetUnfolderBase]: 13/551 cut-off events. [2024-11-09 07:02:41,739 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 07:02:41,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 551 events. 13/551 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1292 event pairs, 2 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 540. Up to 16 conditions per place. [2024-11-09 07:02:41,743 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 11 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2024-11-09 07:02:41,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 444 transitions, 925 flow [2024-11-09 07:02:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1442 transitions. [2024-11-09 07:02:41,746 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9424836601307189 [2024-11-09 07:02:41,747 INFO L175 Difference]: Start difference. First operand has 443 places, 445 transitions, 901 flow. Second operand 3 states and 1442 transitions. [2024-11-09 07:02:41,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 444 transitions, 925 flow [2024-11-09 07:02:41,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 444 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:41,754 INFO L231 Difference]: Finished difference. Result has 442 places, 444 transitions, 899 flow [2024-11-09 07:02:41,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=442, PETRI_TRANSITIONS=444} [2024-11-09 07:02:41,756 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -30 predicate places. [2024-11-09 07:02:41,757 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 444 transitions, 899 flow [2024-11-09 07:02:41,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 477.3333333333333) internal successors, (1432), 3 states have internal predecessors, (1432), 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-09 07:02:41,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:02:41,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1504415495, now seen corresponding path program 1 times [2024-11-09 07:02:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457095748] [2024-11-09 07:02:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,831 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-09 07:02:41,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457095748] [2024-11-09 07:02:41,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457095748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039323908] [2024-11-09 07:02:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-09 07:02:41,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 444 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:41,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-09 07:02:41,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,921 INFO L124 PetriNetUnfolderBase]: 22/594 cut-off events. [2024-11-09 07:02:41,922 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-11-09 07:02:41,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 594 events. 22/594 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1561 event pairs, 7 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 598. Up to 32 conditions per place. [2024-11-09 07:02:41,928 INFO L140 encePairwiseOnDemand]: 507/510 looper letters, 12 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2024-11-09 07:02:41,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 443 transitions, 925 flow [2024-11-09 07:02:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1440 transitions. [2024-11-09 07:02:41,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-11-09 07:02:41,932 INFO L175 Difference]: Start difference. First operand has 442 places, 444 transitions, 899 flow. Second operand 3 states and 1440 transitions. [2024-11-09 07:02:41,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 443 transitions, 925 flow [2024-11-09 07:02:41,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 443 transitions, 921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:41,939 INFO L231 Difference]: Finished difference. Result has 441 places, 443 transitions, 897 flow [2024-11-09 07:02:41,940 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=441, PETRI_TRANSITIONS=443} [2024-11-09 07:02:41,941 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -31 predicate places. [2024-11-09 07:02:41,942 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 443 transitions, 897 flow [2024-11-09 07:02:41,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:41,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,944 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:02:41,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1782494843, now seen corresponding path program 1 times [2024-11-09 07:02:41,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133962849] [2024-11-09 07:02:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:42,009 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-09 07:02:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:42,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133962849] [2024-11-09 07:02:42,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133962849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:42,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:42,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:42,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433719038] [2024-11-09 07:02:42,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:42,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:42,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:42,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:42,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:42,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 510 [2024-11-09 07:02:42,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 443 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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-09 07:02:42,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:42,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 510 [2024-11-09 07:02:42,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:42,135 INFO L124 PetriNetUnfolderBase]: 41/877 cut-off events. [2024-11-09 07:02:42,135 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-09 07:02:42,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 877 events. 41/877 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3798 event pairs, 20 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 906. Up to 56 conditions per place. [2024-11-09 07:02:42,144 INFO L140 encePairwiseOnDemand]: 505/510 looper letters, 14 selfloop transitions, 1 changer transitions 0/439 dead transitions. [2024-11-09 07:02:42,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 439 transitions, 919 flow [2024-11-09 07:02:42,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2024-11-09 07:02:42,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2024-11-09 07:02:42,148 INFO L175 Difference]: Start difference. First operand has 441 places, 443 transitions, 897 flow. Second operand 3 states and 1435 transitions. [2024-11-09 07:02:42,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 439 transitions, 919 flow [2024-11-09 07:02:42,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 439 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:42,155 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 887 flow [2024-11-09 07:02:42,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-09 07:02:42,156 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-09 07:02:42,156 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 887 flow [2024-11-09 07:02:42,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 473.0) internal successors, (1419), 3 states have internal predecessors, (1419), 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-09 07:02:42,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:42,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:42,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:02:42,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1614437966, now seen corresponding path program 1 times [2024-11-09 07:02:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981678114] [2024-11-09 07:02:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:42,227 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-09 07:02:42,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:42,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981678114] [2024-11-09 07:02:42,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981678114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:42,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:42,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:42,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453224219] [2024-11-09 07:02:42,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:42,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:42,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:42,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:42,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 478 out of 510 [2024-11-09 07:02:42,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:02:42,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:42,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 478 of 510 [2024-11-09 07:02:42,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:42,374 INFO L124 PetriNetUnfolderBase]: 17/558 cut-off events. [2024-11-09 07:02:42,374 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:02:42,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 558 events. 17/558 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1286 event pairs, 0 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 558. Up to 19 conditions per place. [2024-11-09 07:02:42,378 INFO L140 encePairwiseOnDemand]: 506/510 looper letters, 16 selfloop transitions, 2 changer transitions 0/444 dead transitions. [2024-11-09 07:02:42,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 444 transitions, 938 flow [2024-11-09 07:02:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1454 transitions. [2024-11-09 07:02:42,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9503267973856209 [2024-11-09 07:02:42,383 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 887 flow. Second operand 3 states and 1454 transitions. [2024-11-09 07:02:42,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 444 transitions, 938 flow [2024-11-09 07:02:42,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 937 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:42,395 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 896 flow [2024-11-09 07:02:42,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-09 07:02:42,397 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-09 07:02:42,398 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 896 flow [2024-11-09 07:02:42,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 479.3333333333333) internal successors, (1438), 3 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:02:42,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:42,399 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:42,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:02:42,400 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:42,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:42,400 INFO L85 PathProgramCache]: Analyzing trace with hash -991653708, now seen corresponding path program 1 times [2024-11-09 07:02:42,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:42,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502435607] [2024-11-09 07:02:42,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:42,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:42,478 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-09 07:02:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502435607] [2024-11-09 07:02:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502435607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:42,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:42,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:42,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118163360] [2024-11-09 07:02:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:42,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:42,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:42,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-09 07:02:42,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:42,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:42,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-09 07:02:42,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:42,859 INFO L124 PetriNetUnfolderBase]: 135/1964 cut-off events. [2024-11-09 07:02:42,860 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2024-11-09 07:02:42,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 1964 events. 135/1964 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13272 event pairs, 36 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2150. Up to 187 conditions per place. [2024-11-09 07:02:42,880 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 18 selfloop transitions, 3 changer transitions 0/444 dead transitions. [2024-11-09 07:02:42,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 444 transitions, 953 flow [2024-11-09 07:02:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:42,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2024-11-09 07:02:42,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470588235294117 [2024-11-09 07:02:42,885 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 896 flow. Second operand 3 states and 1449 transitions. [2024-11-09 07:02:42,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 444 transitions, 953 flow [2024-11-09 07:02:42,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 444 transitions, 953 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:42,894 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 911 flow [2024-11-09 07:02:42,896 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=911, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-09 07:02:42,897 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-09 07:02:42,897 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 911 flow [2024-11-09 07:02:42,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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-09 07:02:42,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:42,899 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:42,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:02:42,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:42,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:42,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1009627412, now seen corresponding path program 1 times [2024-11-09 07:02:42,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:42,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88238598] [2024-11-09 07:02:42,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:42,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:42,980 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-09 07:02:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88238598] [2024-11-09 07:02:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88238598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:42,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173264230] [2024-11-09 07:02:42,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:42,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:42,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:42,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:42,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:42,997 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-09 07:02:43,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 911 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-09 07:02:43,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:43,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-09 07:02:43,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:43,320 INFO L124 PetriNetUnfolderBase]: 149/1734 cut-off events. [2024-11-09 07:02:43,320 INFO L125 PetriNetUnfolderBase]: For 50/54 co-relation queries the response was YES. [2024-11-09 07:02:43,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1734 events. 149/1734 cut-off events. For 50/54 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 10919 event pairs, 22 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 1977. Up to 170 conditions per place. [2024-11-09 07:02:43,341 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 17 selfloop transitions, 3 changer transitions 0/443 dead transitions. [2024-11-09 07:02:43,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 443 transitions, 963 flow [2024-11-09 07:02:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1448 transitions. [2024-11-09 07:02:43,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2024-11-09 07:02:43,346 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 911 flow. Second operand 3 states and 1448 transitions. [2024-11-09 07:02:43,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 443 transitions, 963 flow [2024-11-09 07:02:43,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:43,355 INFO L231 Difference]: Finished difference. Result has 437 places, 439 transitions, 926 flow [2024-11-09 07:02:43,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=437, PETRI_TRANSITIONS=439} [2024-11-09 07:02:43,358 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -35 predicate places. [2024-11-09 07:02:43,358 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 439 transitions, 926 flow [2024-11-09 07:02:43,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-09 07:02:43,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:43,360 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:43,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:02:43,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:43,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1663605080, now seen corresponding path program 1 times [2024-11-09 07:02:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197732730] [2024-11-09 07:02:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:43,644 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-09 07:02:43,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:43,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197732730] [2024-11-09 07:02:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197732730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:43,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:02:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011237918] [2024-11-09 07:02:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:43,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:02:43,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:02:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:02:44,010 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 443 out of 510 [2024-11-09 07:02:44,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 439 transitions, 926 flow. Second operand has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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-09 07:02:44,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:44,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 443 of 510 [2024-11-09 07:02:44,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:44,356 INFO L124 PetriNetUnfolderBase]: 87/1593 cut-off events. [2024-11-09 07:02:44,357 INFO L125 PetriNetUnfolderBase]: For 11/34 co-relation queries the response was YES. [2024-11-09 07:02:44,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1593 events. 87/1593 cut-off events. For 11/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7200 event pairs, 20 based on Foata normal form. 5/1495 useless extension candidates. Maximal degree in co-relation 1873. Up to 76 conditions per place. [2024-11-09 07:02:44,371 INFO L140 encePairwiseOnDemand]: 473/510 looper letters, 49 selfloop transitions, 56 changer transitions 0/496 dead transitions. [2024-11-09 07:02:44,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 496 transitions, 1258 flow [2024-11-09 07:02:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:02:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 07:02:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4536 transitions. [2024-11-09 07:02:44,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8894117647058823 [2024-11-09 07:02:44,381 INFO L175 Difference]: Start difference. First operand has 437 places, 439 transitions, 926 flow. Second operand 10 states and 4536 transitions. [2024-11-09 07:02:44,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 496 transitions, 1258 flow [2024-11-09 07:02:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 496 transitions, 1258 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:44,389 INFO L231 Difference]: Finished difference. Result has 450 places, 473 transitions, 1181 flow [2024-11-09 07:02:44,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1181, PETRI_PLACES=450, PETRI_TRANSITIONS=473} [2024-11-09 07:02:44,390 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -22 predicate places. [2024-11-09 07:02:44,390 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 473 transitions, 1181 flow [2024-11-09 07:02:44,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 448.2857142857143) internal successors, (3138), 7 states have internal predecessors, (3138), 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-09 07:02:44,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:44,393 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:44,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:02:44,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1270908050, now seen corresponding path program 1 times [2024-11-09 07:02:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327884638] [2024-11-09 07:02:44,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:44,527 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-09 07:02:44,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:44,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327884638] [2024-11-09 07:02:44,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327884638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:44,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:44,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:44,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551760368] [2024-11-09 07:02:44,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:44,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:02:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:02:44,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:02:44,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 472 out of 510 [2024-11-09 07:02:44,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 473 transitions, 1181 flow. Second operand has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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-09 07:02:44,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:44,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 472 of 510 [2024-11-09 07:02:44,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:45,045 INFO L124 PetriNetUnfolderBase]: 153/2461 cut-off events. [2024-11-09 07:02:45,046 INFO L125 PetriNetUnfolderBase]: For 78/123 co-relation queries the response was YES. [2024-11-09 07:02:45,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 2461 events. 153/2461 cut-off events. For 78/123 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14893 event pairs, 45 based on Foata normal form. 10/2294 useless extension candidates. Maximal degree in co-relation 2965. Up to 121 conditions per place. [2024-11-09 07:02:45,074 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 24 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2024-11-09 07:02:45,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 484 transitions, 1269 flow [2024-11-09 07:02:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:02:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:02:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2390 transitions. [2024-11-09 07:02:45,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2024-11-09 07:02:45,081 INFO L175 Difference]: Start difference. First operand has 450 places, 473 transitions, 1181 flow. Second operand 5 states and 2390 transitions. [2024-11-09 07:02:45,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 484 transitions, 1269 flow [2024-11-09 07:02:45,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 484 transitions, 1269 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:45,092 INFO L231 Difference]: Finished difference. Result has 456 places, 475 transitions, 1206 flow [2024-11-09 07:02:45,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1206, PETRI_PLACES=456, PETRI_TRANSITIONS=475} [2024-11-09 07:02:45,094 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -16 predicate places. [2024-11-09 07:02:45,094 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 475 transitions, 1206 flow [2024-11-09 07:02:45,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 474.0) internal successors, (2370), 5 states have internal predecessors, (2370), 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-09 07:02:45,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:45,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:45,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:02:45,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -201436069, now seen corresponding path program 1 times [2024-11-09 07:02:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:45,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46568218] [2024-11-09 07:02:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:45,867 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-09 07:02:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46568218] [2024-11-09 07:02:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46568218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:45,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900416050] [2024-11-09 07:02:45,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:45,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:45,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:46,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-09 07:02:46,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 475 transitions, 1206 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-09 07:02:46,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:46,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-09 07:02:46,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:48,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1249] L67-2-->L67-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][364], [504#(= |#race~N~0| 0), 210#L89-4true, 484#L51-3true, Black: 543#(<= ~N~0 0), 252#L67-3true, 559#true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 526#true, 347#L62true, 525#(= |#race~M~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 530#true, Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), Black: 534#true, 532#(= |#race~A~0| 0), 566#true]) [2024-11-09 07:02:48,584 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2024-11-09 07:02:48,584 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-09 07:02:48,584 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-09 07:02:48,584 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-09 07:02:48,962 INFO L124 PetriNetUnfolderBase]: 2248/13787 cut-off events. [2024-11-09 07:02:48,963 INFO L125 PetriNetUnfolderBase]: For 873/909 co-relation queries the response was YES. [2024-11-09 07:02:49,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18861 conditions, 13787 events. 2248/13787 cut-off events. For 873/909 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 151505 event pairs, 1160 based on Foata normal form. 0/12402 useless extension candidates. Maximal degree in co-relation 18809. Up to 3033 conditions per place. [2024-11-09 07:02:49,111 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 54 selfloop transitions, 38 changer transitions 0/520 dead transitions. [2024-11-09 07:02:49,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 520 transitions, 1488 flow [2024-11-09 07:02:49,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-09 07:02:49,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-09 07:02:49,117 INFO L175 Difference]: Start difference. First operand has 456 places, 475 transitions, 1206 flow. Second operand 6 states and 2767 transitions. [2024-11-09 07:02:49,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 520 transitions, 1488 flow [2024-11-09 07:02:49,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 520 transitions, 1483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:49,135 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1455 flow [2024-11-09 07:02:49,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1455, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2024-11-09 07:02:49,136 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2024-11-09 07:02:49,136 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1455 flow [2024-11-09 07:02:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-09 07:02:49,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:49,138 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:02:49,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:49,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:49,139 INFO L85 PathProgramCache]: Analyzing trace with hash -306494371, now seen corresponding path program 1 times [2024-11-09 07:02:49,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384792564] [2024-11-09 07:02:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:49,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:49,200 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-09 07:02:49,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384792564] [2024-11-09 07:02:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384792564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:49,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377582488] [2024-11-09 07:02:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:49,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:49,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:49,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:49,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 510 [2024-11-09 07:02:49,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-09 07:02:49,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:49,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 510 [2024-11-09 07:02:49,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:50,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1249] L67-2-->L67-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][358], [579#(= |#race~B~0| 0), 210#L89-4true, Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 379#L59-1true, 504#(= |#race~N~0| 0), 484#L51-3true, Black: 543#(<= ~N~0 0), 252#L67-3true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1)))), Black: 568#(= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0))]) [2024-11-09 07:02:50,572 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2024-11-09 07:02:50,572 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-09 07:02:50,572 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-09 07:02:50,572 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-09 07:02:50,899 INFO L124 PetriNetUnfolderBase]: 1600/11576 cut-off events. [2024-11-09 07:02:50,899 INFO L125 PetriNetUnfolderBase]: For 741/958 co-relation queries the response was YES. [2024-11-09 07:02:50,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16517 conditions, 11576 events. 1600/11576 cut-off events. For 741/958 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 122681 event pairs, 343 based on Foata normal form. 0/10650 useless extension candidates. Maximal degree in co-relation 16462. Up to 1365 conditions per place. [2024-11-09 07:02:51,020 INFO L140 encePairwiseOnDemand]: 504/510 looper letters, 18 selfloop transitions, 3 changer transitions 0/517 dead transitions. [2024-11-09 07:02:51,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 517 transitions, 1512 flow [2024-11-09 07:02:51,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1449 transitions. [2024-11-09 07:02:51,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470588235294117 [2024-11-09 07:02:51,024 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1455 flow. Second operand 3 states and 1449 transitions. [2024-11-09 07:02:51,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 517 transitions, 1512 flow [2024-11-09 07:02:51,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 517 transitions, 1512 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:51,043 INFO L231 Difference]: Finished difference. Result has 464 places, 512 transitions, 1470 flow [2024-11-09 07:02:51,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=464, PETRI_TRANSITIONS=512} [2024-11-09 07:02:51,044 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, -8 predicate places. [2024-11-09 07:02:51,045 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 512 transitions, 1470 flow [2024-11-09 07:02:51,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.6666666666667) internal successors, (1430), 3 states have internal predecessors, (1430), 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-09 07:02:51,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:51,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:02:51,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:51,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:51,047 INFO L85 PathProgramCache]: Analyzing trace with hash 307600196, now seen corresponding path program 1 times [2024-11-09 07:02:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:51,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342632841] [2024-11-09 07:02:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:51,541 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-09 07:02:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:51,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342632841] [2024-11-09 07:02:51,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342632841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:51,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:51,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50161622] [2024-11-09 07:02:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:51,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:52,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-09 07:02:52,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 512 transitions, 1470 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-09 07:02:52,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:52,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-09 07:02:52,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:56,712 INFO L124 PetriNetUnfolderBase]: 4627/22163 cut-off events. [2024-11-09 07:02:56,713 INFO L125 PetriNetUnfolderBase]: For 5452/8009 co-relation queries the response was YES. [2024-11-09 07:02:57,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36861 conditions, 22163 events. 4627/22163 cut-off events. For 5452/8009 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 266946 event pairs, 1255 based on Foata normal form. 57/20417 useless extension candidates. Maximal degree in co-relation 36804. Up to 5415 conditions per place. [2024-11-09 07:02:57,357 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 85 selfloop transitions, 110 changer transitions 0/629 dead transitions. [2024-11-09 07:02:57,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 629 transitions, 2432 flow [2024-11-09 07:02:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:57,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-09 07:02:57,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-09 07:02:57,364 INFO L175 Difference]: Start difference. First operand has 464 places, 512 transitions, 1470 flow. Second operand 6 states and 2767 transitions. [2024-11-09 07:02:57,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 629 transitions, 2432 flow [2024-11-09 07:02:57,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 629 transitions, 2432 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:57,399 INFO L231 Difference]: Finished difference. Result has 474 places, 621 transitions, 2528 flow [2024-11-09 07:02:57,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2528, PETRI_PLACES=474, PETRI_TRANSITIONS=621} [2024-11-09 07:02:57,400 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, 2 predicate places. [2024-11-09 07:02:57,401 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 621 transitions, 2528 flow [2024-11-09 07:02:57,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-09 07:02:57,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:57,406 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:02:57,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:02:57,406 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:02:57,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1630523393, now seen corresponding path program 1 times [2024-11-09 07:02:57,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667171968] [2024-11-09 07:02:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:57,921 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-09 07:02:57,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:57,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667171968] [2024-11-09 07:02:57,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667171968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:57,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:57,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:57,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085996670] [2024-11-09 07:02:57,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:57,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:57,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:57,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:58,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-09 07:02:58,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 621 transitions, 2528 flow. Second operand has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-09 07:02:58,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:58,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-09 07:02:58,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:03,424 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1249] L67-2-->L67-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][357], [579#(= |#race~B~0| 0), Black: 577#true, 592#true, 210#L89-4true, Black: 586#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~A~0.offset)) 0)), Black: 583#(= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0), Black: 585#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~A~0.offset)) 0)), Black: 584#(and (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~A~0.offset)) 0)), Black: 526#true, 525#(= |#race~M~0| 0), Black: 530#true, Black: 534#true, 566#true, 504#(= |#race~N~0| 0), 484#L51-3true, Black: 543#(<= ~N~0 0), 252#L67-3true, Black: 544#(and (<= ~N~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 548#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 550#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 536#(= |#race~C2~0| 0), Black: 562#(<= (+ ~M~0 1) 0), 347#L62true, Black: 563#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 538#true, 528#(= |#race~C1~0| 0), 581#true, 532#(= |#race~A~0| 0), Black: 570#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0)), Black: 569#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1)))), Black: 568#(= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0), Black: 571#(and (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~A~0.offset 1))) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~A~0.offset)) 0))]) [2024-11-09 07:03:03,425 INFO L294 olderBase$Statistics]: this new event has 349 ancestors and is cut-off event [2024-11-09 07:03:03,425 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-09 07:03:03,425 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2024-11-09 07:03:03,425 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-11-09 07:03:04,469 INFO L124 PetriNetUnfolderBase]: 6954/31115 cut-off events. [2024-11-09 07:03:04,469 INFO L125 PetriNetUnfolderBase]: For 23390/33898 co-relation queries the response was YES. [2024-11-09 07:03:04,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61286 conditions, 31115 events. 6954/31115 cut-off events. For 23390/33898 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 394027 event pairs, 1661 based on Foata normal form. 203/29017 useless extension candidates. Maximal degree in co-relation 61224. Up to 7756 conditions per place. [2024-11-09 07:03:04,870 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 187 selfloop transitions, 215 changer transitions 0/838 dead transitions. [2024-11-09 07:03:04,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 838 transitions, 5026 flow [2024-11-09 07:03:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-09 07:03:04,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-09 07:03:04,876 INFO L175 Difference]: Start difference. First operand has 474 places, 621 transitions, 2528 flow. Second operand 6 states and 2767 transitions. [2024-11-09 07:03:04,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 838 transitions, 5026 flow [2024-11-09 07:03:04,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 838 transitions, 5026 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:04,936 INFO L231 Difference]: Finished difference. Result has 484 places, 830 transitions, 5178 flow [2024-11-09 07:03:04,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=2528, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5178, PETRI_PLACES=484, PETRI_TRANSITIONS=830} [2024-11-09 07:03:04,937 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, 12 predicate places. [2024-11-09 07:03:04,938 INFO L471 AbstractCegarLoop]: Abstraction has has 484 places, 830 transitions, 5178 flow [2024-11-09 07:03:04,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.6666666666667) internal successors, (2686), 6 states have internal predecessors, (2686), 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-09 07:03:04,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:04,939 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:04,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:03:04,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:03:04,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:04,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1993451370, now seen corresponding path program 1 times [2024-11-09 07:03:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:04,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274786928] [2024-11-09 07:03:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:04,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:05,583 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-09 07:03:05,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:05,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274786928] [2024-11-09 07:03:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274786928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:05,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:05,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:05,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861200447] [2024-11-09 07:03:05,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:05,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:05,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:06,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 446 out of 510 [2024-11-09 07:03:06,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 830 transitions, 5178 flow. Second operand has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-09 07:03:06,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:06,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 446 of 510 [2024-11-09 07:03:06,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:14,244 INFO L124 PetriNetUnfolderBase]: 10076/38698 cut-off events. [2024-11-09 07:03:14,245 INFO L125 PetriNetUnfolderBase]: For 70199/78935 co-relation queries the response was YES. [2024-11-09 07:03:14,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93348 conditions, 38698 events. 10076/38698 cut-off events. For 70199/78935 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 496714 event pairs, 1689 based on Foata normal form. 670/36723 useless extension candidates. Maximal degree in co-relation 93281. Up to 11029 conditions per place. [2024-11-09 07:03:14,690 INFO L140 encePairwiseOnDemand]: 495/510 looper letters, 382 selfloop transitions, 495 changer transitions 0/1319 dead transitions. [2024-11-09 07:03:14,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1319 transitions, 12054 flow [2024-11-09 07:03:14,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2767 transitions. [2024-11-09 07:03:14,696 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9042483660130719 [2024-11-09 07:03:14,696 INFO L175 Difference]: Start difference. First operand has 484 places, 830 transitions, 5178 flow. Second operand 6 states and 2767 transitions. [2024-11-09 07:03:14,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1319 transitions, 12054 flow [2024-11-09 07:03:14,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1319 transitions, 12054 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:14,840 INFO L231 Difference]: Finished difference. Result has 494 places, 1311 transitions, 12524 flow [2024-11-09 07:03:14,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=510, PETRI_DIFFERENCE_MINUEND_FLOW=5178, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=830, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=12524, PETRI_PLACES=494, PETRI_TRANSITIONS=1311} [2024-11-09 07:03:14,841 INFO L277 CegarLoopForPetriNet]: 472 programPoint places, 22 predicate places. [2024-11-09 07:03:14,842 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 1311 transitions, 12524 flow [2024-11-09 07:03:14,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.8333333333333) internal successors, (2687), 6 states have internal predecessors, (2687), 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-09 07:03:14,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:14,843 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 07:03:14,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:03:14,843 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 65 more)] === [2024-11-09 07:03:14,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1793621469, now seen corresponding path program 1 times [2024-11-09 07:03:14,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:14,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381228990] [2024-11-09 07:03:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:15,472 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-09 07:03:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381228990] [2024-11-09 07:03:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381228990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044947719] [2024-11-09 07:03:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:15,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:15,879 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 510 [2024-11-09 07:03:15,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1311 transitions, 12524 flow. Second operand has 6 states, 6 states have (on average 419.1666666666667) internal successors, (2515), 6 states have internal predecessors, (2515), 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-09 07:03:15,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:15,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 510 [2024-11-09 07:03:15,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand