./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.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 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:56:22,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:56:22,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:56:22,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:56:22,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:56:23,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:56:23,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:56:23,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:56:23,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:56:23,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:56:23,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:56:23,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:56:23,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:56:23,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:56:23,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:56:23,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:56:23,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:56:23,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:56:23,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:56:23,037 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:56:23,037 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:56:23,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:56:23,041 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:56:23,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:56:23,041 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:56:23,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:56:23,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:56:23,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:56:23,042 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:56:23,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:56:23,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:56:23,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:23,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:56:23,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:56:23,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:56:23,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:56:23,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:56:23,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:56:23,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:56:23,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:56:23,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:56:23,047 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2024-11-19 05:56:23,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:56:23,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:56:23,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:56:23,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:56:23,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:56:23,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2024-11-19 05:56:24,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:56:24,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:56:24,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2024-11-19 05:56:24,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6221868dc/cd3b4e492fcb49cbb6053e8223b184ab/FLAG207cdffa8 [2024-11-19 05:56:24,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6221868dc/cd3b4e492fcb49cbb6053e8223b184ab [2024-11-19 05:56:25,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:56:25,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:56:25,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:25,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:56:25,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:56:25,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:24" (1/1) ... [2024-11-19 05:56:25,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57627f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25, skipping insertion in model container [2024-11-19 05:56:25,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:24" (1/1) ... [2024-11-19 05:56:25,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:56:25,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:25,310 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:56:25,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:25,364 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:56:25,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25 WrapperNode [2024-11-19 05:56:25,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:25,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:25,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:56:25,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:56:25,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,458 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 484 [2024-11-19 05:56:25,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:25,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:56:25,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:56:25,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:56:25,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,477 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,506 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:56:25,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:56:25,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:56:25,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:56:25,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (1/1) ... [2024-11-19 05:56:25,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:25,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:25,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:56:25,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:56:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:56:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:56:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:56:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:56:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:56:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:56:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:56:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:56:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:56:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:56:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:56:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:56:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:56:25,627 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:56:25,777 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:56:25,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:56:26,657 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:56:26,658 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:56:26,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:56:26,701 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:56:26,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:26 BoogieIcfgContainer [2024-11-19 05:56:26,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:56:26,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:56:26,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:56:26,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:56:26,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:56:24" (1/3) ... [2024-11-19 05:56:26,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1550f9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:26, skipping insertion in model container [2024-11-19 05:56:26,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:25" (2/3) ... [2024-11-19 05:56:26,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1550f9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:26, skipping insertion in model container [2024-11-19 05:56:26,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:26" (3/3) ... [2024-11-19 05:56:26,713 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2024-11-19 05:56:26,730 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:56:26,731 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2024-11-19 05:56:26,731 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:56:26,918 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:56:26,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 599 places, 622 transitions, 1265 flow [2024-11-19 05:56:27,292 INFO L124 PetriNetUnfolderBase]: 33/619 cut-off events. [2024-11-19 05:56:27,292 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:27,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 619 events. 33/619 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1465 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 467. Up to 3 conditions per place. [2024-11-19 05:56:27,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 599 places, 622 transitions, 1265 flow [2024-11-19 05:56:27,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 598 transitions, 1214 flow [2024-11-19 05:56:27,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:56:27,352 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;@38f8703e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:56:27,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2024-11-19 05:56:27,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:56:27,358 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:56:27,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:56:27,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:27,359 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] [2024-11-19 05:56:27,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash 832723251, now seen corresponding path program 1 times [2024-11-19 05:56:27,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:27,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939300256] [2024-11-19 05:56:27,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:27,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939300256] [2024-11-19 05:56:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939300256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:27,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:27,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995929994] [2024-11-19 05:56:27,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:27,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:27,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:27,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:27,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-11-19 05:56:27,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 598 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:27,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:27,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-11-19 05:56:27,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:27,930 INFO L124 PetriNetUnfolderBase]: 37/1035 cut-off events. [2024-11-19 05:56:27,931 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-19 05:56:27,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 1035 events. 37/1035 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4609 event pairs, 12 based on Foata normal form. 34/910 useless extension candidates. Maximal degree in co-relation 832. Up to 39 conditions per place. [2024-11-19 05:56:27,964 INFO L140 encePairwiseOnDemand]: 601/622 looper letters, 14 selfloop transitions, 2 changer transitions 6/579 dead transitions. [2024-11-19 05:56:27,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 579 transitions, 1208 flow [2024-11-19 05:56:27,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1787 transitions. [2024-11-19 05:56:27,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9576634512325831 [2024-11-19 05:56:27,991 INFO L175 Difference]: Start difference. First operand has 577 places, 598 transitions, 1214 flow. Second operand 3 states and 1787 transitions. [2024-11-19 05:56:27,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 579 transitions, 1208 flow [2024-11-19 05:56:28,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:28,016 INFO L231 Difference]: Finished difference. Result has 572 places, 573 transitions, 1156 flow [2024-11-19 05:56:28,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=572, PETRI_TRANSITIONS=573} [2024-11-19 05:56:28,026 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2024-11-19 05:56:28,027 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 573 transitions, 1156 flow [2024-11-19 05:56:28,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:28,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:28,029 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:28,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:56:28,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:28,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:28,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2142416312, now seen corresponding path program 1 times [2024-11-19 05:56:28,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:28,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126162291] [2024-11-19 05:56:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:28,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:28,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126162291] [2024-11-19 05:56:28,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126162291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:28,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:28,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:28,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255797279] [2024-11-19 05:56:28,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:28,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:28,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:28,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:28,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-11-19 05:56:28,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:28,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:28,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-11-19 05:56:28,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:28,625 INFO L124 PetriNetUnfolderBase]: 57/1460 cut-off events. [2024-11-19 05:56:28,625 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:56:28,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1530 conditions, 1460 events. 57/1460 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8136 event pairs, 20 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1496. Up to 51 conditions per place. [2024-11-19 05:56:28,667 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-11-19 05:56:28,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 572 transitions, 1186 flow [2024-11-19 05:56:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2024-11-19 05:56:28,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480171489817792 [2024-11-19 05:56:28,672 INFO L175 Difference]: Start difference. First operand has 572 places, 573 transitions, 1156 flow. Second operand 3 states and 1769 transitions. [2024-11-19 05:56:28,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 572 transitions, 1186 flow [2024-11-19 05:56:28,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:28,682 INFO L231 Difference]: Finished difference. Result has 565 places, 572 transitions, 1154 flow [2024-11-19 05:56:28,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=565, PETRI_TRANSITIONS=572} [2024-11-19 05:56:28,684 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -12 predicate places. [2024-11-19 05:56:28,685 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 572 transitions, 1154 flow [2024-11-19 05:56:28,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:28,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:28,687 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] [2024-11-19 05:56:28,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:56:28,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:28,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:28,688 INFO L85 PathProgramCache]: Analyzing trace with hash 963352904, now seen corresponding path program 1 times [2024-11-19 05:56:28,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:28,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998273538] [2024-11-19 05:56:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:28,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998273538] [2024-11-19 05:56:28,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998273538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:28,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:28,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331527383] [2024-11-19 05:56:28,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:28,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:28,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:28,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:28,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 584 out of 622 [2024-11-19 05:56:28,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:28,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:28,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 584 of 622 [2024-11-19 05:56:28,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:29,126 INFO L124 PetriNetUnfolderBase]: 57/1447 cut-off events. [2024-11-19 05:56:29,127 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2024-11-19 05:56:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1447 events. 57/1447 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7709 event pairs, 20 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 1467. Up to 51 conditions per place. [2024-11-19 05:56:29,166 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 14 selfloop transitions, 2 changer transitions 0/571 dead transitions. [2024-11-19 05:56:29,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 571 transitions, 1184 flow [2024-11-19 05:56:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2024-11-19 05:56:29,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9480171489817792 [2024-11-19 05:56:29,170 INFO L175 Difference]: Start difference. First operand has 565 places, 572 transitions, 1154 flow. Second operand 3 states and 1769 transitions. [2024-11-19 05:56:29,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 571 transitions, 1184 flow [2024-11-19 05:56:29,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 571 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:29,180 INFO L231 Difference]: Finished difference. Result has 564 places, 571 transitions, 1152 flow [2024-11-19 05:56:29,181 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1152, PETRI_PLACES=564, PETRI_TRANSITIONS=571} [2024-11-19 05:56:29,182 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -13 predicate places. [2024-11-19 05:56:29,182 INFO L471 AbstractCegarLoop]: Abstraction has has 564 places, 571 transitions, 1152 flow [2024-11-19 05:56:29,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:29,184 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] [2024-11-19 05:56:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:56:29,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash -29914970, now seen corresponding path program 1 times [2024-11-19 05:56:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043032870] [2024-11-19 05:56:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:29,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043032870] [2024-11-19 05:56:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043032870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:29,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227311395] [2024-11-19 05:56:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:29,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:29,276 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-11-19 05:56:29,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 571 transitions, 1152 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:29,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-11-19 05:56:29,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:29,663 INFO L124 PetriNetUnfolderBase]: 69/1462 cut-off events. [2024-11-19 05:56:29,663 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-19 05:56:29,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1462 events. 69/1462 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 8299 event pairs, 32 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1509. Up to 80 conditions per place. [2024-11-19 05:56:29,690 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/566 dead transitions. [2024-11-19 05:56:29,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 566 transitions, 1176 flow [2024-11-19 05:56:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-11-19 05:56:29,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-11-19 05:56:29,694 INFO L175 Difference]: Start difference. First operand has 564 places, 571 transitions, 1152 flow. Second operand 3 states and 1762 transitions. [2024-11-19 05:56:29,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 566 transitions, 1176 flow [2024-11-19 05:56:29,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 566 transitions, 1172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:29,704 INFO L231 Difference]: Finished difference. Result has 559 places, 566 transitions, 1140 flow [2024-11-19 05:56:29,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=559, PETRI_TRANSITIONS=566} [2024-11-19 05:56:29,707 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -18 predicate places. [2024-11-19 05:56:29,708 INFO L471 AbstractCegarLoop]: Abstraction has has 559 places, 566 transitions, 1140 flow [2024-11-19 05:56:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:29,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:29,710 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] [2024-11-19 05:56:29,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:56:29,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:29,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash -48097060, now seen corresponding path program 1 times [2024-11-19 05:56:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:29,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293521147] [2024-11-19 05:56:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293521147] [2024-11-19 05:56:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293521147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075719857] [2024-11-19 05:56:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:30,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 506 out of 622 [2024-11-19 05:56:30,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 566 transitions, 1140 flow. Second operand has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:30,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:30,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 506 of 622 [2024-11-19 05:56:30,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:40,108 INFO L124 PetriNetUnfolderBase]: 12108/56067 cut-off events. [2024-11-19 05:56:40,108 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-19 05:56:40,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73548 conditions, 56067 events. 12108/56067 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 783483 event pairs, 10080 based on Foata normal form. 0/48897 useless extension candidates. Maximal degree in co-relation 73499. Up to 17156 conditions per place. [2024-11-19 05:56:40,654 INFO L140 encePairwiseOnDemand]: 604/622 looper letters, 78 selfloop transitions, 15 changer transitions 0/563 dead transitions. [2024-11-19 05:56:40,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 563 transitions, 1320 flow [2024-11-19 05:56:40,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3132 transitions. [2024-11-19 05:56:40,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8392282958199357 [2024-11-19 05:56:40,661 INFO L175 Difference]: Start difference. First operand has 559 places, 566 transitions, 1140 flow. Second operand 6 states and 3132 transitions. [2024-11-19 05:56:40,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 563 transitions, 1320 flow [2024-11-19 05:56:40,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 563 transitions, 1319 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:40,674 INFO L231 Difference]: Finished difference. Result has 560 places, 563 transitions, 1163 flow [2024-11-19 05:56:40,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=560, PETRI_TRANSITIONS=563} [2024-11-19 05:56:40,678 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -17 predicate places. [2024-11-19 05:56:40,678 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 563 transitions, 1163 flow [2024-11-19 05:56:40,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 507.5) internal successors, (3045), 6 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:40,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:40,681 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] [2024-11-19 05:56:40,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:56:40,682 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:40,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:40,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1074588689, now seen corresponding path program 1 times [2024-11-19 05:56:40,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48644656] [2024-11-19 05:56:40,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:40,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48644656] [2024-11-19 05:56:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48644656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:40,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681524176] [2024-11-19 05:56:40,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:40,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:40,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:40,788 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-11-19 05:56:40,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 563 transitions, 1163 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:40,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:40,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-11-19 05:56:40,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:41,113 INFO L124 PetriNetUnfolderBase]: 37/1040 cut-off events. [2024-11-19 05:56:41,114 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:56:41,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1040 events. 37/1040 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4525 event pairs, 12 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1057. Up to 38 conditions per place. [2024-11-19 05:56:41,137 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2024-11-19 05:56:41,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 562 transitions, 1191 flow [2024-11-19 05:56:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-11-19 05:56:41,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-11-19 05:56:41,142 INFO L175 Difference]: Start difference. First operand has 560 places, 563 transitions, 1163 flow. Second operand 3 states and 1771 transitions. [2024-11-19 05:56:41,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 562 transitions, 1191 flow [2024-11-19 05:56:41,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 562 transitions, 1161 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:41,152 INFO L231 Difference]: Finished difference. Result has 556 places, 562 transitions, 1135 flow [2024-11-19 05:56:41,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=556, PETRI_TRANSITIONS=562} [2024-11-19 05:56:41,154 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -21 predicate places. [2024-11-19 05:56:41,154 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 562 transitions, 1135 flow [2024-11-19 05:56:41,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:41,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:41,156 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] [2024-11-19 05:56:41,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:56:41,156 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:41,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:41,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1452556130, now seen corresponding path program 1 times [2024-11-19 05:56:41,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:41,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547269984] [2024-11-19 05:56:41,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:41,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:41,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547269984] [2024-11-19 05:56:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547269984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:41,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171463261] [2024-11-19 05:56:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:41,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:41,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:41,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:41,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:41,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-11-19 05:56:41,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 562 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:41,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:41,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-11-19 05:56:41,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:41,722 INFO L124 PetriNetUnfolderBase]: 137/2474 cut-off events. [2024-11-19 05:56:41,723 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-19 05:56:41,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2653 conditions, 2474 events. 137/2474 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18314 event pairs, 64 based on Foata normal form. 0/2120 useless extension candidates. Maximal degree in co-relation 2603. Up to 141 conditions per place. [2024-11-19 05:56:41,791 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2024-11-19 05:56:41,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 557 transitions, 1159 flow [2024-11-19 05:56:41,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-11-19 05:56:41,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-11-19 05:56:41,795 INFO L175 Difference]: Start difference. First operand has 556 places, 562 transitions, 1135 flow. Second operand 3 states and 1762 transitions. [2024-11-19 05:56:41,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 557 transitions, 1159 flow [2024-11-19 05:56:41,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 557 transitions, 1155 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:41,805 INFO L231 Difference]: Finished difference. Result has 551 places, 557 transitions, 1123 flow [2024-11-19 05:56:41,806 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=551, PETRI_TRANSITIONS=557} [2024-11-19 05:56:41,807 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2024-11-19 05:56:41,807 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 557 transitions, 1123 flow [2024-11-19 05:56:41,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:41,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:41,809 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] [2024-11-19 05:56:41,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:56:41,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:41,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1158170288, now seen corresponding path program 1 times [2024-11-19 05:56:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:41,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438496201] [2024-11-19 05:56:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:41,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438496201] [2024-11-19 05:56:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438496201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:41,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:41,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132237782] [2024-11-19 05:56:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:41,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:41,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:41,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:41,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-11-19 05:56:41,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 557 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:41,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:41,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-11-19 05:56:41,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:42,249 INFO L124 PetriNetUnfolderBase]: 63/1714 cut-off events. [2024-11-19 05:56:42,250 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-19 05:56:42,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 1714 events. 63/1714 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9432 event pairs, 20 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1733. Up to 50 conditions per place. [2024-11-19 05:56:42,284 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/556 dead transitions. [2024-11-19 05:56:42,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 556 transitions, 1151 flow [2024-11-19 05:56:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-11-19 05:56:42,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-11-19 05:56:42,289 INFO L175 Difference]: Start difference. First operand has 551 places, 557 transitions, 1123 flow. Second operand 3 states and 1771 transitions. [2024-11-19 05:56:42,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 556 transitions, 1151 flow [2024-11-19 05:56:42,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 556 transitions, 1150 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:42,299 INFO L231 Difference]: Finished difference. Result has 551 places, 556 transitions, 1124 flow [2024-11-19 05:56:42,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=551, PETRI_TRANSITIONS=556} [2024-11-19 05:56:42,302 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -26 predicate places. [2024-11-19 05:56:42,302 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 556 transitions, 1124 flow [2024-11-19 05:56:42,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:42,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:42,303 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] [2024-11-19 05:56:42,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:56:42,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:42,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:42,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1654529695, now seen corresponding path program 1 times [2024-11-19 05:56:42,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:42,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626809384] [2024-11-19 05:56:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:42,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:42,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626809384] [2024-11-19 05:56:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626809384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:42,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:42,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:42,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978968208] [2024-11-19 05:56:42,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:42,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:42,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:42,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:42,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:42,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 622 [2024-11-19 05:56:42,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 556 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:42,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:42,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 622 [2024-11-19 05:56:42,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:42,845 INFO L124 PetriNetUnfolderBase]: 137/2434 cut-off events. [2024-11-19 05:56:42,846 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2024-11-19 05:56:42,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 2434 events. 137/2434 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17650 event pairs, 64 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 2540. Up to 141 conditions per place. [2024-11-19 05:56:42,893 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 16 selfloop transitions, 1 changer transitions 0/551 dead transitions. [2024-11-19 05:56:42,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 551 transitions, 1148 flow [2024-11-19 05:56:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1762 transitions. [2024-11-19 05:56:42,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442658092175777 [2024-11-19 05:56:42,898 INFO L175 Difference]: Start difference. First operand has 551 places, 556 transitions, 1124 flow. Second operand 3 states and 1762 transitions. [2024-11-19 05:56:42,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 551 transitions, 1148 flow [2024-11-19 05:56:42,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 551 transitions, 1144 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:42,909 INFO L231 Difference]: Finished difference. Result has 546 places, 551 transitions, 1112 flow [2024-11-19 05:56:42,910 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1112, PETRI_PLACES=546, PETRI_TRANSITIONS=551} [2024-11-19 05:56:42,911 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-19 05:56:42,911 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 551 transitions, 1112 flow [2024-11-19 05:56:42,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 581.0) internal successors, (1743), 3 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:42,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:42,913 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] [2024-11-19 05:56:42,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:56:42,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:42,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1674852287, now seen corresponding path program 1 times [2024-11-19 05:56:42,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:42,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559273097] [2024-11-19 05:56:42,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:42,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559273097] [2024-11-19 05:56:43,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559273097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122372827] [2024-11-19 05:56:43,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 585 out of 622 [2024-11-19 05:56:43,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 551 transitions, 1112 flow. Second operand has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 585 of 622 [2024-11-19 05:56:43,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,217 INFO L124 PetriNetUnfolderBase]: 39/802 cut-off events. [2024-11-19 05:56:43,217 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-19 05:56:43,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 802 events. 39/802 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2949 event pairs, 20 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 814. Up to 50 conditions per place. [2024-11-19 05:56:43,235 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 13 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-19 05:56:43,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1140 flow [2024-11-19 05:56:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1771 transitions. [2024-11-19 05:56:43,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9490889603429796 [2024-11-19 05:56:43,241 INFO L175 Difference]: Start difference. First operand has 546 places, 551 transitions, 1112 flow. Second operand 3 states and 1771 transitions. [2024-11-19 05:56:43,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1140 flow [2024-11-19 05:56:43,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:43,251 INFO L231 Difference]: Finished difference. Result has 546 places, 550 transitions, 1113 flow [2024-11-19 05:56:43,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1109, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=546, PETRI_TRANSITIONS=550} [2024-11-19 05:56:43,253 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-19 05:56:43,253 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 550 transitions, 1113 flow [2024-11-19 05:56:43,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 586.3333333333334) internal successors, (1759), 3 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,255 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:43,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:56:43,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:43,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,258 INFO L85 PathProgramCache]: Analyzing trace with hash 721720402, now seen corresponding path program 1 times [2024-11-19 05:56:43,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148978857] [2024-11-19 05:56:43,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148978857] [2024-11-19 05:56:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148978857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277989883] [2024-11-19 05:56:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-19 05:56:43,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 550 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-19 05:56:43,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,544 INFO L124 PetriNetUnfolderBase]: 35/982 cut-off events. [2024-11-19 05:56:43,544 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:56:43,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 982 events. 35/982 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4310 event pairs, 6 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 986. Up to 23 conditions per place. [2024-11-19 05:56:43,560 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-11-19 05:56:43,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 551 transitions, 1145 flow [2024-11-19 05:56:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-19 05:56:43,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-19 05:56:43,565 INFO L175 Difference]: Start difference. First operand has 546 places, 550 transitions, 1113 flow. Second operand 3 states and 1782 transitions. [2024-11-19 05:56:43,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 551 transitions, 1145 flow [2024-11-19 05:56:43,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:43,576 INFO L231 Difference]: Finished difference. Result has 545 places, 549 transitions, 1111 flow [2024-11-19 05:56:43,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1111, PETRI_PLACES=545, PETRI_TRANSITIONS=549} [2024-11-19 05:56:43,578 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2024-11-19 05:56:43,578 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 549 transitions, 1111 flow [2024-11-19 05:56:43,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,580 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] [2024-11-19 05:56:43,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:56:43,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:43,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash 199116120, now seen corresponding path program 1 times [2024-11-19 05:56:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729201593] [2024-11-19 05:56:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56: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-19 05:56:43,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729201593] [2024-11-19 05:56:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729201593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996049234] [2024-11-19 05:56:43,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,664 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-19 05:56:43,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 549 transitions, 1111 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-19 05:56:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,862 INFO L124 PetriNetUnfolderBase]: 32/868 cut-off events. [2024-11-19 05:56:43,862 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-19 05:56:43,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 868 events. 32/868 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3353 event pairs, 6 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 867. Up to 23 conditions per place. [2024-11-19 05:56:43,884 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-19 05:56:43,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 550 transitions, 1143 flow [2024-11-19 05:56:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-19 05:56:43,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-19 05:56:43,889 INFO L175 Difference]: Start difference. First operand has 545 places, 549 transitions, 1111 flow. Second operand 3 states and 1782 transitions. [2024-11-19 05:56:43,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 550 transitions, 1143 flow [2024-11-19 05:56:43,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 550 transitions, 1139 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:43,901 INFO L231 Difference]: Finished difference. Result has 544 places, 548 transitions, 1109 flow [2024-11-19 05:56:43,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1109, PETRI_PLACES=544, PETRI_TRANSITIONS=548} [2024-11-19 05:56:43,903 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-19 05:56:43,903 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 548 transitions, 1109 flow [2024-11-19 05:56:43,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,905 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] [2024-11-19 05:56:43,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:56:43,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash -935044885, now seen corresponding path program 1 times [2024-11-19 05:56:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058797757] [2024-11-19 05:56:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058797757] [2024-11-19 05:56:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058797757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113648684] [2024-11-19 05:56:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-11-19 05:56:43,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 548 transitions, 1109 flow. Second operand has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-11-19 05:56:43,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:44,211 INFO L124 PetriNetUnfolderBase]: 41/983 cut-off events. [2024-11-19 05:56:44,212 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-11-19 05:56:44,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 983 events. 41/983 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4257 event pairs, 12 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 1014. Up to 39 conditions per place. [2024-11-19 05:56:44,232 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2024-11-19 05:56:44,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 551 transitions, 1151 flow [2024-11-19 05:56:44,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-19 05:56:44,238 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-19 05:56:44,238 INFO L175 Difference]: Start difference. First operand has 544 places, 548 transitions, 1109 flow. Second operand 3 states and 1782 transitions. [2024-11-19 05:56:44,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 551 transitions, 1151 flow [2024-11-19 05:56:44,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1147 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:44,252 INFO L231 Difference]: Finished difference. Result has 546 places, 549 transitions, 1123 flow [2024-11-19 05:56:44,253 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=546, PETRI_TRANSITIONS=549} [2024-11-19 05:56:44,254 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-19 05:56:44,254 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 549 transitions, 1123 flow [2024-11-19 05:56:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.6666666666666) internal successors, (1769), 3 states have internal predecessors, (1769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:44,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:44,256 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] [2024-11-19 05:56:44,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:56:44,257 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:44,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:44,257 INFO L85 PathProgramCache]: Analyzing trace with hash 671881940, now seen corresponding path program 1 times [2024-11-19 05:56:44,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:44,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719776912] [2024-11-19 05:56:44,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:44,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:44,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719776912] [2024-11-19 05:56:44,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719776912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273152476] [2024-11-19 05:56:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:44,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:44,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:44,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:44,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:44,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-19 05:56:44,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 549 transitions, 1123 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:44,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:44,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-19 05:56:44,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:44,503 INFO L124 PetriNetUnfolderBase]: 29/758 cut-off events. [2024-11-19 05:56:44,503 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2024-11-19 05:56:44,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 758 events. 29/758 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2547 event pairs, 6 based on Foata normal form. 0/684 useless extension candidates. Maximal degree in co-relation 758. Up to 23 conditions per place. [2024-11-19 05:56:44,518 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 12 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-19 05:56:44,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 550 transitions, 1155 flow [2024-11-19 05:56:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-19 05:56:44,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-19 05:56:44,524 INFO L175 Difference]: Start difference. First operand has 546 places, 549 transitions, 1123 flow. Second operand 3 states and 1782 transitions. [2024-11-19 05:56:44,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 550 transitions, 1155 flow [2024-11-19 05:56:44,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 550 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:44,534 INFO L231 Difference]: Finished difference. Result has 545 places, 548 transitions, 1119 flow [2024-11-19 05:56:44,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=545, PETRI_TRANSITIONS=548} [2024-11-19 05:56:44,536 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -32 predicate places. [2024-11-19 05:56:44,536 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 548 transitions, 1119 flow [2024-11-19 05:56:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:44,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:44,538 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] [2024-11-19 05:56:44,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:56:44,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:44,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1955873248, now seen corresponding path program 1 times [2024-11-19 05:56:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:44,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743275224] [2024-11-19 05:56:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:44,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:44,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743275224] [2024-11-19 05:56:44,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743275224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:44,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:44,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:44,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880676793] [2024-11-19 05:56:44,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:44,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:44,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:44,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-11-19 05:56:44,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 548 transitions, 1119 flow. Second operand has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:44,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:44,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-11-19 05:56:44,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:45,024 INFO L124 PetriNetUnfolderBase]: 86/1557 cut-off events. [2024-11-19 05:56:45,024 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-11-19 05:56:45,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 1557 events. 86/1557 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9007 event pairs, 12 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 1658. Up to 99 conditions per place. [2024-11-19 05:56:45,064 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 20 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-11-19 05:56:45,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 551 transitions, 1174 flow [2024-11-19 05:56:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:45,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2024-11-19 05:56:45,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9512325830653805 [2024-11-19 05:56:45,069 INFO L175 Difference]: Start difference. First operand has 545 places, 548 transitions, 1119 flow. Second operand 3 states and 1775 transitions. [2024-11-19 05:56:45,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 551 transitions, 1174 flow [2024-11-19 05:56:45,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 551 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:45,080 INFO L231 Difference]: Finished difference. Result has 542 places, 546 transitions, 1121 flow [2024-11-19 05:56:45,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=542, PETRI_TRANSITIONS=546} [2024-11-19 05:56:45,082 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -35 predicate places. [2024-11-19 05:56:45,082 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 546 transitions, 1121 flow [2024-11-19 05:56:45,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.3333333333334) internal successors, (1753), 3 states have internal predecessors, (1753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:45,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:45,084 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] [2024-11-19 05:56:45,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:56:45,084 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:45,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash 529790360, now seen corresponding path program 1 times [2024-11-19 05:56:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:45,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360504983] [2024-11-19 05:56:45,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:45,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360504983] [2024-11-19 05:56:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360504983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:45,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:45,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:45,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754287777] [2024-11-19 05:56:45,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:45,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:45,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:45,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-11-19 05:56:45,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 546 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:45,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:45,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-11-19 05:56:45,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:45,517 INFO L124 PetriNetUnfolderBase]: 65/1229 cut-off events. [2024-11-19 05:56:45,518 INFO L125 PetriNetUnfolderBase]: For 22/85 co-relation queries the response was YES. [2024-11-19 05:56:45,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1229 events. 65/1229 cut-off events. For 22/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6338 event pairs, 18 based on Foata normal form. 2/1092 useless extension candidates. Maximal degree in co-relation 1298. Up to 57 conditions per place. [2024-11-19 05:56:45,553 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/549 dead transitions. [2024-11-19 05:56:45,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 549 transitions, 1163 flow [2024-11-19 05:56:45,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-19 05:56:45,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-19 05:56:45,559 INFO L175 Difference]: Start difference. First operand has 542 places, 546 transitions, 1121 flow. Second operand 3 states and 1782 transitions. [2024-11-19 05:56:45,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 549 transitions, 1163 flow [2024-11-19 05:56:45,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 549 transitions, 1163 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:45,570 INFO L231 Difference]: Finished difference. Result has 546 places, 547 transitions, 1139 flow [2024-11-19 05:56:45,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=546, PETRI_TRANSITIONS=547} [2024-11-19 05:56:45,572 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -31 predicate places. [2024-11-19 05:56:45,573 INFO L471 AbstractCegarLoop]: Abstraction has has 546 places, 547 transitions, 1139 flow [2024-11-19 05:56:45,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.0) internal successors, (1770), 3 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:45,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:45,575 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:45,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:56:45,575 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:45,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:45,576 INFO L85 PathProgramCache]: Analyzing trace with hash -299923418, now seen corresponding path program 1 times [2024-11-19 05:56:45,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:45,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453482487] [2024-11-19 05:56:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:45,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:45,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453482487] [2024-11-19 05:56:45,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453482487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:45,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662035430] [2024-11-19 05:56:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:45,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:45,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:45,667 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-11-19 05:56:45,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 547 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:45,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:45,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-11-19 05:56:45,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:46,388 INFO L124 PetriNetUnfolderBase]: 157/2691 cut-off events. [2024-11-19 05:56:46,388 INFO L125 PetriNetUnfolderBase]: For 27/41 co-relation queries the response was YES. [2024-11-19 05:56:46,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3027 conditions, 2691 events. 157/2691 cut-off events. For 27/41 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 19534 event pairs, 31 based on Foata normal form. 1/2408 useless extension candidates. Maximal degree in co-relation 2975. Up to 161 conditions per place. [2024-11-19 05:56:46,459 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 20 selfloop transitions, 2 changer transitions 0/550 dead transitions. [2024-11-19 05:56:46,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 550 transitions, 1194 flow [2024-11-19 05:56:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1775 transitions. [2024-11-19 05:56:46,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9512325830653805 [2024-11-19 05:56:46,465 INFO L175 Difference]: Start difference. First operand has 546 places, 547 transitions, 1139 flow. Second operand 3 states and 1775 transitions. [2024-11-19 05:56:46,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 550 transitions, 1194 flow [2024-11-19 05:56:46,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 550 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:46,476 INFO L231 Difference]: Finished difference. Result has 543 places, 545 transitions, 1139 flow [2024-11-19 05:56:46,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=543, PETRI_TRANSITIONS=545} [2024-11-19 05:56:46,477 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -34 predicate places. [2024-11-19 05:56:46,477 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 545 transitions, 1139 flow [2024-11-19 05:56:46,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:46,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:46,479 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:46,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:56:46,479 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:46,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1776415780, now seen corresponding path program 1 times [2024-11-19 05:56:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:46,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693536424] [2024-11-19 05:56:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:46,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693536424] [2024-11-19 05:56:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693536424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:46,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013622541] [2024-11-19 05:56:46,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:46,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:46,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:47,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-19 05:56:47,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 545 transitions, 1139 flow. Second operand has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:47,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:47,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-19 05:56:47,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:47,846 INFO L124 PetriNetUnfolderBase]: 124/1863 cut-off events. [2024-11-19 05:56:47,846 INFO L125 PetriNetUnfolderBase]: For 10/60 co-relation queries the response was YES. [2024-11-19 05:56:47,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1863 events. 124/1863 cut-off events. For 10/60 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 11049 event pairs, 35 based on Foata normal form. 9/1720 useless extension candidates. Maximal degree in co-relation 2268. Up to 146 conditions per place. [2024-11-19 05:56:47,879 INFO L140 encePairwiseOnDemand]: 606/622 looper letters, 68 selfloop transitions, 18 changer transitions 0/585 dead transitions. [2024-11-19 05:56:47,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 585 transitions, 1409 flow [2024-11-19 05:56:47,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:56:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:56:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6771 transitions. [2024-11-19 05:56:47,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071543408360129 [2024-11-19 05:56:47,895 INFO L175 Difference]: Start difference. First operand has 543 places, 545 transitions, 1139 flow. Second operand 12 states and 6771 transitions. [2024-11-19 05:56:47,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 585 transitions, 1409 flow [2024-11-19 05:56:47,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 585 transitions, 1409 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:47,907 INFO L231 Difference]: Finished difference. Result has 560 places, 554 transitions, 1232 flow [2024-11-19 05:56:47,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1232, PETRI_PLACES=560, PETRI_TRANSITIONS=554} [2024-11-19 05:56:47,908 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -17 predicate places. [2024-11-19 05:56:47,908 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 554 transitions, 1232 flow [2024-11-19 05:56:47,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.125) internal successors, (4489), 8 states have internal predecessors, (4489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:47,910 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:47,911 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] [2024-11-19 05:56:47,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:56:47,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:47,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2061709046, now seen corresponding path program 1 times [2024-11-19 05:56:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558671614] [2024-11-19 05:56:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:48,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:48,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558671614] [2024-11-19 05:56:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558671614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:48,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965919766] [2024-11-19 05:56:48,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:48,762 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-19 05:56:48,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 554 transitions, 1232 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:48,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:48,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-19 05:56:48,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:49,687 INFO L124 PetriNetUnfolderBase]: 276/3727 cut-off events. [2024-11-19 05:56:49,687 INFO L125 PetriNetUnfolderBase]: For 164/284 co-relation queries the response was YES. [2024-11-19 05:56:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4630 conditions, 3727 events. 276/3727 cut-off events. For 164/284 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 31374 event pairs, 98 based on Foata normal form. 8/3375 useless extension candidates. Maximal degree in co-relation 4566. Up to 314 conditions per place. [2024-11-19 05:56:49,757 INFO L140 encePairwiseOnDemand]: 608/622 looper letters, 65 selfloop transitions, 15 changer transitions 0/583 dead transitions. [2024-11-19 05:56:49,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 583 transitions, 1466 flow [2024-11-19 05:56:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6202 transitions. [2024-11-19 05:56:49,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9064600993861444 [2024-11-19 05:56:49,772 INFO L175 Difference]: Start difference. First operand has 560 places, 554 transitions, 1232 flow. Second operand 11 states and 6202 transitions. [2024-11-19 05:56:49,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 583 transitions, 1466 flow [2024-11-19 05:56:49,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 583 transitions, 1466 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:49,785 INFO L231 Difference]: Finished difference. Result has 575 places, 562 transitions, 1308 flow [2024-11-19 05:56:49,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1308, PETRI_PLACES=575, PETRI_TRANSITIONS=562} [2024-11-19 05:56:49,786 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -2 predicate places. [2024-11-19 05:56:49,787 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 562 transitions, 1308 flow [2024-11-19 05:56:49,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:49,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:49,788 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] [2024-11-19 05:56:49,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:56:49,789 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:49,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:49,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1249250259, now seen corresponding path program 1 times [2024-11-19 05:56:49,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:49,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529299341] [2024-11-19 05:56:49,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:49,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529299341] [2024-11-19 05:56:49,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529299341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:49,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:49,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:49,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878492258] [2024-11-19 05:56:49,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:49,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:49,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:49,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:49,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:49,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 622 [2024-11-19 05:56:49,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 562 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:49,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:49,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 622 [2024-11-19 05:56:49,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:50,546 INFO L124 PetriNetUnfolderBase]: 355/3156 cut-off events. [2024-11-19 05:56:50,547 INFO L125 PetriNetUnfolderBase]: For 287/358 co-relation queries the response was YES. [2024-11-19 05:56:50,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 3156 events. 355/3156 cut-off events. For 287/358 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 25530 event pairs, 144 based on Foata normal form. 0/2804 useless extension candidates. Maximal degree in co-relation 4000. Up to 419 conditions per place. [2024-11-19 05:56:50,610 INFO L140 encePairwiseOnDemand]: 618/622 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2024-11-19 05:56:50,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 565 transitions, 1350 flow [2024-11-19 05:56:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:50,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1782 transitions. [2024-11-19 05:56:50,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.954983922829582 [2024-11-19 05:56:50,614 INFO L175 Difference]: Start difference. First operand has 575 places, 562 transitions, 1308 flow. Second operand 3 states and 1782 transitions. [2024-11-19 05:56:50,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 565 transitions, 1350 flow [2024-11-19 05:56:50,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 565 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:50,624 INFO L231 Difference]: Finished difference. Result has 578 places, 563 transitions, 1322 flow [2024-11-19 05:56:50,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=578, PETRI_TRANSITIONS=563} [2024-11-19 05:56:50,626 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 1 predicate places. [2024-11-19 05:56:50,626 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 563 transitions, 1322 flow [2024-11-19 05:56:50,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.3333333333334) internal successors, (1771), 3 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:50,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:50,627 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:50,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:56:50,627 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:50,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash -252452634, now seen corresponding path program 1 times [2024-11-19 05:56:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:50,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054947606] [2024-11-19 05:56:50,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:50,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054947606] [2024-11-19 05:56:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054947606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:50,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:50,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921135640] [2024-11-19 05:56:50,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:50,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:50,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:50,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:50,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:51,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-19 05:56:51,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 563 transitions, 1322 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:51,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:51,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-19 05:56:51,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:52,215 INFO L124 PetriNetUnfolderBase]: 296/3358 cut-off events. [2024-11-19 05:56:52,215 INFO L125 PetriNetUnfolderBase]: For 339/371 co-relation queries the response was YES. [2024-11-19 05:56:52,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4451 conditions, 3358 events. 296/3358 cut-off events. For 339/371 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 26170 event pairs, 106 based on Foata normal form. 7/3076 useless extension candidates. Maximal degree in co-relation 4378. Up to 362 conditions per place. [2024-11-19 05:56:52,273 INFO L140 encePairwiseOnDemand]: 606/622 looper letters, 78 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2024-11-19 05:56:52,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 603 transitions, 1646 flow [2024-11-19 05:56:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:56:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:56:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6771 transitions. [2024-11-19 05:56:52,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071543408360129 [2024-11-19 05:56:52,287 INFO L175 Difference]: Start difference. First operand has 578 places, 563 transitions, 1322 flow. Second operand 12 states and 6771 transitions. [2024-11-19 05:56:52,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 603 transitions, 1646 flow [2024-11-19 05:56:52,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 603 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:52,304 INFO L231 Difference]: Finished difference. Result has 591 places, 567 transitions, 1388 flow [2024-11-19 05:56:52,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1388, PETRI_PLACES=591, PETRI_TRANSITIONS=567} [2024-11-19 05:56:52,305 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 14 predicate places. [2024-11-19 05:56:52,305 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 567 transitions, 1388 flow [2024-11-19 05:56:52,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:52,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:52,307 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-19 05:56:52,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:56:52,307 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:52,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:52,308 INFO L85 PathProgramCache]: Analyzing trace with hash -695808414, now seen corresponding path program 1 times [2024-11-19 05:56:52,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:52,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548421585] [2024-11-19 05:56:52,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:52,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:52,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548421585] [2024-11-19 05:56:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548421585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:52,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955522041] [2024-11-19 05:56:52,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:52,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:52,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:52,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:52,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:53,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-19 05:56:53,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 567 transitions, 1388 flow. Second operand has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:53,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:53,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-19 05:56:53,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:53,768 INFO L124 PetriNetUnfolderBase]: 162/2639 cut-off events. [2024-11-19 05:56:53,768 INFO L125 PetriNetUnfolderBase]: For 241/311 co-relation queries the response was YES. [2024-11-19 05:56:53,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3690 conditions, 2639 events. 162/2639 cut-off events. For 241/311 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 17676 event pairs, 65 based on Foata normal form. 6/2479 useless extension candidates. Maximal degree in co-relation 3610. Up to 234 conditions per place. [2024-11-19 05:56:53,810 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 72 selfloop transitions, 19 changer transitions 0/598 dead transitions. [2024-11-19 05:56:53,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 598 transitions, 1683 flow [2024-11-19 05:56:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6204 transitions. [2024-11-19 05:56:53,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9067524115755627 [2024-11-19 05:56:53,822 INFO L175 Difference]: Start difference. First operand has 591 places, 567 transitions, 1388 flow. Second operand 11 states and 6204 transitions. [2024-11-19 05:56:53,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 598 transitions, 1683 flow [2024-11-19 05:56:53,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 598 transitions, 1666 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:53,838 INFO L231 Difference]: Finished difference. Result has 598 places, 574 transitions, 1482 flow [2024-11-19 05:56:53,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1482, PETRI_PLACES=598, PETRI_TRANSITIONS=574} [2024-11-19 05:56:53,840 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-19 05:56:53,840 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 574 transitions, 1482 flow [2024-11-19 05:56:53,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.25) internal successors, (4490), 8 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:53,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:53,842 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-19 05:56:53,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:56:53,842 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:53,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash -813334789, now seen corresponding path program 1 times [2024-11-19 05:56:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:53,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139505653] [2024-11-19 05:56:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:54,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:54,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:54,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139505653] [2024-11-19 05:56:54,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139505653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:54,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:54,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:54,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200693682] [2024-11-19 05:56:54,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:54,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:54,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-19 05:56:54,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 574 transitions, 1482 flow. Second operand has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:54,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:54,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-19 05:56:54,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:55,735 INFO L124 PetriNetUnfolderBase]: 311/3814 cut-off events. [2024-11-19 05:56:55,735 INFO L125 PetriNetUnfolderBase]: For 549/661 co-relation queries the response was YES. [2024-11-19 05:56:55,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5408 conditions, 3814 events. 311/3814 cut-off events. For 549/661 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 31483 event pairs, 112 based on Foata normal form. 4/3537 useless extension candidates. Maximal degree in co-relation 5321. Up to 387 conditions per place. [2024-11-19 05:56:55,812 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 67 selfloop transitions, 18 changer transitions 0/600 dead transitions. [2024-11-19 05:56:55,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 600 transitions, 1744 flow [2024-11-19 05:56:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6195 transitions. [2024-11-19 05:56:55,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054370067231804 [2024-11-19 05:56:55,820 INFO L175 Difference]: Start difference. First operand has 598 places, 574 transitions, 1482 flow. Second operand 11 states and 6195 transitions. [2024-11-19 05:56:55,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 600 transitions, 1744 flow [2024-11-19 05:56:55,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 600 transitions, 1723 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:56:55,840 INFO L231 Difference]: Finished difference. Result has 606 places, 585 transitions, 1577 flow [2024-11-19 05:56:55,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1577, PETRI_PLACES=606, PETRI_TRANSITIONS=585} [2024-11-19 05:56:55,842 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 29 predicate places. [2024-11-19 05:56:55,842 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 585 transitions, 1577 flow [2024-11-19 05:56:55,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.375) internal successors, (4491), 8 states have internal predecessors, (4491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:55,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:55,844 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-19 05:56:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:56:55,844 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash -555921884, now seen corresponding path program 1 times [2024-11-19 05:56:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976961046] [2024-11-19 05:56:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:56,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976961046] [2024-11-19 05:56:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976961046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643431786] [2024-11-19 05:56:56,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:56,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:56,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:56,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:56,783 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 557 out of 622 [2024-11-19 05:56:56,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 585 transitions, 1577 flow. Second operand has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:56,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:56,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 557 of 622 [2024-11-19 05:56:56,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:57,837 INFO L124 PetriNetUnfolderBase]: 335/3802 cut-off events. [2024-11-19 05:56:57,837 INFO L125 PetriNetUnfolderBase]: For 795/835 co-relation queries the response was YES. [2024-11-19 05:56:57,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5553 conditions, 3802 events. 335/3802 cut-off events. For 795/835 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 30519 event pairs, 138 based on Foata normal form. 8/3541 useless extension candidates. Maximal degree in co-relation 5459. Up to 483 conditions per place. [2024-11-19 05:56:57,904 INFO L140 encePairwiseOnDemand]: 607/622 looper letters, 68 selfloop transitions, 19 changer transitions 0/607 dead transitions. [2024-11-19 05:56:57,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 607 transitions, 1846 flow [2024-11-19 05:56:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 05:56:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 05:56:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6195 transitions. [2024-11-19 05:56:57,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054370067231804 [2024-11-19 05:56:57,911 INFO L175 Difference]: Start difference. First operand has 606 places, 585 transitions, 1577 flow. Second operand 11 states and 6195 transitions. [2024-11-19 05:56:57,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 607 transitions, 1846 flow [2024-11-19 05:56:57,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 607 transitions, 1842 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:57,930 INFO L231 Difference]: Finished difference. Result has 618 places, 592 transitions, 1684 flow [2024-11-19 05:56:57,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1684, PETRI_PLACES=618, PETRI_TRANSITIONS=592} [2024-11-19 05:56:57,931 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 41 predicate places. [2024-11-19 05:56:57,931 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 592 transitions, 1684 flow [2024-11-19 05:56:57,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 561.5) internal successors, (4492), 8 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:57,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:57,933 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] [2024-11-19 05:56:57,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:56:57,933 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:56:57,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1287926569, now seen corresponding path program 1 times [2024-11-19 05:56:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:57,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543326030] [2024-11-19 05:56:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:58,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543326030] [2024-11-19 05:56:58,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543326030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:58,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:58,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098720788] [2024-11-19 05:56:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:58,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:58,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:58,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:58,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:59,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-19 05:56:59,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 592 transitions, 1684 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:59,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:59,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-19 05:56:59,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:00,176 INFO L124 PetriNetUnfolderBase]: 183/3420 cut-off events. [2024-11-19 05:57:00,176 INFO L125 PetriNetUnfolderBase]: For 774/798 co-relation queries the response was YES. [2024-11-19 05:57:00,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 3420 events. 183/3420 cut-off events. For 774/798 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 24515 event pairs, 23 based on Foata normal form. 4/3236 useless extension candidates. Maximal degree in co-relation 4961. Up to 177 conditions per place. [2024-11-19 05:57:00,235 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 41 selfloop transitions, 5 changer transitions 0/601 dead transitions. [2024-11-19 05:57:00,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 601 transitions, 1805 flow [2024-11-19 05:57:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2024-11-19 05:57:00,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252411575562701 [2024-11-19 05:57:00,239 INFO L175 Difference]: Start difference. First operand has 618 places, 592 transitions, 1684 flow. Second operand 6 states and 3453 transitions. [2024-11-19 05:57:00,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 601 transitions, 1805 flow [2024-11-19 05:57:00,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 601 transitions, 1784 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:57:00,259 INFO L231 Difference]: Finished difference. Result has 614 places, 590 transitions, 1669 flow [2024-11-19 05:57:00,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1669, PETRI_PLACES=614, PETRI_TRANSITIONS=590} [2024-11-19 05:57:00,260 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 37 predicate places. [2024-11-19 05:57:00,260 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 590 transitions, 1669 flow [2024-11-19 05:57:00,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:00,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:00,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:00,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 05:57:00,263 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:00,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash -217058218, now seen corresponding path program 1 times [2024-11-19 05:57:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:00,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677758767] [2024-11-19 05:57:00,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:00,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:00,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:00,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677758767] [2024-11-19 05:57:00,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677758767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:00,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:00,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:00,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332930062] [2024-11-19 05:57:00,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:00,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:00,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:00,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:00,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:01,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-19 05:57:01,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 590 transitions, 1669 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:01,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:01,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-19 05:57:01,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:02,630 INFO L124 PetriNetUnfolderBase]: 189/3708 cut-off events. [2024-11-19 05:57:02,631 INFO L125 PetriNetUnfolderBase]: For 770/830 co-relation queries the response was YES. [2024-11-19 05:57:02,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3708 events. 189/3708 cut-off events. For 770/830 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 27383 event pairs, 28 based on Foata normal form. 4/3471 useless extension candidates. Maximal degree in co-relation 5154. Up to 195 conditions per place. [2024-11-19 05:57:02,710 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 40 selfloop transitions, 5 changer transitions 0/598 dead transitions. [2024-11-19 05:57:02,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 598 transitions, 1785 flow [2024-11-19 05:57:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:02,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2024-11-19 05:57:02,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.92497320471597 [2024-11-19 05:57:02,714 INFO L175 Difference]: Start difference. First operand has 614 places, 590 transitions, 1669 flow. Second operand 6 states and 3452 transitions. [2024-11-19 05:57:02,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 598 transitions, 1785 flow [2024-11-19 05:57:02,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 598 transitions, 1775 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:02,730 INFO L231 Difference]: Finished difference. Result has 612 places, 588 transitions, 1665 flow [2024-11-19 05:57:02,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1665, PETRI_PLACES=612, PETRI_TRANSITIONS=588} [2024-11-19 05:57:02,731 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 35 predicate places. [2024-11-19 05:57:02,731 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 588 transitions, 1665 flow [2024-11-19 05:57:02,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:02,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:02,733 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] [2024-11-19 05:57:02,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:57:02,733 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:02,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:02,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1624233987, now seen corresponding path program 1 times [2024-11-19 05:57:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:02,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913102629] [2024-11-19 05:57:02,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:02,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:03,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:03,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913102629] [2024-11-19 05:57:03,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913102629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:03,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:03,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115528160] [2024-11-19 05:57:03,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:03,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:03,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:03,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:03,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-19 05:57:03,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 588 transitions, 1665 flow. Second operand has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:03,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:03,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-19 05:57:03,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:04,353 INFO L124 PetriNetUnfolderBase]: 168/3451 cut-off events. [2024-11-19 05:57:04,353 INFO L125 PetriNetUnfolderBase]: For 751/823 co-relation queries the response was YES. [2024-11-19 05:57:04,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5006 conditions, 3451 events. 168/3451 cut-off events. For 751/823 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 24889 event pairs, 23 based on Foata normal form. 4/3270 useless extension candidates. Maximal degree in co-relation 4909. Up to 187 conditions per place. [2024-11-19 05:57:04,410 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 41 selfloop transitions, 5 changer transitions 0/597 dead transitions. [2024-11-19 05:57:04,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 597 transitions, 1786 flow [2024-11-19 05:57:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:04,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3453 transitions. [2024-11-19 05:57:04,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252411575562701 [2024-11-19 05:57:04,413 INFO L175 Difference]: Start difference. First operand has 612 places, 588 transitions, 1665 flow. Second operand 6 states and 3453 transitions. [2024-11-19 05:57:04,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 597 transitions, 1786 flow [2024-11-19 05:57:04,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 597 transitions, 1776 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:04,425 INFO L231 Difference]: Finished difference. Result has 610 places, 586 transitions, 1661 flow [2024-11-19 05:57:04,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1651, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1661, PETRI_PLACES=610, PETRI_TRANSITIONS=586} [2024-11-19 05:57:04,426 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 33 predicate places. [2024-11-19 05:57:04,426 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 586 transitions, 1661 flow [2024-11-19 05:57:04,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 570.8333333333334) internal successors, (3425), 6 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:04,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:04,427 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] [2024-11-19 05:57:04,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:57:04,427 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:04,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1860500184, now seen corresponding path program 1 times [2024-11-19 05:57:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:04,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347407413] [2024-11-19 05:57:04,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347407413] [2024-11-19 05:57:04,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347407413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:04,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:04,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844714803] [2024-11-19 05:57:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:04,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:04,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:04,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:04,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 622 [2024-11-19 05:57:04,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 586 transitions, 1661 flow. Second operand has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:04,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:04,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 622 [2024-11-19 05:57:04,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:05,695 INFO L124 PetriNetUnfolderBase]: 461/6869 cut-off events. [2024-11-19 05:57:05,695 INFO L125 PetriNetUnfolderBase]: For 823/857 co-relation queries the response was YES. [2024-11-19 05:57:05,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8854 conditions, 6869 events. 461/6869 cut-off events. For 823/857 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 62328 event pairs, 66 based on Foata normal form. 0/6333 useless extension candidates. Maximal degree in co-relation 8758. Up to 487 conditions per place. [2024-11-19 05:57:05,832 INFO L140 encePairwiseOnDemand]: 616/622 looper letters, 19 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2024-11-19 05:57:05,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 588 transitions, 1711 flow [2024-11-19 05:57:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1774 transitions. [2024-11-19 05:57:05,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9506966773847803 [2024-11-19 05:57:05,834 INFO L175 Difference]: Start difference. First operand has 610 places, 586 transitions, 1661 flow. Second operand 3 states and 1774 transitions. [2024-11-19 05:57:05,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 588 transitions, 1711 flow [2024-11-19 05:57:05,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 588 transitions, 1701 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:05,852 INFO L231 Difference]: Finished difference. Result has 604 places, 584 transitions, 1657 flow [2024-11-19 05:57:05,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1657, PETRI_PLACES=604, PETRI_TRANSITIONS=584} [2024-11-19 05:57:05,853 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2024-11-19 05:57:05,854 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 584 transitions, 1657 flow [2024-11-19 05:57:05,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 584.6666666666666) internal successors, (1754), 3 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:05,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:05,854 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] [2024-11-19 05:57:05,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:57:05,855 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:05,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:05,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1631774597, now seen corresponding path program 1 times [2024-11-19 05:57:05,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556753373] [2024-11-19 05:57:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:05,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:06,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:06,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556753373] [2024-11-19 05:57:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556753373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170865790] [2024-11-19 05:57:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:06,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:06,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-19 05:57:06,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 584 transitions, 1657 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:06,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:06,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-19 05:57:06,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:07,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][477], [201#L79-4true, Black: 831#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 837#(= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:07,565 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2024-11-19 05:57:07,565 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-19 05:57:07,565 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-19 05:57:07,565 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-19 05:57:07,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][481], [Black: 831#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), 838#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 162#L79-5true, 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:07,573 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-11-19 05:57:07,573 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2024-11-19 05:57:07,573 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-19 05:57:07,573 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-19 05:57:07,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][485], [Black: 831#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), 314#L104true, Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), 839#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 150#L79-6true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:07,578 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-11-19 05:57:07,579 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-19 05:57:07,579 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-19 05:57:07,579 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2024-11-19 05:57:07,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][490], [Black: 831#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, 314#L104true, Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 125#L79-7true, Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:07,583 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2024-11-19 05:57:07,584 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-19 05:57:07,584 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2024-11-19 05:57:07,584 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-19 05:57:07,589 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][490], [Black: 831#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), 376#L79-8true, Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), 840#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:07,589 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-11-19 05:57:07,590 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-19 05:57:07,590 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-19 05:57:07,590 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-11-19 05:57:07,682 INFO L124 PetriNetUnfolderBase]: 320/4336 cut-off events. [2024-11-19 05:57:07,682 INFO L125 PetriNetUnfolderBase]: For 1094/1127 co-relation queries the response was YES. [2024-11-19 05:57:07,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6333 conditions, 4336 events. 320/4336 cut-off events. For 1094/1127 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 35854 event pairs, 38 based on Foata normal form. 4/4120 useless extension candidates. Maximal degree in co-relation 6236. Up to 229 conditions per place. [2024-11-19 05:57:07,753 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 39 selfloop transitions, 5 changer transitions 0/591 dead transitions. [2024-11-19 05:57:07,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 591 transitions, 1768 flow [2024-11-19 05:57:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2024-11-19 05:57:07,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9247052518756699 [2024-11-19 05:57:07,755 INFO L175 Difference]: Start difference. First operand has 604 places, 584 transitions, 1657 flow. Second operand 6 states and 3451 transitions. [2024-11-19 05:57:07,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 591 transitions, 1768 flow [2024-11-19 05:57:07,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 591 transitions, 1768 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:07,771 INFO L231 Difference]: Finished difference. Result has 607 places, 582 transitions, 1663 flow [2024-11-19 05:57:07,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1663, PETRI_PLACES=607, PETRI_TRANSITIONS=582} [2024-11-19 05:57:07,773 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 30 predicate places. [2024-11-19 05:57:07,773 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 582 transitions, 1663 flow [2024-11-19 05:57:07,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:07,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:07,774 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] [2024-11-19 05:57:07,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:57:07,775 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:07,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash -29619716, now seen corresponding path program 1 times [2024-11-19 05:57:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462340517] [2024-11-19 05:57:07,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:07,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462340517] [2024-11-19 05:57:08,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462340517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:08,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742212534] [2024-11-19 05:57:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:08,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:08,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:08,803 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-19 05:57:08,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 582 transitions, 1663 flow. Second operand has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:08,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:08,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-19 05:57:08,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:09,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][334], [Black: 831#true, 456#L105true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 658#true, Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 835#true, 841#true, 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:09,546 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-19 05:57:09,546 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-19 05:57:09,546 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:57:09,546 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:57:09,590 INFO L124 PetriNetUnfolderBase]: 204/4117 cut-off events. [2024-11-19 05:57:09,590 INFO L125 PetriNetUnfolderBase]: For 784/898 co-relation queries the response was YES. [2024-11-19 05:57:09,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 4117 events. 204/4117 cut-off events. For 784/898 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 32102 event pairs, 30 based on Foata normal form. 11/3924 useless extension candidates. Maximal degree in co-relation 5699. Up to 194 conditions per place. [2024-11-19 05:57:09,668 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 40 selfloop transitions, 5 changer transitions 0/590 dead transitions. [2024-11-19 05:57:09,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 590 transitions, 1779 flow [2024-11-19 05:57:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:09,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3452 transitions. [2024-11-19 05:57:09,671 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.92497320471597 [2024-11-19 05:57:09,671 INFO L175 Difference]: Start difference. First operand has 607 places, 582 transitions, 1663 flow. Second operand 6 states and 3452 transitions. [2024-11-19 05:57:09,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 590 transitions, 1779 flow [2024-11-19 05:57:09,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 590 transitions, 1769 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:09,682 INFO L231 Difference]: Finished difference. Result has 605 places, 580 transitions, 1659 flow [2024-11-19 05:57:09,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1649, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1659, PETRI_PLACES=605, PETRI_TRANSITIONS=580} [2024-11-19 05:57:09,683 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 28 predicate places. [2024-11-19 05:57:09,683 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 580 transitions, 1659 flow [2024-11-19 05:57:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.0) internal successors, (3426), 6 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:09,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:09,684 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, 1] [2024-11-19 05:57:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:57:09,684 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 668239048, now seen corresponding path program 1 times [2024-11-19 05:57:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394290256] [2024-11-19 05:57:09,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:09,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394290256] [2024-11-19 05:57:09,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394290256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:09,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:09,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586238676] [2024-11-19 05:57:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:09,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:09,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:09,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-11-19 05:57:09,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 580 transitions, 1659 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:09,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:09,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-11-19 05:57:09,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:10,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][334], [Black: 831#true, 456#L105true, 662#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 658#true, Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 847#true, Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), 841#true, Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 631#(= |#race~n3~0| 0), Black: 795#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:10,464 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-19 05:57:10,464 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:57:10,465 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-19 05:57:10,465 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:57:10,540 INFO L124 PetriNetUnfolderBase]: 160/4200 cut-off events. [2024-11-19 05:57:10,540 INFO L125 PetriNetUnfolderBase]: For 740/780 co-relation queries the response was YES. [2024-11-19 05:57:10,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5771 conditions, 4200 events. 160/4200 cut-off events. For 740/780 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 30987 event pairs, 27 based on Foata normal form. 0/4030 useless extension candidates. Maximal degree in co-relation 5674. Up to 132 conditions per place. [2024-11-19 05:57:10,610 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 9 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2024-11-19 05:57:10,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 579 transitions, 1677 flow [2024-11-19 05:57:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-19 05:57:10,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2024-11-19 05:57:10,611 INFO L175 Difference]: Start difference. First operand has 605 places, 580 transitions, 1659 flow. Second operand 3 states and 1784 transitions. [2024-11-19 05:57:10,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 579 transitions, 1677 flow [2024-11-19 05:57:10,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 579 transitions, 1667 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:10,622 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1649 flow [2024-11-19 05:57:10,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1647, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1649, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2024-11-19 05:57:10,622 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 24 predicate places. [2024-11-19 05:57:10,623 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1649 flow [2024-11-19 05:57:10,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:10,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:10,623 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:10,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:57:10,623 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:10,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash -2135423061, now seen corresponding path program 1 times [2024-11-19 05:57:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42220134] [2024-11-19 05:57:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:11,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:11,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42220134] [2024-11-19 05:57:11,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42220134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:11,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:11,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:57:11,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488960885] [2024-11-19 05:57:11,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:11,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:57:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:57:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:57:11,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 568 out of 622 [2024-11-19 05:57:11,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1649 flow. Second operand has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:11,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:11,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 568 of 622 [2024-11-19 05:57:11,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:12,324 INFO L124 PetriNetUnfolderBase]: 270/4234 cut-off events. [2024-11-19 05:57:12,325 INFO L125 PetriNetUnfolderBase]: For 1044/1072 co-relation queries the response was YES. [2024-11-19 05:57:12,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 4234 events. 270/4234 cut-off events. For 1044/1072 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 34090 event pairs, 38 based on Foata normal form. 0/4081 useless extension candidates. Maximal degree in co-relation 6048. Up to 214 conditions per place. [2024-11-19 05:57:12,395 INFO L140 encePairwiseOnDemand]: 615/622 looper letters, 39 selfloop transitions, 5 changer transitions 0/586 dead transitions. [2024-11-19 05:57:12,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 586 transitions, 1760 flow [2024-11-19 05:57:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:57:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:57:12,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3451 transitions. [2024-11-19 05:57:12,398 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9247052518756699 [2024-11-19 05:57:12,398 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1649 flow. Second operand 6 states and 3451 transitions. [2024-11-19 05:57:12,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 586 transitions, 1760 flow [2024-11-19 05:57:12,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 586 transitions, 1759 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:12,414 INFO L231 Difference]: Finished difference. Result has 603 places, 577 transitions, 1654 flow [2024-11-19 05:57:12,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1644, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1654, PETRI_PLACES=603, PETRI_TRANSITIONS=577} [2024-11-19 05:57:12,416 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 26 predicate places. [2024-11-19 05:57:12,416 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 577 transitions, 1654 flow [2024-11-19 05:57:12,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 571.1666666666666) internal successors, (3427), 6 states have internal predecessors, (3427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:12,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:12,417 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, 1, 1, 1, 1, 1] [2024-11-19 05:57:12,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:57:12,417 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:12,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1991993737, now seen corresponding path program 1 times [2024-11-19 05:57:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:12,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670475673] [2024-11-19 05:57:12,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:12,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670475673] [2024-11-19 05:57:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670475673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287862575] [2024-11-19 05:57:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:12,475 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-11-19 05:57:12,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 577 transitions, 1654 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:12,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:12,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-11-19 05:57:12,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:13,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1735] thread3EXIT-->L105: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][334], [Black: 831#true, 456#L105true, 662#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 658#true, Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), 850#true, Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), 718#true, Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 795#(<= ~n3~0 0), Black: 667#(<= ~n1~0 0), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), 856#true, Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:13,075 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2024-11-19 05:57:13,075 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2024-11-19 05:57:13,075 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:57:13,075 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2024-11-19 05:57:13,137 INFO L124 PetriNetUnfolderBase]: 122/3730 cut-off events. [2024-11-19 05:57:13,137 INFO L125 PetriNetUnfolderBase]: For 635/702 co-relation queries the response was YES. [2024-11-19 05:57:13,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5146 conditions, 3730 events. 122/3730 cut-off events. For 635/702 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 27107 event pairs, 30 based on Foata normal form. 0/3613 useless extension candidates. Maximal degree in co-relation 5049. Up to 129 conditions per place. [2024-11-19 05:57:13,200 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 9 selfloop transitions, 1 changer transitions 0/576 dead transitions. [2024-11-19 05:57:13,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 576 transitions, 1672 flow [2024-11-19 05:57:13,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-19 05:57:13,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9560557341907824 [2024-11-19 05:57:13,202 INFO L175 Difference]: Start difference. First operand has 603 places, 577 transitions, 1654 flow. Second operand 3 states and 1784 transitions. [2024-11-19 05:57:13,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 576 transitions, 1672 flow [2024-11-19 05:57:13,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 576 transitions, 1662 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:57:13,213 INFO L231 Difference]: Finished difference. Result has 599 places, 576 transitions, 1644 flow [2024-11-19 05:57:13,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1644, PETRI_PLACES=599, PETRI_TRANSITIONS=576} [2024-11-19 05:57:13,214 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 22 predicate places. [2024-11-19 05:57:13,214 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 576 transitions, 1644 flow [2024-11-19 05:57:13,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:13,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:13,214 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:13,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:57:13,215 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:13,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1325481753, now seen corresponding path program 1 times [2024-11-19 05:57:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784933681] [2024-11-19 05:57:13,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:57:13,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:13,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784933681] [2024-11-19 05:57:13,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784933681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:13,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:13,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:13,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383669350] [2024-11-19 05:57:13,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:13,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:13,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:13,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 622 [2024-11-19 05:57:13,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 576 transitions, 1644 flow. Second operand has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:13,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:13,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 622 [2024-11-19 05:57:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:13,875 INFO L124 PetriNetUnfolderBase]: 133/3239 cut-off events. [2024-11-19 05:57:13,875 INFO L125 PetriNetUnfolderBase]: For 525/564 co-relation queries the response was YES. [2024-11-19 05:57:13,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4443 conditions, 3239 events. 133/3239 cut-off events. For 525/564 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22461 event pairs, 39 based on Foata normal form. 30/3165 useless extension candidates. Maximal degree in co-relation 4346. Up to 154 conditions per place. [2024-11-19 05:57:13,927 INFO L140 encePairwiseOnDemand]: 620/622 looper letters, 7 selfloop transitions, 0 changer transitions 20/575 dead transitions. [2024-11-19 05:57:13,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 575 transitions, 1660 flow [2024-11-19 05:57:13,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-19 05:57:13,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9555198285101822 [2024-11-19 05:57:13,929 INFO L175 Difference]: Start difference. First operand has 599 places, 576 transitions, 1644 flow. Second operand 3 states and 1783 transitions. [2024-11-19 05:57:13,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 575 transitions, 1660 flow [2024-11-19 05:57:13,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 575 transitions, 1659 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:57:13,943 INFO L231 Difference]: Finished difference. Result has 599 places, 555 transitions, 1528 flow [2024-11-19 05:57:13,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1528, PETRI_PLACES=599, PETRI_TRANSITIONS=555} [2024-11-19 05:57:13,944 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 22 predicate places. [2024-11-19 05:57:13,944 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 555 transitions, 1528 flow [2024-11-19 05:57:13,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.0) internal successors, (1782), 3 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:13,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:13,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:13,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 05:57:13,945 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:13,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:13,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1051946790, now seen corresponding path program 1 times [2024-11-19 05:57:13,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:13,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220631680] [2024-11-19 05:57:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:13,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:14,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220631680] [2024-11-19 05:57:14,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220631680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238348019] [2024-11-19 05:57:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-19 05:57:14,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 555 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:14,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-19 05:57:14,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:14,695 INFO L124 PetriNetUnfolderBase]: 155/3721 cut-off events. [2024-11-19 05:57:14,695 INFO L125 PetriNetUnfolderBase]: For 537/557 co-relation queries the response was YES. [2024-11-19 05:57:14,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 3721 events. 155/3721 cut-off events. For 537/557 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 25093 event pairs, 25 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5037. Up to 107 conditions per place. [2024-11-19 05:57:14,760 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 10 selfloop transitions, 2 changer transitions 12/556 dead transitions. [2024-11-19 05:57:14,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 556 transitions, 1556 flow [2024-11-19 05:57:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:14,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-11-19 05:57:14,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-11-19 05:57:14,761 INFO L175 Difference]: Start difference. First operand has 599 places, 555 transitions, 1528 flow. Second operand 3 states and 1780 transitions. [2024-11-19 05:57:14,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 556 transitions, 1556 flow [2024-11-19 05:57:14,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 556 transitions, 1544 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-19 05:57:14,778 INFO L231 Difference]: Finished difference. Result has 586 places, 542 transitions, 1430 flow [2024-11-19 05:57:14,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=586, PETRI_TRANSITIONS=542} [2024-11-19 05:57:14,779 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 9 predicate places. [2024-11-19 05:57:14,779 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 542 transitions, 1430 flow [2024-11-19 05:57:14,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 590.6666666666666) internal successors, (1772), 3 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:14,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:14,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:14,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-19 05:57:14,780 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:14,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -257600146, now seen corresponding path program 1 times [2024-11-19 05:57:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:14,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527204565] [2024-11-19 05:57:14,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527204565] [2024-11-19 05:57:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527204565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:14,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:14,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723387599] [2024-11-19 05:57:14,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:14,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:14,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:14,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-19 05:57:14,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 542 transitions, 1430 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:14,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:14,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-19 05:57:14,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:15,422 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1423] L51-8-->L51-9: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][351], [Black: 831#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 304#L51-9true, Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 865#true, Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 862#true, 48#L102-4true, 578#L65-1true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 859#true, 171#L79-1true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:15,422 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-19 05:57:15,422 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-19 05:57:15,422 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-19 05:57:15,422 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-19 05:57:15,456 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1734] thread2EXIT-->L104: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][353], [Black: 831#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 662#true, 314#L104true, Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 649#true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 778#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 865#true, Black: 784#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), Black: 770#(<= ~n3~0 0), Black: 771#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n3~0 0)), Black: 658#true, 862#true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 809#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), 718#true, 631#(= |#race~n3~0| 0), Black: 667#(<= ~n1~0 0), Black: 795#(<= ~n3~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 796#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 859#true, 171#L79-1true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:15,456 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2024-11-19 05:57:15,456 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-19 05:57:15,456 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-19 05:57:15,456 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-19 05:57:15,462 INFO L124 PetriNetUnfolderBase]: 139/2925 cut-off events. [2024-11-19 05:57:15,462 INFO L125 PetriNetUnfolderBase]: For 336/359 co-relation queries the response was YES. [2024-11-19 05:57:15,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 2925 events. 139/2925 cut-off events. For 336/359 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 18678 event pairs, 27 based on Foata normal form. 0/2837 useless extension candidates. Maximal degree in co-relation 3851. Up to 90 conditions per place. [2024-11-19 05:57:15,497 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 10 selfloop transitions, 2 changer transitions 12/543 dead transitions. [2024-11-19 05:57:15,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 543 transitions, 1458 flow [2024-11-19 05:57:15,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-11-19 05:57:15,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-11-19 05:57:15,499 INFO L175 Difference]: Start difference. First operand has 586 places, 542 transitions, 1430 flow. Second operand 3 states and 1780 transitions. [2024-11-19 05:57:15,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 543 transitions, 1458 flow [2024-11-19 05:57:15,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 543 transitions, 1412 flow, removed 13 selfloop flow, removed 13 redundant places. [2024-11-19 05:57:15,512 INFO L231 Difference]: Finished difference. Result has 567 places, 529 transitions, 1310 flow [2024-11-19 05:57:15,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=567, PETRI_TRANSITIONS=529} [2024-11-19 05:57:15,513 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -10 predicate places. [2024-11-19 05:57:15,513 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 529 transitions, 1310 flow [2024-11-19 05:57:15,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:15,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:57:15,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:57:15,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-19 05:57:15,515 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 98 more)] === [2024-11-19 05:57:15,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:57:15,515 INFO L85 PathProgramCache]: Analyzing trace with hash -256951214, now seen corresponding path program 1 times [2024-11-19 05:57:15,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:57:15,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128996417] [2024-11-19 05:57:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:57:15,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:57:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:57:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:57:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:57:15,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128996417] [2024-11-19 05:57:15,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128996417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:57:15,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:57:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:57:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480474535] [2024-11-19 05:57:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:57:15,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:57:15,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:57:15,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:57:15,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:57:15,597 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 622 [2024-11-19 05:57:15,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 529 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:15,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:57:15,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 622 [2024-11-19 05:57:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:57:15,942 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1423] L51-8-->L51-9: Formula: (= |v_#race~a2~0_1| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_1|} AuxVars[] AssignedVars[#race~a2~0][325], [Black: 831#true, 662#true, Black: 701#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 699#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 643#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 694#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0)), Black: 693#(<= ~n2~0 0), Black: 707#(and (= |thread2Thread1of1ForFork2_~i~1#1| 0) (<= ~n2~0 0) (not |thread2Thread1of1ForFork2_#t~short11#1|)), 304#L51-9true, Black: 715#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 649#true, Black: 655#(not |thread2Thread1of1ForFork2_#t~short11#1|), Black: 776#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 865#true, Black: 658#true, 48#L102-4true, 578#L65-1true, Black: 723#(<= ~n1~0 0), Black: 737#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0)), Black: 724#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), 651#(= |#race~a1~0| 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 631#(= |#race~n3~0| 0), 718#true, Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a2~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 859#true, 171#L79-1true, 625#(= |#race~n2~0| 0), 613#(= |#race~n1~0| 0), Black: 748#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 868#true, Black: 747#(<= ~n2~0 0), Black: 761#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 833#(= |#race~a3~0| 0)]) [2024-11-19 05:57:15,942 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-11-19 05:57:15,942 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-19 05:57:15,942 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-19 05:57:15,943 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2024-11-19 05:57:15,963 INFO L124 PetriNetUnfolderBase]: 121/1832 cut-off events. [2024-11-19 05:57:15,964 INFO L125 PetriNetUnfolderBase]: For 185/202 co-relation queries the response was YES. [2024-11-19 05:57:15,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 1832 events. 121/1832 cut-off events. For 185/202 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10710 event pairs, 24 based on Foata normal form. 0/1766 useless extension candidates. Maximal degree in co-relation 2387. Up to 83 conditions per place. [2024-11-19 05:57:15,994 INFO L140 encePairwiseOnDemand]: 619/622 looper letters, 0 selfloop transitions, 0 changer transitions 530/530 dead transitions. [2024-11-19 05:57:15,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 530 transitions, 1338 flow [2024-11-19 05:57:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:57:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:57:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1780 transitions. [2024-11-19 05:57:15,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539121114683816 [2024-11-19 05:57:15,995 INFO L175 Difference]: Start difference. First operand has 567 places, 529 transitions, 1310 flow. Second operand 3 states and 1780 transitions. [2024-11-19 05:57:15,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 530 transitions, 1338 flow [2024-11-19 05:57:16,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 530 transitions, 1278 flow, removed 8 selfloop flow, removed 17 redundant places. [2024-11-19 05:57:16,003 INFO L231 Difference]: Finished difference. Result has 544 places, 0 transitions, 0 flow [2024-11-19 05:57:16,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=622, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=544, PETRI_TRANSITIONS=0} [2024-11-19 05:57:16,004 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-19 05:57:16,004 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 0 transitions, 0 flow [2024-11-19 05:57:16,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:57:16,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (101 of 102 remaining) [2024-11-19 05:57:16,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (100 of 102 remaining) [2024-11-19 05:57:16,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (99 of 102 remaining) [2024-11-19 05:57:16,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (98 of 102 remaining) [2024-11-19 05:57:16,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (97 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (96 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (95 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (94 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (93 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (92 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (91 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (90 of 102 remaining) [2024-11-19 05:57:16,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (89 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (88 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (87 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (86 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (85 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (84 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (83 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (82 of 102 remaining) [2024-11-19 05:57:16,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (81 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (80 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (79 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (78 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (77 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (76 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (75 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (74 of 102 remaining) [2024-11-19 05:57:16,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (73 of 102 remaining) [2024-11-19 05:57:16,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (72 of 102 remaining) [2024-11-19 05:57:16,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (71 of 102 remaining) [2024-11-19 05:57:16,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (70 of 102 remaining) [2024-11-19 05:57:16,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (69 of 102 remaining) [2024-11-19 05:57:16,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (68 of 102 remaining) [2024-11-19 05:57:16,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (67 of 102 remaining) [2024-11-19 05:57:16,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (66 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (65 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (64 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (63 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (62 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (61 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (60 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (59 of 102 remaining) [2024-11-19 05:57:16,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (58 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (57 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (56 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (55 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (54 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (53 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (52 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (51 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (49 of 102 remaining) [2024-11-19 05:57:16,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (48 of 102 remaining) [2024-11-19 05:57:16,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (47 of 102 remaining) [2024-11-19 05:57:16,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (46 of 102 remaining) [2024-11-19 05:57:16,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 102 remaining) [2024-11-19 05:57:16,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 102 remaining) [2024-11-19 05:57:16,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 102 remaining) [2024-11-19 05:57:16,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 102 remaining) [2024-11-19 05:57:16,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (40 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (39 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (37 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (36 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (35 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (32 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (31 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (30 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 102 remaining) [2024-11-19 05:57:16,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (28 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (26 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (25 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (24 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (23 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (22 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (20 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (18 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (17 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (16 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (15 of 102 remaining) [2024-11-19 05:57:16,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (14 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (8 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 102 remaining) [2024-11-19 05:57:16,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 102 remaining) [2024-11-19 05:57:16,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 102 remaining) [2024-11-19 05:57:16,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (4 of 102 remaining) [2024-11-19 05:57:16,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (3 of 102 remaining) [2024-11-19 05:57:16,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (2 of 102 remaining) [2024-11-19 05:57:16,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (1 of 102 remaining) [2024-11-19 05:57:16,019 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (0 of 102 remaining) [2024-11-19 05:57:16,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 05:57:16,020 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-19 05:57:16,026 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:57:16,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:57:16,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:57:16 BasicIcfg [2024-11-19 05:57:16,033 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:57:16,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:57:16,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:57:16,034 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:57:16,034 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:26" (3/4) ... [2024-11-19 05:57:16,036 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:57:16,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:57:16,040 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:57:16,041 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:57:16,053 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-19 05:57:16,054 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:57:16,054 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:57:16,055 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:57:16,168 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:57:16,170 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:57:16,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:57:16,171 INFO L158 Benchmark]: Toolchain (without parser) took 51169.53ms. Allocated memory was 172.0MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 103.5MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-19 05:57:16,172 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:57:16,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.46ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 88.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 05:57:16,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.89ms. Allocated memory is still 172.0MB. Free memory was 88.0MB in the beginning and 83.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:16,172 INFO L158 Benchmark]: Boogie Preprocessor took 54.39ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 79.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:57:16,172 INFO L158 Benchmark]: RCFGBuilder took 1187.07ms. Allocated memory is still 172.0MB. Free memory was 79.9MB in the beginning and 106.2MB in the end (delta: -26.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 05:57:16,173 INFO L158 Benchmark]: TraceAbstraction took 49328.37ms. Allocated memory was 172.0MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 105.4MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-19 05:57:16,173 INFO L158 Benchmark]: Witness Printer took 137.15ms. Allocated memory is still 9.6GB. Free memory was 8.5GB in the beginning and 8.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 05:57:16,174 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.46ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 88.0MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.89ms. Allocated memory is still 172.0MB. Free memory was 88.0MB in the beginning and 83.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.39ms. Allocated memory is still 172.0MB. Free memory was 83.6MB in the beginning and 79.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1187.07ms. Allocated memory is still 172.0MB. Free memory was 79.9MB in the beginning and 106.2MB in the end (delta: -26.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 49328.37ms. Allocated memory was 172.0MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 105.4MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 137.15ms. Allocated memory is still 9.6GB. Free memory was 8.5GB in the beginning and 8.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 923 locations, 102 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 49.1s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6759 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4292 mSDsluCounter, 7036 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6465 mSDsCounter, 1290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10422 IncrementalHoareTripleChecker+Invalid, 11712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1290 mSolverCounterUnsat, 571 mSDtfsCounter, 10422 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1684occurred in iteration=24, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 6289 NumberOfCodeBlocks, 6289 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6252 ConstructedInterpolants, 0 QuantifiedInterpolants, 8576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:57:16,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE