./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:16:46,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:16:46,267 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:16:46,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:16:46,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:16:46,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:16:46,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:16:46,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:16:46,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:16:46,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:16:46,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:16:46,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:16:46,286 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:16:46,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:16:46,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:16:46,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:16:46,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:16:46,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:16:46,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:16:46,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:16:46,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:16:46,292 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:16:46,292 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:16:46,292 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:16:46,292 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:16:46,292 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:16:46,292 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:16:46,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:16:46,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:16:46,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:16:46,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:16:46,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:46,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:16:46,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:16:46,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:16:46,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:16:46,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:16:46,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:16:46,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:16:46,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:16:46,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:16:46,294 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-clean/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-clean/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 -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe [2024-10-11 17:16:46,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:16:46,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:16:46,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:16:46,508 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:16:46,508 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:16:46,509 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2024-10-11 17:16:47,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:16:48,045 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:16:48,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2024-10-11 17:16:48,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/875926ccd/f6e7e7507fec4f03ae47d7eff746dd85/FLAG365624943 [2024-10-11 17:16:48,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/875926ccd/f6e7e7507fec4f03ae47d7eff746dd85 [2024-10-11 17:16:48,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:16:48,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:16:48,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:48,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:16:48,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:16:48,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa4d55c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48, skipping insertion in model container [2024-10-11 17:16:48,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:16:48,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:48,312 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:16:48,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:48,367 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:16:48,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48 WrapperNode [2024-10-11 17:16:48,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:48,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:48,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:16:48,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:16:48,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,429 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 578 [2024-10-11 17:16:48,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:48,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:16:48,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:16:48,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:16:48,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:16:48,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:16:48,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:16:48,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:16:48,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (1/1) ... [2024-10-11 17:16:48,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:16:48,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:16:48,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:16:48,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:16:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:16:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:16:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:16:48,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:16:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:16:48,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:16:48,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:16:48,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:16:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 17:16:48,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 17:16:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:16:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:16:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:16:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:16:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:16:48,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:16:48,570 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:16:48,712 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:16:48,715 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:16:49,474 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:16:49,474 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:16:49,959 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:16:49,959 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 17:16:49,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:49 BoogieIcfgContainer [2024-10-11 17:16:49,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:16:49,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:16:49,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:16:49,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:16:49,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:16:48" (1/3) ... [2024-10-11 17:16:49,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449abf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:49, skipping insertion in model container [2024-10-11 17:16:49,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:48" (2/3) ... [2024-10-11 17:16:49,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449abf92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:49, skipping insertion in model container [2024-10-11 17:16:49,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:49" (3/3) ... [2024-10-11 17:16:49,970 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2024-10-11 17:16:49,986 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:16:49,986 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 89 error locations. [2024-10-11 17:16:49,986 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:16:50,084 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-11 17:16:50,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 383 places, 389 transitions, 806 flow [2024-10-11 17:16:50,269 INFO L124 PetriNetUnfolderBase]: 19/385 cut-off events. [2024-10-11 17:16:50,272 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:16:50,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 385 events. 19/385 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 577 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 336. Up to 2 conditions per place. [2024-10-11 17:16:50,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 383 places, 389 transitions, 806 flow [2024-10-11 17:16:50,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 363 places, 368 transitions, 760 flow [2024-10-11 17:16:50,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:16:50,316 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;@320c0720, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:16:50,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 163 error locations. [2024-10-11 17:16:50,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:16:50,322 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-10-11 17:16:50,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:16:50,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:50,323 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:50,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:50,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash 613595407, now seen corresponding path program 1 times [2024-10-11 17:16:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547677368] [2024-10-11 17:16:50,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:50,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:50,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547677368] [2024-10-11 17:16:50,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547677368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:50,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:50,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345939520] [2024-10-11 17:16:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:50,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:50,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:50,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:50,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:50,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 389 [2024-10-11 17:16:50,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 368 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:50,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:50,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 389 [2024-10-11 17:16:50,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:51,015 INFO L124 PetriNetUnfolderBase]: 745/1663 cut-off events. [2024-10-11 17:16:51,016 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-10-11 17:16:51,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2865 conditions, 1663 events. 745/1663 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8691 event pairs, 485 based on Foata normal form. 264/1769 useless extension candidates. Maximal degree in co-relation 2496. Up to 1008 conditions per place. [2024-10-11 17:16:51,034 INFO L140 encePairwiseOnDemand]: 305/389 looper letters, 26 selfloop transitions, 2 changer transitions 5/286 dead transitions. [2024-10-11 17:16:51,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 286 transitions, 652 flow [2024-10-11 17:16:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 938 transitions. [2024-10-11 17:16:51,052 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.803770351328192 [2024-10-11 17:16:51,055 INFO L175 Difference]: Start difference. First operand has 363 places, 368 transitions, 760 flow. Second operand 3 states and 938 transitions. [2024-10-11 17:16:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 286 transitions, 652 flow [2024-10-11 17:16:51,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 286 transitions, 636 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-11 17:16:51,069 INFO L231 Difference]: Finished difference. Result has 286 places, 281 transitions, 574 flow [2024-10-11 17:16:51,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=286, PETRI_TRANSITIONS=281} [2024-10-11 17:16:51,077 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -77 predicate places. [2024-10-11 17:16:51,078 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 281 transitions, 574 flow [2024-10-11 17:16:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:51,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:51,079 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] [2024-10-11 17:16:51,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:16:51,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 166269804, now seen corresponding path program 1 times [2024-10-11 17:16:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:51,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831562216] [2024-10-11 17:16:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:51,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:51,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831562216] [2024-10-11 17:16:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831562216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705414154] [2024-10-11 17:16:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:51,158 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 389 [2024-10-11 17:16:51,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 281 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:51,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:51,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 389 [2024-10-11 17:16:51,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:51,599 INFO L124 PetriNetUnfolderBase]: 745/1657 cut-off events. [2024-10-11 17:16:51,600 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 17:16:51,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 1657 events. 745/1657 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8721 event pairs, 485 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2701. Up to 1008 conditions per place. [2024-10-11 17:16:51,610 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 26 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-10-11 17:16:51,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 280 transitions, 628 flow [2024-10-11 17:16:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2024-10-11 17:16:51,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7343616109682948 [2024-10-11 17:16:51,613 INFO L175 Difference]: Start difference. First operand has 286 places, 281 transitions, 574 flow. Second operand 3 states and 857 transitions. [2024-10-11 17:16:51,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 280 transitions, 628 flow [2024-10-11 17:16:51,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 280 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:51,618 INFO L231 Difference]: Finished difference. Result has 280 places, 280 transitions, 572 flow [2024-10-11 17:16:51,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=280, PETRI_TRANSITIONS=280} [2024-10-11 17:16:51,620 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -83 predicate places. [2024-10-11 17:16:51,620 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 280 transitions, 572 flow [2024-10-11 17:16:51,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:51,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:51,621 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] [2024-10-11 17:16:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:16:51,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:51,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1821314773, now seen corresponding path program 1 times [2024-10-11 17:16:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201797217] [2024-10-11 17:16:51,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:51,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201797217] [2024-10-11 17:16:51,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201797217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:51,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:51,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:51,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840277448] [2024-10-11 17:16:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:51,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:51,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:51,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 389 [2024-10-11 17:16:51,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 280 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:51,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:51,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 389 [2024-10-11 17:16:51,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:52,008 INFO L124 PetriNetUnfolderBase]: 745/1656 cut-off events. [2024-10-11 17:16:52,008 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 17:16:52,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 1656 events. 745/1656 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8743 event pairs, 485 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2692. Up to 1008 conditions per place. [2024-10-11 17:16:52,018 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 26 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-11 17:16:52,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 279 transitions, 626 flow [2024-10-11 17:16:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:52,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2024-10-11 17:16:52,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7343616109682948 [2024-10-11 17:16:52,021 INFO L175 Difference]: Start difference. First operand has 280 places, 280 transitions, 572 flow. Second operand 3 states and 857 transitions. [2024-10-11 17:16:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 279 transitions, 626 flow [2024-10-11 17:16:52,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 279 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:52,025 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 570 flow [2024-10-11 17:16:52,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2024-10-11 17:16:52,026 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -84 predicate places. [2024-10-11 17:16:52,026 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 570 flow [2024-10-11 17:16:52,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:52,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:52,027 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] [2024-10-11 17:16:52,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:16:52,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:52,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:52,027 INFO L85 PathProgramCache]: Analyzing trace with hash -850935002, now seen corresponding path program 1 times [2024-10-11 17:16:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627582196] [2024-10-11 17:16:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:52,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:52,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627582196] [2024-10-11 17:16:52,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627582196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:52,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:52,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:52,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879692757] [2024-10-11 17:16:52,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:52,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:52,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:52,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:52,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:52,092 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 389 [2024-10-11 17:16:52,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:52,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:52,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 389 [2024-10-11 17:16:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:52,336 INFO L124 PetriNetUnfolderBase]: 745/1655 cut-off events. [2024-10-11 17:16:52,336 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 17:16:52,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 1655 events. 745/1655 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8755 event pairs, 485 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2683. Up to 1008 conditions per place. [2024-10-11 17:16:52,344 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 26 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-10-11 17:16:52,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 278 transitions, 624 flow [2024-10-11 17:16:52,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2024-10-11 17:16:52,347 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7343616109682948 [2024-10-11 17:16:52,347 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 570 flow. Second operand 3 states and 857 transitions. [2024-10-11 17:16:52,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 278 transitions, 624 flow [2024-10-11 17:16:52,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 278 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:52,350 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 568 flow [2024-10-11 17:16:52,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=278, PETRI_TRANSITIONS=278} [2024-10-11 17:16:52,353 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -85 predicate places. [2024-10-11 17:16:52,353 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 568 flow [2024-10-11 17:16:52,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:52,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:52,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:52,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:16:52,354 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:52,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:52,355 INFO L85 PathProgramCache]: Analyzing trace with hash 248868350, now seen corresponding path program 1 times [2024-10-11 17:16:52,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833763814] [2024-10-11 17:16:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:52,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833763814] [2024-10-11 17:16:52,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833763814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:52,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:52,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127925266] [2024-10-11 17:16:52,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:52,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:52,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:52,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 389 [2024-10-11 17:16:52,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:52,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:52,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 389 [2024-10-11 17:16:52,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:52,675 INFO L124 PetriNetUnfolderBase]: 745/1654 cut-off events. [2024-10-11 17:16:52,676 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 17:16:52,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1654 events. 745/1654 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8738 event pairs, 485 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 2674. Up to 1008 conditions per place. [2024-10-11 17:16:52,685 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 26 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-10-11 17:16:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 277 transitions, 622 flow [2024-10-11 17:16:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2024-10-11 17:16:52,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7343616109682948 [2024-10-11 17:16:52,688 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 568 flow. Second operand 3 states and 857 transitions. [2024-10-11 17:16:52,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 277 transitions, 622 flow [2024-10-11 17:16:52,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 277 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:52,691 INFO L231 Difference]: Finished difference. Result has 277 places, 277 transitions, 566 flow [2024-10-11 17:16:52,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=277, PETRI_TRANSITIONS=277} [2024-10-11 17:16:52,693 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -86 predicate places. [2024-10-11 17:16:52,694 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 277 transitions, 566 flow [2024-10-11 17:16:52,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:52,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:52,695 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] [2024-10-11 17:16:52,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:16:52,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1380399027, now seen corresponding path program 1 times [2024-10-11 17:16:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:52,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176498991] [2024-10-11 17:16:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:52,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:52,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176498991] [2024-10-11 17:16:52,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176498991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:52,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:52,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:52,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842121378] [2024-10-11 17:16:52,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:52,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:52,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:52,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:52,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:52,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 389 [2024-10-11 17:16:52,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 277 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:52,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:52,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 389 [2024-10-11 17:16:52,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:53,135 INFO L124 PetriNetUnfolderBase]: 982/2271 cut-off events. [2024-10-11 17:16:53,136 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-10-11 17:16:53,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 2271 events. 982/2271 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13970 event pairs, 307 based on Foata normal form. 0/2050 useless extension candidates. Maximal degree in co-relation 3616. Up to 714 conditions per place. [2024-10-11 17:16:53,150 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 40 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-10-11 17:16:53,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 293 transitions, 687 flow [2024-10-11 17:16:53,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 883 transitions. [2024-10-11 17:16:53,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7566409597257926 [2024-10-11 17:16:53,154 INFO L175 Difference]: Start difference. First operand has 277 places, 277 transitions, 566 flow. Second operand 3 states and 883 transitions. [2024-10-11 17:16:53,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 293 transitions, 687 flow [2024-10-11 17:16:53,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 293 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:53,159 INFO L231 Difference]: Finished difference. Result has 277 places, 277 transitions, 570 flow [2024-10-11 17:16:53,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=277} [2024-10-11 17:16:53,160 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -86 predicate places. [2024-10-11 17:16:53,160 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 277 transitions, 570 flow [2024-10-11 17:16:53,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:53,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:53,161 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] [2024-10-11 17:16:53,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:16:53,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:53,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash 464341744, now seen corresponding path program 1 times [2024-10-11 17:16:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5906317] [2024-10-11 17:16:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:53,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:53,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5906317] [2024-10-11 17:16:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5906317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:53,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:53,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:53,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962638668] [2024-10-11 17:16:53,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:53,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:53,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:53,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:53,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 389 [2024-10-11 17:16:53,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 277 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:53,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:53,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 389 [2024-10-11 17:16:53,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:53,580 INFO L124 PetriNetUnfolderBase]: 982/2290 cut-off events. [2024-10-11 17:16:53,581 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2024-10-11 17:16:53,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 2290 events. 982/2290 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14438 event pairs, 665 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 2132. Up to 1327 conditions per place. [2024-10-11 17:16:53,594 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 26 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-10-11 17:16:53,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 276 transitions, 624 flow [2024-10-11 17:16:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-10-11 17:16:53,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7360754070265638 [2024-10-11 17:16:53,597 INFO L175 Difference]: Start difference. First operand has 277 places, 277 transitions, 570 flow. Second operand 3 states and 859 transitions. [2024-10-11 17:16:53,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 276 transitions, 624 flow [2024-10-11 17:16:53,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 276 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:53,604 INFO L231 Difference]: Finished difference. Result has 277 places, 276 transitions, 570 flow [2024-10-11 17:16:53,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=276} [2024-10-11 17:16:53,605 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -86 predicate places. [2024-10-11 17:16:53,606 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 276 transitions, 570 flow [2024-10-11 17:16:53,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:53,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:53,606 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] [2024-10-11 17:16:53,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:16:53,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:53,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 717998643, now seen corresponding path program 1 times [2024-10-11 17:16:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:53,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095575934] [2024-10-11 17:16:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095575934] [2024-10-11 17:16:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095575934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:53,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:53,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961428933] [2024-10-11 17:16:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:53,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:53,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:53,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:53,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 389 [2024-10-11 17:16:53,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 276 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:53,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:53,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 389 [2024-10-11 17:16:53,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:53,982 INFO L124 PetriNetUnfolderBase]: 982/2289 cut-off events. [2024-10-11 17:16:53,982 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2024-10-11 17:16:53,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3868 conditions, 2289 events. 982/2289 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14406 event pairs, 665 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 3788. Up to 1328 conditions per place. [2024-10-11 17:16:53,995 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 27 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2024-10-11 17:16:53,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 275 transitions, 626 flow [2024-10-11 17:16:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2024-10-11 17:16:53,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7343616109682948 [2024-10-11 17:16:53,998 INFO L175 Difference]: Start difference. First operand has 277 places, 276 transitions, 570 flow. Second operand 3 states and 857 transitions. [2024-10-11 17:16:53,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 275 transitions, 626 flow [2024-10-11 17:16:54,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 275 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:54,002 INFO L231 Difference]: Finished difference. Result has 276 places, 275 transitions, 568 flow [2024-10-11 17:16:54,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=276, PETRI_TRANSITIONS=275} [2024-10-11 17:16:54,003 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2024-10-11 17:16:54,003 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 275 transitions, 568 flow [2024-10-11 17:16:54,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-10-11 17:16:54,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:54,004 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] [2024-10-11 17:16:54,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:16:54,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:54,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:54,005 INFO L85 PathProgramCache]: Analyzing trace with hash -236178411, now seen corresponding path program 1 times [2024-10-11 17:16:54,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:54,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971277701] [2024-10-11 17:16:54,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:54,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:54,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:54,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971277701] [2024-10-11 17:16:54,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971277701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:54,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:54,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:54,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386574906] [2024-10-11 17:16:54,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:54,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:54,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:54,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:54,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:54,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 389 [2024-10-11 17:16:54,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 275 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:54,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:54,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 389 [2024-10-11 17:16:54,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:54,431 INFO L124 PetriNetUnfolderBase]: 1232/2782 cut-off events. [2024-10-11 17:16:54,431 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2024-10-11 17:16:54,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 2782 events. 1232/2782 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 18022 event pairs, 472 based on Foata normal form. 0/2523 useless extension candidates. Maximal degree in co-relation 4650. Up to 903 conditions per place. [2024-10-11 17:16:54,450 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 41 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-10-11 17:16:54,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 291 transitions, 694 flow [2024-10-11 17:16:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2024-10-11 17:16:54,452 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7557840616966581 [2024-10-11 17:16:54,452 INFO L175 Difference]: Start difference. First operand has 276 places, 275 transitions, 568 flow. Second operand 3 states and 882 transitions. [2024-10-11 17:16:54,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 291 transitions, 694 flow [2024-10-11 17:16:54,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 291 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:54,457 INFO L231 Difference]: Finished difference. Result has 276 places, 275 transitions, 572 flow [2024-10-11 17:16:54,457 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=276, PETRI_TRANSITIONS=275} [2024-10-11 17:16:54,458 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2024-10-11 17:16:54,458 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 275 transitions, 572 flow [2024-10-11 17:16:54,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:54,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:54,459 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] [2024-10-11 17:16:54,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:16:54,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:54,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash -52014015, now seen corresponding path program 1 times [2024-10-11 17:16:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778027787] [2024-10-11 17:16:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778027787] [2024-10-11 17:16:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778027787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:54,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794198175] [2024-10-11 17:16:54,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:54,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:54,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 389 [2024-10-11 17:16:54,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 275 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:54,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:54,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 389 [2024-10-11 17:16:54,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:54,878 INFO L124 PetriNetUnfolderBase]: 1232/2973 cut-off events. [2024-10-11 17:16:54,878 INFO L125 PetriNetUnfolderBase]: For 463/463 co-relation queries the response was YES. [2024-10-11 17:16:54,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5189 conditions, 2973 events. 1232/2973 cut-off events. For 463/463 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20989 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 3076. Up to 1665 conditions per place. [2024-10-11 17:16:54,897 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 27 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2024-10-11 17:16:54,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 274 transitions, 628 flow [2024-10-11 17:16:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-10-11 17:16:54,899 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7360754070265638 [2024-10-11 17:16:54,899 INFO L175 Difference]: Start difference. First operand has 276 places, 275 transitions, 572 flow. Second operand 3 states and 859 transitions. [2024-10-11 17:16:54,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 274 transitions, 628 flow [2024-10-11 17:16:54,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 274 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:54,903 INFO L231 Difference]: Finished difference. Result has 276 places, 274 transitions, 572 flow [2024-10-11 17:16:54,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=276, PETRI_TRANSITIONS=274} [2024-10-11 17:16:54,904 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2024-10-11 17:16:54,904 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 274 transitions, 572 flow [2024-10-11 17:16:54,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:54,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:54,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] [2024-10-11 17:16:54,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:16:54,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:54,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 935550965, now seen corresponding path program 1 times [2024-10-11 17:16:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:54,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594659830] [2024-10-11 17:16:54,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594659830] [2024-10-11 17:16:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594659830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989609418] [2024-10-11 17:16:54,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:54,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:54,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:54,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:54,952 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 389 [2024-10-11 17:16:54,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 274 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:54,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:54,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 389 [2024-10-11 17:16:54,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:55,435 INFO L124 PetriNetUnfolderBase]: 1232/2972 cut-off events. [2024-10-11 17:16:55,435 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2024-10-11 17:16:55,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 2972 events. 1232/2972 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20998 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5005. Up to 1663 conditions per place. [2024-10-11 17:16:55,462 INFO L140 encePairwiseOnDemand]: 387/389 looper letters, 26 selfloop transitions, 1 changer transitions 0/273 dead transitions. [2024-10-11 17:16:55,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 273 transitions, 624 flow [2024-10-11 17:16:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:55,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-10-11 17:16:55,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7420736932305055 [2024-10-11 17:16:55,465 INFO L175 Difference]: Start difference. First operand has 276 places, 274 transitions, 572 flow. Second operand 3 states and 866 transitions. [2024-10-11 17:16:55,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 273 transitions, 624 flow [2024-10-11 17:16:55,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 273 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:55,469 INFO L231 Difference]: Finished difference. Result has 275 places, 273 transitions, 568 flow [2024-10-11 17:16:55,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=275, PETRI_TRANSITIONS=273} [2024-10-11 17:16:55,470 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -88 predicate places. [2024-10-11 17:16:55,471 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 273 transitions, 568 flow [2024-10-11 17:16:55,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:55,471 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:55,471 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] [2024-10-11 17:16:55,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:16:55,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1577547674, now seen corresponding path program 1 times [2024-10-11 17:16:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:55,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701482135] [2024-10-11 17:16:55,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:55,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701482135] [2024-10-11 17:16:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701482135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316091446] [2024-10-11 17:16:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:55,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:55,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:55,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 389 [2024-10-11 17:16:55,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 273 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:55,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:55,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 389 [2024-10-11 17:16:55,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:55,904 INFO L124 PetriNetUnfolderBase]: 1232/2971 cut-off events. [2024-10-11 17:16:55,904 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2024-10-11 17:16:55,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 2971 events. 1232/2971 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20994 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5005. Up to 1665 conditions per place. [2024-10-11 17:16:55,916 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 27 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-10-11 17:16:55,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 272 transitions, 624 flow [2024-10-11 17:16:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-10-11 17:16:55,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7360754070265638 [2024-10-11 17:16:55,918 INFO L175 Difference]: Start difference. First operand has 275 places, 273 transitions, 568 flow. Second operand 3 states and 859 transitions. [2024-10-11 17:16:55,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 272 transitions, 624 flow [2024-10-11 17:16:55,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 272 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:55,922 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 569 flow [2024-10-11 17:16:55,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2024-10-11 17:16:55,923 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -88 predicate places. [2024-10-11 17:16:55,923 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 569 flow [2024-10-11 17:16:55,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:55,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:55,924 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] [2024-10-11 17:16:55,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:16:55,924 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:55,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:55,925 INFO L85 PathProgramCache]: Analyzing trace with hash 760737058, now seen corresponding path program 1 times [2024-10-11 17:16:55,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:55,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018844373] [2024-10-11 17:16:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:56,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018844373] [2024-10-11 17:16:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018844373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:56,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:56,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969868618] [2024-10-11 17:16:56,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:56,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:56,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 389 [2024-10-11 17:16:56,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 569 flow. Second operand has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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-10-11 17:16:56,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:56,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 389 [2024-10-11 17:16:56,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:56,794 INFO L124 PetriNetUnfolderBase]: 1232/2969 cut-off events. [2024-10-11 17:16:56,794 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2024-10-11 17:16:56,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5123 conditions, 2969 events. 1232/2969 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21023 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5027. Up to 1678 conditions per place. [2024-10-11 17:16:56,807 INFO L140 encePairwiseOnDemand]: 377/389 looper letters, 40 selfloop transitions, 10 changer transitions 0/270 dead transitions. [2024-10-11 17:16:56,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 270 transitions, 665 flow [2024-10-11 17:16:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1586 transitions. [2024-10-11 17:16:56,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6795201371036846 [2024-10-11 17:16:56,810 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 569 flow. Second operand 6 states and 1586 transitions. [2024-10-11 17:16:56,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 270 transitions, 665 flow [2024-10-11 17:16:56,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 270 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:56,816 INFO L231 Difference]: Finished difference. Result has 276 places, 270 transitions, 581 flow [2024-10-11 17:16:56,816 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=581, PETRI_PLACES=276, PETRI_TRANSITIONS=270} [2024-10-11 17:16:56,817 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -87 predicate places. [2024-10-11 17:16:56,817 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 581 flow [2024-10-11 17:16:56,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.5) internal successors, (1545), 6 states have internal predecessors, (1545), 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-10-11 17:16:56,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:56,818 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] [2024-10-11 17:16:56,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:16:56,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:56,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1696252039, now seen corresponding path program 1 times [2024-10-11 17:16:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:56,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629588685] [2024-10-11 17:16:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:56,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629588685] [2024-10-11 17:16:56,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629588685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:56,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:56,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:56,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810891268] [2024-10-11 17:16:56,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:56,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:56,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:56,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:56,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 389 [2024-10-11 17:16:56,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:56,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:56,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 389 [2024-10-11 17:16:56,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:57,174 INFO L124 PetriNetUnfolderBase]: 1232/2968 cut-off events. [2024-10-11 17:16:57,174 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2024-10-11 17:16:57,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5107 conditions, 2968 events. 1232/2968 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 21022 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5072. Up to 1663 conditions per place. [2024-10-11 17:16:57,190 INFO L140 encePairwiseOnDemand]: 387/389 looper letters, 26 selfloop transitions, 1 changer transitions 0/269 dead transitions. [2024-10-11 17:16:57,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 269 transitions, 633 flow [2024-10-11 17:16:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-10-11 17:16:57,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7420736932305055 [2024-10-11 17:16:57,194 INFO L175 Difference]: Start difference. First operand has 276 places, 270 transitions, 581 flow. Second operand 3 states and 866 transitions. [2024-10-11 17:16:57,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 269 transitions, 633 flow [2024-10-11 17:16:57,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 269 transitions, 613 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:57,199 INFO L231 Difference]: Finished difference. Result has 272 places, 269 transitions, 561 flow [2024-10-11 17:16:57,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=561, PETRI_PLACES=272, PETRI_TRANSITIONS=269} [2024-10-11 17:16:57,200 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -91 predicate places. [2024-10-11 17:16:57,200 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 269 transitions, 561 flow [2024-10-11 17:16:57,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:57,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:57,201 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] [2024-10-11 17:16:57,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:16:57,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:57,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1745508123, now seen corresponding path program 1 times [2024-10-11 17:16:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:57,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696450572] [2024-10-11 17:16:57,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696450572] [2024-10-11 17:16:57,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696450572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:57,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:57,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418051285] [2024-10-11 17:16:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:57,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:57,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:57,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:57,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 389 [2024-10-11 17:16:57,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 269 transitions, 561 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:57,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:57,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 389 [2024-10-11 17:16:57,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:57,585 INFO L124 PetriNetUnfolderBase]: 1232/2967 cut-off events. [2024-10-11 17:16:57,585 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2024-10-11 17:16:57,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5099 conditions, 2967 events. 1232/2967 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20988 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5002. Up to 1665 conditions per place. [2024-10-11 17:16:57,603 INFO L140 encePairwiseOnDemand]: 386/389 looper letters, 27 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-10-11 17:16:57,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 268 transitions, 617 flow [2024-10-11 17:16:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-10-11 17:16:57,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7360754070265638 [2024-10-11 17:16:57,606 INFO L175 Difference]: Start difference. First operand has 272 places, 269 transitions, 561 flow. Second operand 3 states and 859 transitions. [2024-10-11 17:16:57,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 268 transitions, 617 flow [2024-10-11 17:16:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 268 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:57,609 INFO L231 Difference]: Finished difference. Result has 272 places, 268 transitions, 562 flow [2024-10-11 17:16:57,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=272, PETRI_TRANSITIONS=268} [2024-10-11 17:16:57,610 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -91 predicate places. [2024-10-11 17:16:57,610 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 268 transitions, 562 flow [2024-10-11 17:16:57,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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-10-11 17:16:57,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:57,611 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] [2024-10-11 17:16:57,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:16:57,611 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:57,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash 569893959, now seen corresponding path program 1 times [2024-10-11 17:16:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:57,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418353016] [2024-10-11 17:16:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:57,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418353016] [2024-10-11 17:16:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418353016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:57,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299337043] [2024-10-11 17:16:57,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:57,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:57,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:57,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 389 [2024-10-11 17:16:57,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 268 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:57,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:57,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 389 [2024-10-11 17:16:57,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:58,112 INFO L124 PetriNetUnfolderBase]: 1232/2966 cut-off events. [2024-10-11 17:16:58,113 INFO L125 PetriNetUnfolderBase]: For 462/462 co-relation queries the response was YES. [2024-10-11 17:16:58,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 2966 events. 1232/2966 cut-off events. For 462/462 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20960 event pairs, 858 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 5001. Up to 1663 conditions per place. [2024-10-11 17:16:58,131 INFO L140 encePairwiseOnDemand]: 387/389 looper letters, 26 selfloop transitions, 1 changer transitions 0/267 dead transitions. [2024-10-11 17:16:58,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 267 transitions, 614 flow [2024-10-11 17:16:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 866 transitions. [2024-10-11 17:16:58,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7420736932305055 [2024-10-11 17:16:58,134 INFO L175 Difference]: Start difference. First operand has 272 places, 268 transitions, 562 flow. Second operand 3 states and 866 transitions. [2024-10-11 17:16:58,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 267 transitions, 614 flow [2024-10-11 17:16:58,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 267 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:58,139 INFO L231 Difference]: Finished difference. Result has 271 places, 267 transitions, 558 flow [2024-10-11 17:16:58,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=271, PETRI_TRANSITIONS=267} [2024-10-11 17:16:58,139 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -92 predicate places. [2024-10-11 17:16:58,140 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 267 transitions, 558 flow [2024-10-11 17:16:58,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:58,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:58,141 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:58,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:16:58,142 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:58,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash -492561288, now seen corresponding path program 1 times [2024-10-11 17:16:58,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:58,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043811655] [2024-10-11 17:16:58,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:58,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:58,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043811655] [2024-10-11 17:16:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043811655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:58,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:58,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357897906] [2024-10-11 17:16:58,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:58,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:58,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:58,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:58,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 389 [2024-10-11 17:16:58,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 267 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:58,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:58,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 389 [2024-10-11 17:16:58,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:58,655 INFO L124 PetriNetUnfolderBase]: 1241/2990 cut-off events. [2024-10-11 17:16:58,656 INFO L125 PetriNetUnfolderBase]: For 464/464 co-relation queries the response was YES. [2024-10-11 17:16:58,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 2990 events. 1241/2990 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20508 event pairs, 675 based on Foata normal form. 0/2699 useless extension candidates. Maximal degree in co-relation 5042. Up to 1673 conditions per place. [2024-10-11 17:16:58,673 INFO L140 encePairwiseOnDemand]: 383/389 looper letters, 30 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2024-10-11 17:16:58,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 274 transitions, 646 flow [2024-10-11 17:16:58,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2024-10-11 17:16:58,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7489288774635818 [2024-10-11 17:16:58,675 INFO L175 Difference]: Start difference. First operand has 271 places, 267 transitions, 558 flow. Second operand 3 states and 874 transitions. [2024-10-11 17:16:58,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 274 transitions, 646 flow [2024-10-11 17:16:58,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 274 transitions, 645 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:58,679 INFO L231 Difference]: Finished difference. Result has 272 places, 270 transitions, 586 flow [2024-10-11 17:16:58,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=272, PETRI_TRANSITIONS=270} [2024-10-11 17:16:58,680 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -91 predicate places. [2024-10-11 17:16:58,680 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 270 transitions, 586 flow [2024-10-11 17:16:58,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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-10-11 17:16:58,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:58,680 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-10-11 17:16:58,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:16:58,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2024-10-11 17:16:58,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:58,681 INFO L85 PathProgramCache]: Analyzing trace with hash -304549102, now seen corresponding path program 1 times [2024-10-11 17:16:58,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:58,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133148967] [2024-10-11 17:16:58,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:58,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:58,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133148967] [2024-10-11 17:16:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133148967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:58,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:58,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716040557] [2024-10-11 17:16:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:58,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:58,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:58,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 389 [2024-10-11 17:16:58,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 270 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-10-11 17:16:58,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:58,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 389 [2024-10-11 17:16:58,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:59,109 INFO L124 PetriNetUnfolderBase]: 1241/2986 cut-off events. [2024-10-11 17:16:59,109 INFO L125 PetriNetUnfolderBase]: For 727/727 co-relation queries the response was YES. [2024-10-11 17:16:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5529 conditions, 2986 events. 1241/2986 cut-off events. For 727/727 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20506 event pairs, 756 based on Foata normal form. 4/2696 useless extension candidates. Maximal degree in co-relation 5433. Up to 1676 conditions per place. [2024-10-11 17:16:59,118 INFO L140 encePairwiseOnDemand]: 387/389 looper letters, 0 selfloop transitions, 0 changer transitions 269/269 dead transitions. [2024-10-11 17:16:59,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 269 transitions, 642 flow [2024-10-11 17:16:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 867 transitions. [2024-10-11 17:16:59,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7429305912596401 [2024-10-11 17:16:59,122 INFO L175 Difference]: Start difference. First operand has 272 places, 270 transitions, 586 flow. Second operand 3 states and 867 transitions. [2024-10-11 17:16:59,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 269 transitions, 642 flow [2024-10-11 17:16:59,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 269 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:59,125 INFO L231 Difference]: Finished difference. Result has 273 places, 0 transitions, 0 flow [2024-10-11 17:16:59,125 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=389, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=273, PETRI_TRANSITIONS=0} [2024-10-11 17:16:59,125 INFO L277 CegarLoopForPetriNet]: 363 programPoint places, -90 predicate places. [2024-10-11 17:16:59,125 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 0 transitions, 0 flow [2024-10-11 17:16:59,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 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-10-11 17:16:59,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (162 of 163 remaining) [2024-10-11 17:16:59,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (161 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (160 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (159 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (158 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (157 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (156 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (155 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (154 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (153 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (152 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (151 of 163 remaining) [2024-10-11 17:16:59,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (150 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (149 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (148 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (147 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (146 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (145 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (144 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (143 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (142 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (141 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (140 of 163 remaining) [2024-10-11 17:16:59,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (139 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (138 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (137 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (136 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (135 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (134 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (133 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (132 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (131 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (130 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (129 of 163 remaining) [2024-10-11 17:16:59,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (128 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (127 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (126 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (125 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (124 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (123 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (122 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (121 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (120 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (119 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (118 of 163 remaining) [2024-10-11 17:16:59,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (117 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (116 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (115 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (114 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (113 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (112 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (111 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (110 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (109 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (108 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (107 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (106 of 163 remaining) [2024-10-11 17:16:59,133 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (105 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (104 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (103 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (102 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (101 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (100 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (99 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (98 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (97 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (96 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (95 of 163 remaining) [2024-10-11 17:16:59,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (94 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 163 remaining) [2024-10-11 17:16:59,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 163 remaining) [2024-10-11 17:16:59,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 163 remaining) [2024-10-11 17:16:59,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 163 remaining) [2024-10-11 17:16:59,138 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 163 remaining) [2024-10-11 17:16:59,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 163 remaining) [2024-10-11 17:16:59,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 163 remaining) [2024-10-11 17:16:59,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 163 remaining) [2024-10-11 17:16:59,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 163 remaining) [2024-10-11 17:16:59,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:16:59,142 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:59,148 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:16:59,148 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:16:59,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:16:59 BasicIcfg [2024-10-11 17:16:59,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:16:59,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:16:59,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:16:59,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:16:59,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:49" (3/4) ... [2024-10-11 17:16:59,159 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:16:59,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:16:59,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:16:59,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:16:59,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-11 17:16:59,166 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-11 17:16:59,167 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:16:59,167 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-11 17:16:59,167 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:16:59,253 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:16:59,254 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:16:59,254 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:16:59,254 INFO L158 Benchmark]: Toolchain (without parser) took 11178.45ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 137.7MB in the beginning and 892.3MB in the end (delta: -754.6MB). Peak memory consumption was 283.0MB. Max. memory is 16.1GB. [2024-10-11 17:16:59,255 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:16:59,255 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.69ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 125.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-11 17:16:59,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.79ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 121.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:59,255 INFO L158 Benchmark]: Boogie Preprocessor took 49.29ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 118.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:59,255 INFO L158 Benchmark]: RCFGBuilder took 1476.03ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 118.6MB in the beginning and 133.3MB in the end (delta: -14.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2024-10-11 17:16:59,256 INFO L158 Benchmark]: TraceAbstraction took 9194.18ms. Allocated memory was 228.6MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 132.3MB in the beginning and 899.7MB in the end (delta: -767.4MB). Peak memory consumption was 713.8MB. Max. memory is 16.1GB. [2024-10-11 17:16:59,256 INFO L158 Benchmark]: Witness Printer took 96.64ms. Allocated memory is still 1.2GB. Free memory was 899.7MB in the beginning and 892.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 17:16:59,257 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.14ms. Allocated memory is still 132.1MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.69ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 125.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.79ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 121.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.29ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 118.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1476.03ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 118.6MB in the beginning and 133.3MB in the end (delta: -14.7MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9194.18ms. Allocated memory was 228.6MB in the beginning and 1.2GB in the end (delta: 977.3MB). Free memory was 132.3MB in the beginning and 899.7MB in the end (delta: -767.4MB). Peak memory consumption was 713.8MB. Max. memory is 16.1GB. * Witness Printer took 96.64ms. Allocated memory is still 1.2GB. Free memory was 899.7MB in the beginning and 892.3MB in the end (delta: 7.3MB). 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 95]: 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: 95]: 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: 96]: 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: 96]: 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: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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 9 procedures, 479 locations, 163 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: 9.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1047 IncrementalHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 37 mSDtfsCounter, 1047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=760occurred in iteration=0, InterpolantAutomatonStates: 57, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:16:59,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE