./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i --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/pthread-race-challenges/thread-join-counter-outer-race-3.i', '-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', 'a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38'] 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/pthread-race-challenges/thread-join-counter-outer-race-3.i -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 a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:50:19,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:50:19,215 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:50:19,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:50:19,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:50:19,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:50:19,244 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:50:19,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:50:19,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:50:19,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:50:19,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:50:19,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:50:19,246 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:50:19,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:50:19,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:50:19,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:50:19,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:50:19,248 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:50:19,248 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:50:19,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:50:19,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:50:19,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:50:19,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:50:19,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:50:19,248 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 -> a77d68c8e15036e88d70009e5342d88dd2f93f021b72148028da08073ac36a38 [2024-11-07 15:50:19,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:50:19,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:50:19,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:50:19,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:50:19,490 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:50:19,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2024-11-07 15:50:20,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:50:21,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:50:21,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-3.i [2024-11-07 15:50:21,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e599ad141/6f779bbba73a42bcbfdaac48c3282530/FLAGb1af8a788 [2024-11-07 15:50:21,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e599ad141/6f779bbba73a42bcbfdaac48c3282530 [2024-11-07 15:50:21,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:50:21,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:50:21,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:50:21,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:50:21,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:50:21,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0748b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21, skipping insertion in model container [2024-11-07 15:50:21,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,100 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:50:21,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:50:21,336 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:50:21,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:50:21,426 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:50:21,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21 WrapperNode [2024-11-07 15:50:21,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:50:21,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:50:21,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:50:21,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:50:21,435 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:50:21" (1/1) ... [2024-11-07 15:50:21,446 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:50:21" (1/1) ... [2024-11-07 15:50:21,469 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 198 [2024-11-07 15:50:21,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:50:21,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:50:21,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:50:21,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:50:21,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:50:21,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:50:21,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:50:21,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:50:21,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (1/1) ... [2024-11-07 15:50:21,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:50:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:50:21,543 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:50:21,548 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:50:21,562 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:50:21,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:50:21,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:50:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-07 15:50:21,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-07 15:50:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:50:21,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:50:21,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:50:21,564 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:50:21,680 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:50:21,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:50:21,971 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:50:21,971 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:50:22,024 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:50:22,025 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 15:50:22,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:50:22 BoogieIcfgContainer [2024-11-07 15:50:22,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:50:22,026 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:50:22,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:50:22,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:50:22,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:50:21" (1/3) ... [2024-11-07 15:50:22,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eb8158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:50:22, skipping insertion in model container [2024-11-07 15:50:22,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:50:21" (2/3) ... [2024-11-07 15:50:22,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eb8158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:50:22, skipping insertion in model container [2024-11-07 15:50:22,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:50:22" (3/3) ... [2024-11-07 15:50:22,034 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-3.i [2024-11-07 15:50:22,046 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:50:22,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-07 15:50:22,046 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:50:22,101 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:50:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 234 transitions, 472 flow [2024-11-07 15:50:22,197 INFO L124 PetriNetUnfolderBase]: 7/276 cut-off events. [2024-11-07 15:50:22,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:50:22,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 276 events. 7/276 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 241 event pairs, 0 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place. [2024-11-07 15:50:22,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 234 transitions, 472 flow [2024-11-07 15:50:22,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 233 places, 234 transitions, 472 flow [2024-11-07 15:50:22,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:50:22,224 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;@3590ebcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:50:22,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-07 15:50:22,258 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:50:22,258 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-07 15:50:22,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:50:22,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:22,259 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] [2024-11-07 15:50:22,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:22,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:22,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1255789169, now seen corresponding path program 1 times [2024-11-07 15:50:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652006961] [2024-11-07 15:50:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:22,575 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:50:22,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:22,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652006961] [2024-11-07 15:50:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652006961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:22,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:22,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899919566] [2024-11-07 15:50:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:22,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:22,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:22,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:22,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:22,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-07 15:50:22,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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:50:22,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:22,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-07 15:50:22,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:22,783 INFO L124 PetriNetUnfolderBase]: 98/708 cut-off events. [2024-11-07 15:50:22,783 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:50:22,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 708 events. 98/708 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3361 event pairs, 33 based on Foata normal form. 9/659 useless extension candidates. Maximal degree in co-relation 731. Up to 138 conditions per place. [2024-11-07 15:50:22,787 INFO L140 encePairwiseOnDemand]: 220/234 looper letters, 32 selfloop transitions, 8 changer transitions 1/249 dead transitions. [2024-11-07 15:50:22,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 249 transitions, 582 flow [2024-11-07 15:50:22,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2024-11-07 15:50:22,797 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9615384615384616 [2024-11-07 15:50:22,798 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 472 flow. Second operand 3 states and 675 transitions. [2024-11-07 15:50:22,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 249 transitions, 582 flow [2024-11-07 15:50:22,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 249 transitions, 582 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:50:22,806 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 534 flow [2024-11-07 15:50:22,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-11-07 15:50:22,811 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 4 predicate places. [2024-11-07 15:50:22,811 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 534 flow [2024-11-07 15:50:22,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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:50:22,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:22,812 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] [2024-11-07 15:50:22,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:50:22,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:22,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash -940757651, now seen corresponding path program 1 times [2024-11-07 15:50:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883366225] [2024-11-07 15:50:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:22,959 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:50:22,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:22,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883366225] [2024-11-07 15:50:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883366225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:22,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:22,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882673089] [2024-11-07 15:50:22,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:22,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:22,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:22,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:22,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:22,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 234 [2024-11-07 15:50:22,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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:50:22,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:22,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 234 [2024-11-07 15:50:22,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:23,119 INFO L124 PetriNetUnfolderBase]: 114/845 cut-off events. [2024-11-07 15:50:23,119 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2024-11-07 15:50:23,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 845 events. 114/845 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4488 event pairs, 72 based on Foata normal form. 4/793 useless extension candidates. Maximal degree in co-relation 1058. Up to 226 conditions per place. [2024-11-07 15:50:23,123 INFO L140 encePairwiseOnDemand]: 228/234 looper letters, 29 selfloop transitions, 7 changer transitions 0/247 dead transitions. [2024-11-07 15:50:23,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 634 flow [2024-11-07 15:50:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-11-07 15:50:23,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373219373219374 [2024-11-07 15:50:23,125 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 534 flow. Second operand 3 states and 658 transitions. [2024-11-07 15:50:23,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 634 flow [2024-11-07 15:50:23,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:23,133 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 574 flow [2024-11-07 15:50:23,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=238, PETRI_TRANSITIONS=243} [2024-11-07 15:50:23,134 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 5 predicate places. [2024-11-07 15:50:23,134 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 574 flow [2024-11-07 15:50:23,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 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:50:23,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:23,135 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:23,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:50:23,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:23,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:23,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2070782679, now seen corresponding path program 1 times [2024-11-07 15:50:23,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:23,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059469684] [2024-11-07 15:50:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:23,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:23,395 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:50:23,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059469684] [2024-11-07 15:50:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059469684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:23,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:23,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:50:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383121083] [2024-11-07 15:50:23,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:23,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:23,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:23,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 234 [2024-11-07 15:50:23,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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:50:23,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:23,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 234 [2024-11-07 15:50:23,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:23,529 INFO L124 PetriNetUnfolderBase]: 93/762 cut-off events. [2024-11-07 15:50:23,530 INFO L125 PetriNetUnfolderBase]: For 67/70 co-relation queries the response was YES. [2024-11-07 15:50:23,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 762 events. 93/762 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3847 event pairs, 56 based on Foata normal form. 3/712 useless extension candidates. Maximal degree in co-relation 884. Up to 144 conditions per place. [2024-11-07 15:50:23,533 INFO L140 encePairwiseOnDemand]: 231/234 looper letters, 15 selfloop transitions, 2 changer transitions 3/248 dead transitions. [2024-11-07 15:50:23,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 248 transitions, 624 flow [2024-11-07 15:50:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:23,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-07 15:50:23,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529914529914529 [2024-11-07 15:50:23,535 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 574 flow. Second operand 3 states and 669 transitions. [2024-11-07 15:50:23,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 248 transitions, 624 flow [2024-11-07 15:50:23,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 248 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:23,539 INFO L231 Difference]: Finished difference. Result has 239 places, 244 transitions, 572 flow [2024-11-07 15:50:23,540 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=239, PETRI_TRANSITIONS=244} [2024-11-07 15:50:23,540 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 6 predicate places. [2024-11-07 15:50:23,541 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 244 transitions, 572 flow [2024-11-07 15:50:23,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 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:50:23,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:23,541 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] [2024-11-07 15:50:23,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:50:23,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash -16343545, now seen corresponding path program 1 times [2024-11-07 15:50:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462411257] [2024-11-07 15:50:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:23,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:23,618 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:50:23,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:23,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462411257] [2024-11-07 15:50:23,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462411257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:23,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:23,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:23,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719015911] [2024-11-07 15:50:23,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:23,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:23,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:23,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:23,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 234 [2024-11-07 15:50:23,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 244 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:50:23,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:23,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 234 [2024-11-07 15:50:23,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:23,723 INFO L124 PetriNetUnfolderBase]: 93/723 cut-off events. [2024-11-07 15:50:23,724 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2024-11-07 15:50:23,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 723 events. 93/723 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3679 event pairs, 55 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 859. Up to 131 conditions per place. [2024-11-07 15:50:23,726 INFO L140 encePairwiseOnDemand]: 229/234 looper letters, 22 selfloop transitions, 4 changer transitions 0/253 dead transitions. [2024-11-07 15:50:23,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 253 transitions, 642 flow [2024-11-07 15:50:23,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:23,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-11-07 15:50:23,728 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9529914529914529 [2024-11-07 15:50:23,728 INFO L175 Difference]: Start difference. First operand has 239 places, 244 transitions, 572 flow. Second operand 3 states and 669 transitions. [2024-11-07 15:50:23,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 253 transitions, 642 flow [2024-11-07 15:50:23,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 253 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:50:23,731 INFO L231 Difference]: Finished difference. Result has 242 places, 247 transitions, 600 flow [2024-11-07 15:50:23,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=600, PETRI_PLACES=242, PETRI_TRANSITIONS=247} [2024-11-07 15:50:23,732 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 9 predicate places. [2024-11-07 15:50:23,732 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 247 transitions, 600 flow [2024-11-07 15:50:23,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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:50:23,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:23,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:23,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:50:23,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:23,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:23,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1628727542, now seen corresponding path program 1 times [2024-11-07 15:50:23,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:23,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245526393] [2024-11-07 15:50:23,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:23,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:50:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245526393] [2024-11-07 15:50:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245526393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244064071] [2024-11-07 15:50:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:23,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:23,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:23,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 234 [2024-11-07 15:50:23,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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:50:23,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:23,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 234 [2024-11-07 15:50:23,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:23,934 INFO L124 PetriNetUnfolderBase]: 85/770 cut-off events. [2024-11-07 15:50:23,934 INFO L125 PetriNetUnfolderBase]: For 84/91 co-relation queries the response was YES. [2024-11-07 15:50:23,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 770 events. 85/770 cut-off events. For 84/91 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4083 event pairs, 45 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 938. Up to 113 conditions per place. [2024-11-07 15:50:23,937 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 17 selfloop transitions, 4 changer transitions 1/253 dead transitions. [2024-11-07 15:50:23,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 253 transitions, 660 flow [2024-11-07 15:50:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2024-11-07 15:50:23,939 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9544159544159544 [2024-11-07 15:50:23,940 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 600 flow. Second operand 3 states and 670 transitions. [2024-11-07 15:50:23,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 253 transitions, 660 flow [2024-11-07 15:50:23,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 253 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:23,946 INFO L231 Difference]: Finished difference. Result has 244 places, 249 transitions, 620 flow [2024-11-07 15:50:23,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=244, PETRI_TRANSITIONS=249} [2024-11-07 15:50:23,947 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 11 predicate places. [2024-11-07 15:50:23,948 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 249 transitions, 620 flow [2024-11-07 15:50:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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:50:23,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:23,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:23,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:50:23,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:23,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:23,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1609610950, now seen corresponding path program 1 times [2024-11-07 15:50:23,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:23,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747917134] [2024-11-07 15:50:23,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:23,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:24,031 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:50:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:24,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747917134] [2024-11-07 15:50:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747917134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:24,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:24,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:24,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840964593] [2024-11-07 15:50:24,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:24,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:24,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:24,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:24,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:24,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 234 [2024-11-07 15:50:24,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 249 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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:50:24,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:24,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 234 [2024-11-07 15:50:24,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:24,173 INFO L124 PetriNetUnfolderBase]: 159/956 cut-off events. [2024-11-07 15:50:24,173 INFO L125 PetriNetUnfolderBase]: For 187/193 co-relation queries the response was YES. [2024-11-07 15:50:24,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 956 events. 159/956 cut-off events. For 187/193 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5489 event pairs, 73 based on Foata normal form. 1/920 useless extension candidates. Maximal degree in co-relation 1450. Up to 274 conditions per place. [2024-11-07 15:50:24,176 INFO L140 encePairwiseOnDemand]: 227/234 looper letters, 29 selfloop transitions, 11 changer transitions 4/262 dead transitions. [2024-11-07 15:50:24,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 262 transitions, 742 flow [2024-11-07 15:50:24,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:24,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2024-11-07 15:50:24,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9472934472934473 [2024-11-07 15:50:24,178 INFO L175 Difference]: Start difference. First operand has 244 places, 249 transitions, 620 flow. Second operand 3 states and 665 transitions. [2024-11-07 15:50:24,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 262 transitions, 742 flow [2024-11-07 15:50:24,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 262 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:24,182 INFO L231 Difference]: Finished difference. Result has 246 places, 253 transitions, 688 flow [2024-11-07 15:50:24,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=246, PETRI_TRANSITIONS=253} [2024-11-07 15:50:24,183 INFO L277 CegarLoopForPetriNet]: 233 programPoint places, 13 predicate places. [2024-11-07 15:50:24,183 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 253 transitions, 688 flow [2024-11-07 15:50:24,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 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:50:24,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:24,184 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:50:24,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-07 15:50:24,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash 738068365, now seen corresponding path program 1 times [2024-11-07 15:50:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:24,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137412750] [2024-11-07 15:50:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:24,215 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:50:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:24,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:50:24,297 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:50:24,298 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-07 15:50:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-07 15:50:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-07 15:50:24,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-07 15:50:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-07 15:50:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-07 15:50:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-07 15:50:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-07 15:50:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-07 15:50:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-07 15:50:24,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-07 15:50:24,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:50:24,300 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:24,302 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:50:24,302 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 15:50:24,324 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-07 15:50:24,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 266 transitions, 542 flow [2024-11-07 15:50:24,362 INFO L124 PetriNetUnfolderBase]: 10/358 cut-off events. [2024-11-07 15:50:24,362 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:50:24,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 358 events. 10/358 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 418 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 277. Up to 6 conditions per place. [2024-11-07 15:50:24,363 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 266 transitions, 542 flow [2024-11-07 15:50:24,365 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 267 places, 266 transitions, 542 flow [2024-11-07 15:50:24,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:50:24,366 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;@3590ebcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:50:24,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-07 15:50:24,378 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:50:24,378 INFO L124 PetriNetUnfolderBase]: 2/160 cut-off events. [2024-11-07 15:50:24,378 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:50:24,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:24,378 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] [2024-11-07 15:50:24,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:24,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 283079345, now seen corresponding path program 1 times [2024-11-07 15:50:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034627081] [2024-11-07 15:50:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:24,440 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:50:24,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:24,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034627081] [2024-11-07 15:50:24,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034627081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:24,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:24,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:24,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427986668] [2024-11-07 15:50:24,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:24,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:24,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:24,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:24,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 266 [2024-11-07 15:50:24,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 266 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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:50:24,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:24,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 266 [2024-11-07 15:50:24,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:25,254 INFO L124 PetriNetUnfolderBase]: 2216/7107 cut-off events. [2024-11-07 15:50:25,254 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-07 15:50:25,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 7107 events. 2216/7107 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 68704 event pairs, 879 based on Foata normal form. 92/6440 useless extension candidates. Maximal degree in co-relation 9184. Up to 2089 conditions per place. [2024-11-07 15:50:25,298 INFO L140 encePairwiseOnDemand]: 248/266 looper letters, 46 selfloop transitions, 11 changer transitions 1/289 dead transitions. [2024-11-07 15:50:25,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 289 transitions, 707 flow [2024-11-07 15:50:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-07 15:50:25,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9548872180451128 [2024-11-07 15:50:25,301 INFO L175 Difference]: Start difference. First operand has 267 places, 266 transitions, 542 flow. Second operand 3 states and 762 transitions. [2024-11-07 15:50:25,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 289 transitions, 707 flow [2024-11-07 15:50:25,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 289 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:50:25,306 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 630 flow [2024-11-07 15:50:25,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2024-11-07 15:50:25,307 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 4 predicate places. [2024-11-07 15:50:25,308 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 630 flow [2024-11-07 15:50:25,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 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:50:25,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:25,308 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:50:25,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:25,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2134699081, now seen corresponding path program 1 times [2024-11-07 15:50:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247106774] [2024-11-07 15:50:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:25,385 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:50:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:25,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247106774] [2024-11-07 15:50:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247106774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:25,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:25,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993859774] [2024-11-07 15:50:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:25,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:25,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:25,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:25,420 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 266 [2024-11-07 15:50:25,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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:50:25,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:25,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 266 [2024-11-07 15:50:25,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:26,521 INFO L124 PetriNetUnfolderBase]: 2480/9018 cut-off events. [2024-11-07 15:50:26,522 INFO L125 PetriNetUnfolderBase]: For 2808/2978 co-relation queries the response was YES. [2024-11-07 15:50:26,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 9018 events. 2480/9018 cut-off events. For 2808/2978 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 94634 event pairs, 1597 based on Foata normal form. 62/8284 useless extension candidates. Maximal degree in co-relation 13582. Up to 3442 conditions per place. [2024-11-07 15:50:26,563 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 42 selfloop transitions, 12 changer transitions 0/291 dead transitions. [2024-11-07 15:50:26,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 291 transitions, 798 flow [2024-11-07 15:50:26,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:26,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-07 15:50:26,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-07 15:50:26,565 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 630 flow. Second operand 3 states and 746 transitions. [2024-11-07 15:50:26,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 291 transitions, 798 flow [2024-11-07 15:50:26,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 291 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:26,574 INFO L231 Difference]: Finished difference. Result has 272 places, 283 transitions, 714 flow [2024-11-07 15:50:26,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=272, PETRI_TRANSITIONS=283} [2024-11-07 15:50:26,575 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 5 predicate places. [2024-11-07 15:50:26,576 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 283 transitions, 714 flow [2024-11-07 15:50:26,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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:50:26,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:26,576 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:26,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:50:26,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:26,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash -581663017, now seen corresponding path program 1 times [2024-11-07 15:50:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949209643] [2024-11-07 15:50:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:26,694 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:50:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949209643] [2024-11-07 15:50:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949209643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:26,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:26,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:50:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645286469] [2024-11-07 15:50:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:26,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:26,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 266 [2024-11-07 15:50:26,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 283 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:50:26,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:26,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 266 [2024-11-07 15:50:26,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:27,732 INFO L124 PetriNetUnfolderBase]: 1983/8135 cut-off events. [2024-11-07 15:50:27,733 INFO L125 PetriNetUnfolderBase]: For 1234/1676 co-relation queries the response was YES. [2024-11-07 15:50:27,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13280 conditions, 8135 events. 1983/8135 cut-off events. For 1234/1676 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 86756 event pairs, 1348 based on Foata normal form. 34/7361 useless extension candidates. Maximal degree in co-relation 11427. Up to 2229 conditions per place. [2024-11-07 15:50:27,780 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 21 selfloop transitions, 2 changer transitions 3/288 dead transitions. [2024-11-07 15:50:27,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 288 transitions, 776 flow [2024-11-07 15:50:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-07 15:50:27,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-11-07 15:50:27,783 INFO L175 Difference]: Start difference. First operand has 272 places, 283 transitions, 714 flow. Second operand 3 states and 753 transitions. [2024-11-07 15:50:27,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 288 transitions, 776 flow [2024-11-07 15:50:27,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 288 transitions, 752 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:27,795 INFO L231 Difference]: Finished difference. Result has 273 places, 284 transitions, 702 flow [2024-11-07 15:50:27,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=273, PETRI_TRANSITIONS=284} [2024-11-07 15:50:27,796 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 6 predicate places. [2024-11-07 15:50:27,796 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 284 transitions, 702 flow [2024-11-07 15:50:27,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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:50:27,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:27,797 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] [2024-11-07 15:50:27,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:50:27,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:27,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash -793910318, now seen corresponding path program 1 times [2024-11-07 15:50:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:27,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427368977] [2024-11-07 15:50:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:27,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:27,863 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:50:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:27,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427368977] [2024-11-07 15:50:27,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427368977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:27,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:27,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139477417] [2024-11-07 15:50:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:27,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:27,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:27,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 266 [2024-11-07 15:50:27,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 284 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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:50:27,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:27,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 266 [2024-11-07 15:50:27,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:28,743 INFO L124 PetriNetUnfolderBase]: 2291/9260 cut-off events. [2024-11-07 15:50:28,744 INFO L125 PetriNetUnfolderBase]: For 924/1846 co-relation queries the response was YES. [2024-11-07 15:50:28,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14911 conditions, 9260 events. 2291/9260 cut-off events. For 924/1846 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 104530 event pairs, 1280 based on Foata normal form. 11/8256 useless extension candidates. Maximal degree in co-relation 14725. Up to 2144 conditions per place. [2024-11-07 15:50:28,781 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 33 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-11-07 15:50:28,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 299 transitions, 813 flow [2024-11-07 15:50:28,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-07 15:50:28,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-07 15:50:28,783 INFO L175 Difference]: Start difference. First operand has 273 places, 284 transitions, 702 flow. Second operand 3 states and 759 transitions. [2024-11-07 15:50:28,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 299 transitions, 813 flow [2024-11-07 15:50:28,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 299 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:50:28,788 INFO L231 Difference]: Finished difference. Result has 276 places, 288 transitions, 738 flow [2024-11-07 15:50:28,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=276, PETRI_TRANSITIONS=288} [2024-11-07 15:50:28,789 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 9 predicate places. [2024-11-07 15:50:28,789 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 288 transitions, 738 flow [2024-11-07 15:50:28,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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:50:28,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:28,789 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:28,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:50:28,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:28,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:28,790 INFO L85 PathProgramCache]: Analyzing trace with hash -483740863, now seen corresponding path program 1 times [2024-11-07 15:50:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:28,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286940755] [2024-11-07 15:50:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:50:28,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286940755] [2024-11-07 15:50:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286940755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:28,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285588130] [2024-11-07 15:50:28,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:28,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:28,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:28,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:28,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 266 [2024-11-07 15:50:28,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 288 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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:50:28,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:28,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 266 [2024-11-07 15:50:28,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:29,770 INFO L124 PetriNetUnfolderBase]: 2197/9610 cut-off events. [2024-11-07 15:50:29,770 INFO L125 PetriNetUnfolderBase]: For 1505/2497 co-relation queries the response was YES. [2024-11-07 15:50:29,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15865 conditions, 9610 events. 2197/9610 cut-off events. For 1505/2497 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 110785 event pairs, 1245 based on Foata normal form. 9/8572 useless extension candidates. Maximal degree in co-relation 14042. Up to 1989 conditions per place. [2024-11-07 15:50:29,819 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 29 selfloop transitions, 6 changer transitions 0/300 dead transitions. [2024-11-07 15:50:29,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 300 transitions, 842 flow [2024-11-07 15:50:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-07 15:50:29,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511278195488722 [2024-11-07 15:50:29,821 INFO L175 Difference]: Start difference. First operand has 276 places, 288 transitions, 738 flow. Second operand 3 states and 759 transitions. [2024-11-07 15:50:29,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 300 transitions, 842 flow [2024-11-07 15:50:29,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 300 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:29,828 INFO L231 Difference]: Finished difference. Result has 278 places, 292 transitions, 776 flow [2024-11-07 15:50:29,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=278, PETRI_TRANSITIONS=292} [2024-11-07 15:50:29,829 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 11 predicate places. [2024-11-07 15:50:29,829 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 292 transitions, 776 flow [2024-11-07 15:50:29,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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:50:29,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:29,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 15:50:29,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:29,831 INFO L85 PathProgramCache]: Analyzing trace with hash 188121, now seen corresponding path program 1 times [2024-11-07 15:50:29,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:29,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908809135] [2024-11-07 15:50:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:29,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:50:29,881 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:50:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:50:29,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908809135] [2024-11-07 15:50:29,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908809135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:50:29,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:50:29,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:50:29,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755499841] [2024-11-07 15:50:29,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:50:29,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:50:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:50:29,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:50:29,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:50:29,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 266 [2024-11-07 15:50:29,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 292 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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:50:29,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:50:29,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 266 [2024-11-07 15:50:29,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:50:31,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [225#L695-2true, 289#true, Black: 270#true, 268#true, Black: 291#(= |#race~data~0| 0), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 294#true, 266#true, Black: 282#(<= (+ ~threads_alive~0 1) 0), 202#L712-1true, 209#L695-7true, Black: 286#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2024-11-07 15:50:31,103 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-07 15:50:31,103 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:31,103 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-11-07 15:50:31,103 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-11-07 15:50:31,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][168], [38#L697true, 225#L695-2true, Black: 270#true, 289#true, 268#true, Black: 291#(= |#race~data~0| 0), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 294#true, 266#true, Black: 282#(<= (+ ~threads_alive~0 1) 0), 202#L712-1true, Black: 286#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2024-11-07 15:50:31,272 INFO L294 olderBase$Statistics]: this new event has 254 ancestors and is cut-off event [2024-11-07 15:50:31,272 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-07 15:50:31,272 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-11-07 15:50:31,272 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-07 15:50:31,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L713-6-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][168], [225#L695-2true, 289#true, Black: 270#true, 268#true, Black: 291#(= |#race~data~0| 0), Black: 277#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet11#1|), 294#true, 266#true, Black: 282#(<= (+ ~threads_alive~0 1) 0), 264#L697-3true, 202#L712-1true, Black: 286#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)]) [2024-11-07 15:50:31,300 INFO L294 olderBase$Statistics]: this new event has 255 ancestors and is cut-off event [2024-11-07 15:50:31,300 INFO L297 olderBase$Statistics]: existing Event has 255 ancestors and is cut-off event [2024-11-07 15:50:31,300 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-07 15:50:31,300 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-11-07 15:50:31,473 INFO L124 PetriNetUnfolderBase]: 4088/14017 cut-off events. [2024-11-07 15:50:31,474 INFO L125 PetriNetUnfolderBase]: For 5634/6036 co-relation queries the response was YES. [2024-11-07 15:50:31,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26510 conditions, 14017 events. 4088/14017 cut-off events. For 5634/6036 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 159030 event pairs, 2076 based on Foata normal form. 74/12729 useless extension candidates. Maximal degree in co-relation 23278. Up to 5203 conditions per place. [2024-11-07 15:50:31,541 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 49 selfloop transitions, 19 changer transitions 0/318 dead transitions. [2024-11-07 15:50:31,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 318 transitions, 1013 flow [2024-11-07 15:50:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:50:31,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:50:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2024-11-07 15:50:31,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9448621553884712 [2024-11-07 15:50:31,547 INFO L175 Difference]: Start difference. First operand has 278 places, 292 transitions, 776 flow. Second operand 3 states and 754 transitions. [2024-11-07 15:50:31,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 318 transitions, 1013 flow [2024-11-07 15:50:31,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 318 transitions, 1001 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:50:31,557 INFO L231 Difference]: Finished difference. Result has 280 places, 307 transitions, 946 flow [2024-11-07 15:50:31,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=280, PETRI_TRANSITIONS=307} [2024-11-07 15:50:31,559 INFO L277 CegarLoopForPetriNet]: 267 programPoint places, 13 predicate places. [2024-11-07 15:50:31,559 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 307 transitions, 946 flow [2024-11-07 15:50:31,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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:50:31,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:50:31,560 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] [2024-11-07 15:50:31,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:50:31,560 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-07 15:50:31,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:50:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash -25411341, now seen corresponding path program 1 times [2024-11-07 15:50:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:50:31,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240131760] [2024-11-07 15:50:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:50:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:50:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:31,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:50:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:50:31,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:50:31,663 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-07 15:50:31,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-07 15:50:31,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-07 15:50:31,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-07 15:50:31,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-07 15:50:31,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-07 15:50:31,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-07 15:50:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:50:31,664 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:50:31,827 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-07 15:50:31,830 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-07 15:50:31,832 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-07 15:50:31,839 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-07 15:50:31,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:50:31,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:50:31 BasicIcfg [2024-11-07 15:50:31,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:50:31,847 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:50:31,847 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:50:31,847 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:50:31,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:50:22" (3/4) ... [2024-11-07 15:50:31,849 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 15:50:31,947 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-07 15:50:31,950 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-11-07 15:50:31,951 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-11-07 15:50:31,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:50:31,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:50:31,987 INFO L158 Benchmark]: Toolchain (without parser) took 10916.06ms. Allocated memory was 109.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 84.3MB in the beginning and 956.3MB in the end (delta: -872.0MB). Peak memory consumption was 638.5MB. Max. memory is 16.1GB. [2024-11-07 15:50:31,987 INFO L158 Benchmark]: CDTParser took 0.20ms. 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:50:31,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.82ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 63.8MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:50:31,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.06ms. Allocated memory is still 109.1MB. Free memory was 63.8MB in the beginning and 61.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:50:31,988 INFO L158 Benchmark]: Boogie Preprocessor took 42.74ms. Allocated memory is still 109.1MB. Free memory was 61.6MB in the beginning and 59.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:50:31,988 INFO L158 Benchmark]: RCFGBuilder took 511.65ms. Allocated memory is still 109.1MB. Free memory was 59.6MB in the beginning and 83.6MB in the end (delta: -24.0MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2024-11-07 15:50:31,988 INFO L158 Benchmark]: TraceAbstraction took 9820.21ms. Allocated memory was 109.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 83.1MB in the beginning and 1.0GB in the end (delta: -931.9MB). Peak memory consumption was 574.8MB. Max. memory is 16.1GB. [2024-11-07 15:50:31,989 INFO L158 Benchmark]: Witness Printer took 138.86ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 956.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-07 15:50:31,990 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.20ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.82ms. Allocated memory is still 109.1MB. Free memory was 84.1MB in the beginning and 63.8MB in the end (delta: 20.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.06ms. Allocated memory is still 109.1MB. Free memory was 63.8MB in the beginning and 61.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.74ms. Allocated memory is still 109.1MB. Free memory was 61.6MB in the beginning and 59.8MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 511.65ms. Allocated memory is still 109.1MB. Free memory was 59.6MB in the beginning and 83.6MB in the end (delta: -24.0MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9820.21ms. Allocated memory was 109.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 83.1MB in the beginning and 1.0GB in the end (delta: -931.9MB). Peak memory consumption was 574.8MB. Max. memory is 16.1GB. * Witness Printer took 138.86ms. Allocated memory is still 1.6GB. Free memory was 1.0GB in the beginning and 956.3MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = -1; VAL [threads_alive=-1] [L686] 0 pthread_mutex_t threads_alive_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L687] 0 pthread_cond_t threads_alive_cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; VAL [threads_alive=-1, threads_alive_mutex={1:0}] [L688] 0 int data = 0; VAL [data=0, threads_alive=-1, threads_alive_mutex={1:0}] [L689] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L701] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L702] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={2:0}, threads_alive=-1, threads_alive_mutex={1:0}] [L702] RET 0 assume_abort_if_not(threads_total >= 0) [L703] 0 int i = 0; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L703] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={2:0}, i=0, threads_alive=-1, threads_alive_mutex={1:0}, threads_total=1] [L705] 0 threads_alive++ VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L707] 0 pthread_t tid; VAL [data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L708] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=0, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1, tid=-1] [L703] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L703] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, i=1, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L712] COND FALSE 0 !(\read(threads_alive)) VAL [\old(arg)={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] [L715] 0 return data; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}, threads_total=1] [L692] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={2:0}, threads_alive=0, threads_alive_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [715] and C: data = __VERIFIER_nondet_int() [692] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 263 locations, 11 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: 2.2s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 19 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=688occurred in iteration=6, InterpolantAutomatonStates: 18, 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.6s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 295 locations, 14 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: 7.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 14 mSDtfsCounter, 384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=6, InterpolantAutomatonStates: 18, 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.3s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1021 ConstructedInterpolants, 0 QuantifiedInterpolants, 1639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-07 15:50:32,013 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE