./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-match-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/weaver/chl-match-symm.wvr.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:42:07,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:42:08,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-07 15:42:08,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:42:08,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:42:08,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:42:08,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:42:08,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:42:08,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:42:08,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:42:08,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:42:08,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:42:08,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:42:08,057 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:42:08,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:42:08,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:42:08,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:42:08,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:42:08,058 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:42:08,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:42:08,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:42:08,059 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f [2024-11-07 15:42:08,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:42:08,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:42:08,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:42:08,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:42:08,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:42:08,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-11-07 15:42:09,534 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:42:09,834 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:42:09,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-11-07 15:42:09,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f91aa4fb7/a1b586aa518b4b30bb1ba486a590f46d/FLAGd3db73440 [2024-11-07 15:42:10,131 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f91aa4fb7/a1b586aa518b4b30bb1ba486a590f46d [2024-11-07 15:42:10,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:42:10,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:42:10,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:42:10,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:42:10,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:42:10,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26257619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10, skipping insertion in model container [2024-11-07 15:42:10,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:42:10,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:42:10,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:42:10,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:42:10,387 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:42:10,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10 WrapperNode [2024-11-07 15:42:10,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:42:10,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:42:10,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:42:10,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:42:10,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,421 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 241 [2024-11-07 15:42:10,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:42:10,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:42:10,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:42:10,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:42:10,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:42:10,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:42:10,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:42:10,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:42:10,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (1/1) ... [2024-11-07 15:42:10,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:42:10,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:42:10,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 15:42:10,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 15:42:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:42:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:42:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:42:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:42:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:42:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:42:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:42:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:42:10,515 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-07 15:42:10,608 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:42:10,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:42:10,961 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:42:10,962 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:42:10,978 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:42:10,979 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-07 15:42:10,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:42:10 BoogieIcfgContainer [2024-11-07 15:42:10,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:42:10,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:42:10,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:42:10,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:42:10,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:42:10" (1/3) ... [2024-11-07 15:42:10,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523150c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:42:10, skipping insertion in model container [2024-11-07 15:42:10,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:42:10" (2/3) ... [2024-11-07 15:42:10,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523150c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:42:10, skipping insertion in model container [2024-11-07 15:42:10,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:42:10" (3/3) ... [2024-11-07 15:42:10,997 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2024-11-07 15:42:11,017 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:42:11,017 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-07 15:42:11,017 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:42:11,094 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:42:11,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 341 transitions, 696 flow [2024-11-07 15:42:11,262 INFO L124 PetriNetUnfolderBase]: 16/339 cut-off events. [2024-11-07 15:42:11,264 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:42:11,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 339 events. 16/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2024-11-07 15:42:11,271 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 341 transitions, 696 flow [2024-11-07 15:42:11,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 319 transitions, 650 flow [2024-11-07 15:42:11,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:42:11,298 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;@79eaaadc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:42:11,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-07 15:42:11,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:42:11,306 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-07 15:42:11,306 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:42:11,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:11,306 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] [2024-11-07 15:42:11,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1891127115, now seen corresponding path program 1 times [2024-11-07 15:42:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:11,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006257038] [2024-11-07 15:42:11,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:11,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006257038] [2024-11-07 15:42:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006257038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:11,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:11,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557854630] [2024-11-07 15:42:11,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:11,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:11,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:11,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:11,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-11-07 15:42:11,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 319 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:11,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:11,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-11-07 15:42:11,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:11,625 INFO L124 PetriNetUnfolderBase]: 14/504 cut-off events. [2024-11-07 15:42:11,626 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-11-07 15:42:11,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 504 events. 14/504 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1208 event pairs, 8 based on Foata normal form. 27/459 useless extension candidates. Maximal degree in co-relation 403. Up to 28 conditions per place. [2024-11-07 15:42:11,630 INFO L140 encePairwiseOnDemand]: 328/341 looper letters, 11 selfloop transitions, 2 changer transitions 2/308 dead transitions. [2024-11-07 15:42:11,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 654 flow [2024-11-07 15:42:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2024-11-07 15:42:11,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442815249266863 [2024-11-07 15:42:11,647 INFO L175 Difference]: Start difference. First operand has 312 places, 319 transitions, 650 flow. Second operand 3 states and 966 transitions. [2024-11-07 15:42:11,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 654 flow [2024-11-07 15:42:11,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 646 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 15:42:11,661 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 620 flow [2024-11-07 15:42:11,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2024-11-07 15:42:11,667 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -3 predicate places. [2024-11-07 15:42:11,667 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 620 flow [2024-11-07 15:42:11,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:11,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:11,667 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] [2024-11-07 15:42:11,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:42:11,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:11,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash 79721871, now seen corresponding path program 1 times [2024-11-07 15:42:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:11,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375799901] [2024-11-07 15:42:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:11,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375799901] [2024-11-07 15:42:11,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375799901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:11,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:11,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:11,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110728974] [2024-11-07 15:42:11,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:11,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:11,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:11,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:11,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-11-07 15:42:11,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:11,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:11,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-11-07 15:42:11,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:11,809 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-11-07 15:42:11,809 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:42:11,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1133 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 480. Up to 16 conditions per place. [2024-11-07 15:42:11,812 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-11-07 15:42:11,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 305 transitions, 640 flow [2024-11-07 15:42:11,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-07 15:42:11,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-11-07 15:42:11,815 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 620 flow. Second operand 3 states and 960 transitions. [2024-11-07 15:42:11,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 305 transitions, 640 flow [2024-11-07 15:42:11,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:11,821 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 618 flow [2024-11-07 15:42:11,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2024-11-07 15:42:11,822 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -6 predicate places. [2024-11-07 15:42:11,822 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 618 flow [2024-11-07 15:42:11,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:11,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:11,822 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] [2024-11-07 15:42:11,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:42:11,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:11,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash 812410856, now seen corresponding path program 1 times [2024-11-07 15:42:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:11,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353196848] [2024-11-07 15:42:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:11,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353196848] [2024-11-07 15:42:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353196848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:11,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:11,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674979680] [2024-11-07 15:42:11,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:11,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:11,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:11,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:11,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:11,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-11-07 15:42:11,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:11,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:11,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-11-07 15:42:11,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:11,960 INFO L124 PetriNetUnfolderBase]: 9/480 cut-off events. [2024-11-07 15:42:11,960 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:42:11,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 480 events. 9/480 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1094 event pairs, 3 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 465. Up to 16 conditions per place. [2024-11-07 15:42:11,963 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-11-07 15:42:11,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 304 transitions, 638 flow [2024-11-07 15:42:11,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-07 15:42:11,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-11-07 15:42:11,966 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 618 flow. Second operand 3 states and 960 transitions. [2024-11-07 15:42:11,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 304 transitions, 638 flow [2024-11-07 15:42:11,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 304 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:11,971 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 616 flow [2024-11-07 15:42:11,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=305, PETRI_TRANSITIONS=304} [2024-11-07 15:42:11,972 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -7 predicate places. [2024-11-07 15:42:11,972 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 616 flow [2024-11-07 15:42:11,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:11,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:11,973 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] [2024-11-07 15:42:11,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:42:11,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:11,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2039657065, now seen corresponding path program 1 times [2024-11-07 15:42:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:11,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74232509] [2024-11-07 15:42:11,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74232509] [2024-11-07 15:42:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74232509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:12,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:12,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146455572] [2024-11-07 15:42:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:12,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:12,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-11-07 15:42:12,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:12,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-11-07 15:42:12,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:12,147 INFO L124 PetriNetUnfolderBase]: 14/499 cut-off events. [2024-11-07 15:42:12,147 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-07 15:42:12,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 499 events. 14/499 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1212 event pairs, 8 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 489. Up to 28 conditions per place. [2024-11-07 15:42:12,150 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 11 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2024-11-07 15:42:12,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 640 flow [2024-11-07 15:42:12,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-11-07 15:42:12,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-11-07 15:42:12,156 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 616 flow. Second operand 3 states and 956 transitions. [2024-11-07 15:42:12,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 303 transitions, 640 flow [2024-11-07 15:42:12,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 303 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:12,159 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 614 flow [2024-11-07 15:42:12,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2024-11-07 15:42:12,160 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-11-07 15:42:12,160 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 614 flow [2024-11-07 15:42:12,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:12,160 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] [2024-11-07 15:42:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:42:12,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:12,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1460679319, now seen corresponding path program 1 times [2024-11-07 15:42:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:12,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569914255] [2024-11-07 15:42:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:12,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:12,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569914255] [2024-11-07 15:42:12,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569914255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:12,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:12,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:12,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604552026] [2024-11-07 15:42:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:12,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:12,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-11-07 15:42:12,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:12,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-11-07 15:42:12,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:12,272 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-11-07 15:42:12,272 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-07 15:42:12,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 790 event pairs, 3 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 456. Up to 16 conditions per place. [2024-11-07 15:42:12,275 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-07 15:42:12,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 302 transitions, 634 flow [2024-11-07 15:42:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-07 15:42:12,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-11-07 15:42:12,278 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 614 flow. Second operand 3 states and 960 transitions. [2024-11-07 15:42:12,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 302 transitions, 634 flow [2024-11-07 15:42:12,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:12,282 INFO L231 Difference]: Finished difference. Result has 303 places, 302 transitions, 612 flow [2024-11-07 15:42:12,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=303, PETRI_TRANSITIONS=302} [2024-11-07 15:42:12,283 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-11-07 15:42:12,283 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 302 transitions, 612 flow [2024-11-07 15:42:12,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:12,284 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:42:12,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:42:12,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:12,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash -725008606, now seen corresponding path program 1 times [2024-11-07 15:42:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480148830] [2024-11-07 15:42:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:12,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:12,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:12,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480148830] [2024-11-07 15:42:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480148830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608397991] [2024-11-07 15:42:12,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:12,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:12,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:12,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:12,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:12,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-11-07 15:42:12,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:12,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-11-07 15:42:12,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:12,419 INFO L124 PetriNetUnfolderBase]: 9/483 cut-off events. [2024-11-07 15:42:12,419 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-07 15:42:12,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 483 events. 9/483 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 777 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 444. Up to 16 conditions per place. [2024-11-07 15:42:12,421 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2024-11-07 15:42:12,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 632 flow [2024-11-07 15:42:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-07 15:42:12,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-11-07 15:42:12,423 INFO L175 Difference]: Start difference. First operand has 303 places, 302 transitions, 612 flow. Second operand 3 states and 960 transitions. [2024-11-07 15:42:12,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 632 flow [2024-11-07 15:42:12,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:12,426 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 610 flow [2024-11-07 15:42:12,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-11-07 15:42:12,427 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-11-07 15:42:12,427 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 610 flow [2024-11-07 15:42:12,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:12,427 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:42:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:42:12,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash -808007066, now seen corresponding path program 1 times [2024-11-07 15:42:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556452291] [2024-11-07 15:42:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556452291] [2024-11-07 15:42:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556452291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795853575] [2024-11-07 15:42:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:12,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-11-07 15:42:12,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:12,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-11-07 15:42:12,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:12,533 INFO L124 PetriNetUnfolderBase]: 17/649 cut-off events. [2024-11-07 15:42:12,534 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:42:12,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 649 events. 17/649 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1959 event pairs, 4 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 611. Up to 22 conditions per place. [2024-11-07 15:42:12,536 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-07 15:42:12,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 637 flow [2024-11-07 15:42:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-11-07 15:42:12,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-11-07 15:42:12,538 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 610 flow. Second operand 3 states and 968 transitions. [2024-11-07 15:42:12,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 637 flow [2024-11-07 15:42:12,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:12,542 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 616 flow [2024-11-07 15:42:12,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2024-11-07 15:42:12,543 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -11 predicate places. [2024-11-07 15:42:12,543 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 616 flow [2024-11-07 15:42:12,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:12,544 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] [2024-11-07 15:42:12,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:42:12,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:12,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash 894315208, now seen corresponding path program 1 times [2024-11-07 15:42:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:12,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276008078] [2024-11-07 15:42:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276008078] [2024-11-07 15:42:12,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276008078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:12,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:12,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:12,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599137582] [2024-11-07 15:42:12,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:12,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:12,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:12,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:12,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:12,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-11-07 15:42:12,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:12,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-11-07 15:42:12,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:12,695 INFO L124 PetriNetUnfolderBase]: 19/725 cut-off events. [2024-11-07 15:42:12,699 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:42:12,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 725 events. 19/725 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2490 event pairs, 5 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 625. Up to 24 conditions per place. [2024-11-07 15:42:12,707 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-07 15:42:12,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 643 flow [2024-11-07 15:42:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-11-07 15:42:12,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-11-07 15:42:12,709 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 616 flow. Second operand 3 states and 968 transitions. [2024-11-07 15:42:12,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 643 flow [2024-11-07 15:42:12,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 643 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:12,716 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 626 flow [2024-11-07 15:42:12,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-11-07 15:42:12,718 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-11-07 15:42:12,721 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 626 flow [2024-11-07 15:42:12,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:12,722 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] [2024-11-07 15:42:12,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:42:12,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1671683357, now seen corresponding path program 1 times [2024-11-07 15:42:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396310935] [2024-11-07 15:42:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396310935] [2024-11-07 15:42:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396310935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:12,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262918217] [2024-11-07 15:42:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:12,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-11-07 15:42:12,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:12,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-11-07 15:42:12,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:12,863 INFO L124 PetriNetUnfolderBase]: 20/667 cut-off events. [2024-11-07 15:42:12,863 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-07 15:42:12,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 667 events. 20/667 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2599 event pairs, 3 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 574. Up to 22 conditions per place. [2024-11-07 15:42:12,866 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-07 15:42:12,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 653 flow [2024-11-07 15:42:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-11-07 15:42:12,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-11-07 15:42:12,868 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 626 flow. Second operand 3 states and 968 transitions. [2024-11-07 15:42:12,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 653 flow [2024-11-07 15:42:12,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:12,873 INFO L231 Difference]: Finished difference. Result has 303 places, 301 transitions, 636 flow [2024-11-07 15:42:12,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=303, PETRI_TRANSITIONS=301} [2024-11-07 15:42:12,874 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-11-07 15:42:12,874 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 301 transitions, 636 flow [2024-11-07 15:42:12,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:12,875 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] [2024-11-07 15:42:12,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:42:12,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:12,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash 169965439, now seen corresponding path program 1 times [2024-11-07 15:42:12,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:12,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881888413] [2024-11-07 15:42:12,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:12,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:12,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:12,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881888413] [2024-11-07 15:42:12,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881888413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:12,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:12,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910359857] [2024-11-07 15:42:12,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:12,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:12,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:12,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:12,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-11-07 15:42:12,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 301 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:12,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:12,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-11-07 15:42:12,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:12,990 INFO L124 PetriNetUnfolderBase]: 22/710 cut-off events. [2024-11-07 15:42:12,990 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-11-07 15:42:12,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 710 events. 22/710 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2979 event pairs, 3 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 626. Up to 25 conditions per place. [2024-11-07 15:42:12,996 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-07 15:42:12,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 663 flow [2024-11-07 15:42:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:12,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-11-07 15:42:12,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-11-07 15:42:12,999 INFO L175 Difference]: Start difference. First operand has 303 places, 301 transitions, 636 flow. Second operand 3 states and 968 transitions. [2024-11-07 15:42:12,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 663 flow [2024-11-07 15:42:13,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:13,023 INFO L231 Difference]: Finished difference. Result has 304 places, 301 transitions, 646 flow [2024-11-07 15:42:13,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=301} [2024-11-07 15:42:13,025 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-11-07 15:42:13,025 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 301 transitions, 646 flow [2024-11-07 15:42:13,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,026 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] [2024-11-07 15:42:13,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:42:13,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1498151222, now seen corresponding path program 1 times [2024-11-07 15:42:13,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373449762] [2024-11-07 15:42:13,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373449762] [2024-11-07 15:42:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373449762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217427182] [2024-11-07 15:42:13,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-11-07 15:42:13,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 301 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-11-07 15:42:13,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,137 INFO L124 PetriNetUnfolderBase]: 43/669 cut-off events. [2024-11-07 15:42:13,137 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-07 15:42:13,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 669 events. 43/669 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2597 event pairs, 16 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 642. Up to 76 conditions per place. [2024-11-07 15:42:13,140 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-11-07 15:42:13,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 677 flow [2024-11-07 15:42:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-11-07 15:42:13,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-11-07 15:42:13,143 INFO L175 Difference]: Start difference. First operand has 304 places, 301 transitions, 646 flow. Second operand 3 states and 956 transitions. [2024-11-07 15:42:13,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 677 flow [2024-11-07 15:42:13,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 300 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:13,146 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 652 flow [2024-11-07 15:42:13,147 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2024-11-07 15:42:13,147 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-11-07 15:42:13,147 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 652 flow [2024-11-07 15:42:13,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,148 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] [2024-11-07 15:42:13,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:42:13,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -909252948, now seen corresponding path program 1 times [2024-11-07 15:42:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093813413] [2024-11-07 15:42:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:13,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093813413] [2024-11-07 15:42:13,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093813413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097129719] [2024-11-07 15:42:13,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-11-07 15:42:13,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-11-07 15:42:13,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,279 INFO L124 PetriNetUnfolderBase]: 47/692 cut-off events. [2024-11-07 15:42:13,279 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-07 15:42:13,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 692 events. 47/692 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2669 event pairs, 16 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 688. Up to 81 conditions per place. [2024-11-07 15:42:13,283 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-11-07 15:42:13,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 298 transitions, 683 flow [2024-11-07 15:42:13,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-11-07 15:42:13,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-11-07 15:42:13,285 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 652 flow. Second operand 3 states and 956 transitions. [2024-11-07 15:42:13,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 298 transitions, 683 flow [2024-11-07 15:42:13,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:13,288 INFO L231 Difference]: Finished difference. Result has 302 places, 297 transitions, 658 flow [2024-11-07 15:42:13,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=297} [2024-11-07 15:42:13,289 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-11-07 15:42:13,289 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 658 flow [2024-11-07 15:42:13,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,290 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,290 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] [2024-11-07 15:42:13,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:42:13,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1040875051, now seen corresponding path program 1 times [2024-11-07 15:42:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560592613] [2024-11-07 15:42:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:13,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560592613] [2024-11-07 15:42:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560592613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795509271] [2024-11-07 15:42:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-11-07 15:42:13,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-11-07 15:42:13,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,409 INFO L124 PetriNetUnfolderBase]: 21/545 cut-off events. [2024-11-07 15:42:13,410 INFO L125 PetriNetUnfolderBase]: For 4/9 co-relation queries the response was YES. [2024-11-07 15:42:13,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 545 events. 21/545 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1772 event pairs, 2 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 501. Up to 20 conditions per place. [2024-11-07 15:42:13,412 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-11-07 15:42:13,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 297 transitions, 683 flow [2024-11-07 15:42:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-11-07 15:42:13,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-11-07 15:42:13,415 INFO L175 Difference]: Start difference. First operand has 302 places, 297 transitions, 658 flow. Second operand 3 states and 964 transitions. [2024-11-07 15:42:13,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 297 transitions, 683 flow [2024-11-07 15:42:13,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 297 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:42:13,418 INFO L231 Difference]: Finished difference. Result has 303 places, 296 transitions, 660 flow [2024-11-07 15:42:13,419 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=303, PETRI_TRANSITIONS=296} [2024-11-07 15:42:13,419 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-11-07 15:42:13,419 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 296 transitions, 660 flow [2024-11-07 15:42:13,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,420 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] [2024-11-07 15:42:13,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:42:13,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1343105908, now seen corresponding path program 1 times [2024-11-07 15:42:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486110114] [2024-11-07 15:42:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:13,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486110114] [2024-11-07 15:42:13,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486110114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982479223] [2024-11-07 15:42:13,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,474 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-11-07 15:42:13,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-11-07 15:42:13,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,523 INFO L124 PetriNetUnfolderBase]: 20/536 cut-off events. [2024-11-07 15:42:13,523 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-07 15:42:13,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 536 events. 20/536 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1670 event pairs, 2 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 543. Up to 24 conditions per place. [2024-11-07 15:42:13,525 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-11-07 15:42:13,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 685 flow [2024-11-07 15:42:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-11-07 15:42:13,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-11-07 15:42:13,527 INFO L175 Difference]: Start difference. First operand has 303 places, 296 transitions, 660 flow. Second operand 3 states and 964 transitions. [2024-11-07 15:42:13,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 685 flow [2024-11-07 15:42:13,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 296 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:13,531 INFO L231 Difference]: Finished difference. Result has 302 places, 295 transitions, 658 flow [2024-11-07 15:42:13,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=295} [2024-11-07 15:42:13,531 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-11-07 15:42:13,531 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 295 transitions, 658 flow [2024-11-07 15:42:13,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:42:13,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:42:13,532 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1721930605, now seen corresponding path program 1 times [2024-11-07 15:42:13,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895613626] [2024-11-07 15:42:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895613626] [2024-11-07 15:42:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895613626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:42:13,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909260978] [2024-11-07 15:42:13,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-11-07 15:42:13,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 295 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-11-07 15:42:13,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,685 INFO L124 PetriNetUnfolderBase]: 20/639 cut-off events. [2024-11-07 15:42:13,685 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-07 15:42:13,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 639 events. 20/639 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2203 event pairs, 3 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 620. Up to 25 conditions per place. [2024-11-07 15:42:13,688 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 13 selfloop transitions, 1 changer transitions 2/298 dead transitions. [2024-11-07 15:42:13,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 298 transitions, 695 flow [2024-11-07 15:42:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2024-11-07 15:42:13,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9472140762463344 [2024-11-07 15:42:13,689 INFO L175 Difference]: Start difference. First operand has 302 places, 295 transitions, 658 flow. Second operand 3 states and 969 transitions. [2024-11-07 15:42:13,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 298 transitions, 695 flow [2024-11-07 15:42:13,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 298 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:42:13,693 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 655 flow [2024-11-07 15:42:13,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2024-11-07 15:42:13,694 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-11-07 15:42:13,694 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 655 flow [2024-11-07 15:42:13,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:42:13,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:42:13,694 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,695 INFO L85 PathProgramCache]: Analyzing trace with hash 954116435, now seen corresponding path program 2 times [2024-11-07 15:42:13,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060907791] [2024-11-07 15:42:13,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060907791] [2024-11-07 15:42:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060907791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:42:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127035459] [2024-11-07 15:42:13,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-11-07 15:42:13,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-11-07 15:42:13,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,842 INFO L124 PetriNetUnfolderBase]: 18/719 cut-off events. [2024-11-07 15:42:13,842 INFO L125 PetriNetUnfolderBase]: For 33/37 co-relation queries the response was YES. [2024-11-07 15:42:13,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 719 events. 18/719 cut-off events. For 33/37 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2666 event pairs, 4 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 715. Up to 31 conditions per place. [2024-11-07 15:42:13,844 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 12 selfloop transitions, 1 changer transitions 2/295 dead transitions. [2024-11-07 15:42:13,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 687 flow [2024-11-07 15:42:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-11-07 15:42:13,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-11-07 15:42:13,846 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 655 flow. Second operand 3 states and 968 transitions. [2024-11-07 15:42:13,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 295 transitions, 687 flow [2024-11-07 15:42:13,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 295 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:42:13,849 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 655 flow [2024-11-07 15:42:13,850 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2024-11-07 15:42:13,850 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-11-07 15:42:13,850 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 655 flow [2024-11-07 15:42:13,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,851 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:42:13,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:42:13,851 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 169845892, now seen corresponding path program 1 times [2024-11-07 15:42:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792728031] [2024-11-07 15:42:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:13,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:13,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792728031] [2024-11-07 15:42:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792728031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:13,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935568370] [2024-11-07 15:42:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:13,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:13,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:13,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-11-07 15:42:13,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:13,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-11-07 15:42:13,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:13,978 INFO L124 PetriNetUnfolderBase]: 16/675 cut-off events. [2024-11-07 15:42:13,978 INFO L125 PetriNetUnfolderBase]: For 29/40 co-relation queries the response was YES. [2024-11-07 15:42:13,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 675 events. 16/675 cut-off events. For 29/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2453 event pairs, 2 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 687. Up to 22 conditions per place. [2024-11-07 15:42:13,981 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2024-11-07 15:42:13,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 671 flow [2024-11-07 15:42:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:13,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2024-11-07 15:42:13,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374389051808406 [2024-11-07 15:42:13,983 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 655 flow. Second operand 3 states and 959 transitions. [2024-11-07 15:42:13,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 671 flow [2024-11-07 15:42:13,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 288 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:42:13,986 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 650 flow [2024-11-07 15:42:13,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2024-11-07 15:42:13,986 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -13 predicate places. [2024-11-07 15:42:13,986 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 650 flow [2024-11-07 15:42:13,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:13,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:42:13,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:42:13,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:42:13,987 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-07 15:42:13,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:42:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1903255492, now seen corresponding path program 1 times [2024-11-07 15:42:13,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:42:13,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168435013] [2024-11-07 15:42:13,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:42:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:42:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:42:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:42:14,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:42:14,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168435013] [2024-11-07 15:42:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168435013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:42:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:42:14,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:42:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755826522] [2024-11-07 15:42:14,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:42:14,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:42:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:42:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:42:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:42:14,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-11-07 15:42:14,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:14,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:42:14,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-11-07 15:42:14,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:42:14,111 INFO L124 PetriNetUnfolderBase]: 18/740 cut-off events. [2024-11-07 15:42:14,111 INFO L125 PetriNetUnfolderBase]: For 18/21 co-relation queries the response was YES. [2024-11-07 15:42:14,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 740 events. 18/740 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2854 event pairs, 3 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 718. Up to 28 conditions per place. [2024-11-07 15:42:14,113 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2024-11-07 15:42:14,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 672 flow [2024-11-07 15:42:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:42:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:42:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-11-07 15:42:14,115 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-11-07 15:42:14,115 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 650 flow. Second operand 3 states and 960 transitions. [2024-11-07 15:42:14,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 672 flow [2024-11-07 15:42:14,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 287 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:42:14,117 INFO L231 Difference]: Finished difference. Result has 297 places, 0 transitions, 0 flow [2024-11-07 15:42:14,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=297, PETRI_TRANSITIONS=0} [2024-11-07 15:42:14,117 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -15 predicate places. [2024-11-07 15:42:14,118 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 0 transitions, 0 flow [2024-11-07 15:42:14,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-11-07 15:42:14,120 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-11-07 15:42:14,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-11-07 15:42:14,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-11-07 15:42:14,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-11-07 15:42:14,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-11-07 15:42:14,122 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-11-07 15:42:14,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:42:14,122 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:42:14,126 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:42:14,126 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:42:14,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:42:14 BasicIcfg [2024-11-07 15:42:14,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:42:14,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:42:14,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:42:14,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:42:14,131 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:42:10" (3/4) ... [2024-11-07 15:42:14,132 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:42:14,135 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:42:14,135 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:42:14,138 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-07 15:42:14,138 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 15:42:14,138 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:42:14,138 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:42:14,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:42:14,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:42:14,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:42:14,188 INFO L158 Benchmark]: Toolchain (without parser) took 4054.69ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 93.6MB in the beginning and 147.6MB in the end (delta: -54.0MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2024-11-07 15:42:14,189 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:42:14,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.40ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 81.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:42:14,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.19ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:42:14,189 INFO L158 Benchmark]: Boogie Preprocessor took 30.75ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:42:14,189 INFO L158 Benchmark]: RCFGBuilder took 521.78ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 55.3MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:42:14,189 INFO L158 Benchmark]: TraceAbstraction took 3142.26ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.8MB in the beginning and 152.5MB in the end (delta: -97.8MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-11-07 15:42:14,189 INFO L158 Benchmark]: Witness Printer took 57.12ms. Allocated memory is still 218.1MB. Free memory was 152.5MB in the beginning and 147.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:42:14,190 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.41ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.40ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 81.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.19ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.75ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 78.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 521.78ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 55.3MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3142.26ms. Allocated memory was 117.4MB in the beginning and 218.1MB in the end (delta: 100.7MB). Free memory was 54.8MB in the beginning and 152.5MB in the end (delta: -97.8MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Witness Printer took 57.12ms. Allocated memory is still 218.1MB. Free memory was 152.5MB in the beginning and 147.6MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 508 locations, 50 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: 3.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 125 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=13, InterpolantAutomatonStates: 54, 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.7s InterpolantComputationTime, 2020 NumberOfCodeBlocks, 2020 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2358 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 15:42:14,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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