./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.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-array-dynamic-race-2.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', '9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440'] 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-array-dynamic-race-2.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 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:49:04,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:49:04,805 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:49:04,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:49:04,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:49:04,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:49:04,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:49:04,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:49:04,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:49:04,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:49:04,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:49:04,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:49:04,839 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:49:04,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:49:04,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:49:04,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:49:04,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:49:04,840 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:49:04,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:49:04,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:49:04,840 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:49:04,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:49:04,841 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:49:04,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:49:04,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:49:04,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:49:04,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:49:04,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:49:04,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:49:04,842 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:49:04,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:49:04,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:49:04,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:49:04,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:49:04,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:49:04,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:49:04,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:49:04,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:49:04,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:49:04,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:49:04,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:49:04,844 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 -> 9b6f5676df76ead7ff47af365c70465c7b9cb0ddd7acfe90754727af80919440 [2024-11-07 15:49:05,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:49:05,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:49:05,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:49:05,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:49:05,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:49:05,166 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-array-dynamic-race-2.i [2024-11-07 15:49:06,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:49:06,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:49:06,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-dynamic-race-2.i [2024-11-07 15:49:06,757 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afe5abb05/3f7f4009788c412eab00fd72b942c94d/FLAG6ebb98a06 [2024-11-07 15:49:07,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/afe5abb05/3f7f4009788c412eab00fd72b942c94d [2024-11-07 15:49:07,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:49:07,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:49:07,030 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:49:07,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:49:07,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:49:07,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,035 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f3b455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07, skipping insertion in model container [2024-11-07 15:49:07,035 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:49:07,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:49:07,415 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:49:07,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:49:07,517 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:49:07,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07 WrapperNode [2024-11-07 15:49:07,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:49:07,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:49:07,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:49:07,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:49:07,525 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:49:07" (1/1) ... [2024-11-07 15:49:07,546 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:49:07" (1/1) ... [2024-11-07 15:49:07,574 INFO L138 Inliner]: procedures = 265, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2024-11-07 15:49:07,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:49:07,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:49:07,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:49:07,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:49:07,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:49:07,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:49:07,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:49:07,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:49:07,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (1/1) ... [2024-11-07 15:49:07,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:49:07,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:49:07,664 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:49:07,667 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:49:07,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:49:07,691 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-07 15:49:07,691 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-07 15:49:07,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:49:07,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:49:07,693 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:49:07,834 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:49:07,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:49:08,032 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:49:08,033 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:49:08,062 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:49:08,063 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 15:49:08,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:08 BoogieIcfgContainer [2024-11-07 15:49:08,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:49:08,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:49:08,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:49:08,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:49:08,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:49:07" (1/3) ... [2024-11-07 15:49:08,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e5b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:08, skipping insertion in model container [2024-11-07 15:49:08,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:49:07" (2/3) ... [2024-11-07 15:49:08,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e5b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:49:08, skipping insertion in model container [2024-11-07 15:49:08,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:08" (3/3) ... [2024-11-07 15:49:08,075 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-dynamic-race-2.i [2024-11-07 15:49:08,088 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:49:08,089 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 15:49:08,089 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:49:08,158 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-07 15:49:08,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 89 transitions, 185 flow [2024-11-07 15:49:08,261 INFO L124 PetriNetUnfolderBase]: 6/123 cut-off events. [2024-11-07 15:49:08,264 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-07 15:49:08,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 123 events. 6/123 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 62. Up to 4 conditions per place. [2024-11-07 15:49:08,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 89 transitions, 185 flow [2024-11-07 15:49:08,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 89 transitions, 185 flow [2024-11-07 15:49:08,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:49:08,287 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;@68803a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:49:08,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-07 15:49:08,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:49:08,304 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-07 15:49:08,304 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:49:08,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:08,305 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:08,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-07 15:49:08,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1930866065, now seen corresponding path program 1 times [2024-11-07 15:49:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876607681] [2024-11-07 15:49:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:08,561 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:49:08,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:08,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876607681] [2024-11-07 15:49:08,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876607681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:08,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515399914] [2024-11-07 15:49:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:08,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:08,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:08,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:08,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 89 [2024-11-07 15:49:08,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:49:08,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:08,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 89 [2024-11-07 15:49:08,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:08,707 INFO L124 PetriNetUnfolderBase]: 8/161 cut-off events. [2024-11-07 15:49:08,708 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2024-11-07 15:49:08,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 161 events. 8/161 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 410 event pairs, 1 based on Foata normal form. 8/152 useless extension candidates. Maximal degree in co-relation 122. Up to 16 conditions per place. [2024-11-07 15:49:08,711 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 8 selfloop transitions, 3 changer transitions 2/90 dead transitions. [2024-11-07 15:49:08,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 211 flow [2024-11-07 15:49:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-11-07 15:49:08,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9363295880149812 [2024-11-07 15:49:08,728 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 185 flow. Second operand 3 states and 250 transitions. [2024-11-07 15:49:08,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 211 flow [2024-11-07 15:49:08,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 211 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:49:08,737 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 199 flow [2024-11-07 15:49:08,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-11-07 15:49:08,743 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 4 predicate places. [2024-11-07 15:49:08,744 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 199 flow [2024-11-07 15:49:08,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:49:08,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:08,745 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] [2024-11-07 15:49:08,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:49:08,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-07 15:49:08,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:08,747 INFO L85 PathProgramCache]: Analyzing trace with hash 894653936, now seen corresponding path program 1 times [2024-11-07 15:49:08,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:08,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174258355] [2024-11-07 15:49:08,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:08,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:09,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:09,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174258355] [2024-11-07 15:49:09,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174258355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:09,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:09,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:09,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828729817] [2024-11-07 15:49:09,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:09,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:09,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:09,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:09,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:09,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 89 [2024-11-07 15:49:09,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:49:09,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:09,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 89 [2024-11-07 15:49:09,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:09,807 INFO L124 PetriNetUnfolderBase]: 31/242 cut-off events. [2024-11-07 15:49:09,807 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-07 15:49:09,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 242 events. 31/242 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1057 event pairs, 5 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 276. Up to 62 conditions per place. [2024-11-07 15:49:09,810 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 24 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2024-11-07 15:49:09,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 94 transitions, 271 flow [2024-11-07 15:49:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:09,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:09,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 414 transitions. [2024-11-07 15:49:09,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7752808988764045 [2024-11-07 15:49:09,814 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 199 flow. Second operand 6 states and 414 transitions. [2024-11-07 15:49:09,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 94 transitions, 271 flow [2024-11-07 15:49:09,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:09,819 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 201 flow [2024-11-07 15:49:09,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-11-07 15:49:09,820 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2024-11-07 15:49:09,821 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 201 flow [2024-11-07 15:49:09,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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:49:09,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:09,821 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] [2024-11-07 15:49:09,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:49:09,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-07 15:49:09,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2009182366, now seen corresponding path program 1 times [2024-11-07 15:49:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:09,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364859458] [2024-11-07 15:49:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:09,937 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:49:09,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:09,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364859458] [2024-11-07 15:49:09,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364859458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:09,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:09,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618879240] [2024-11-07 15:49:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:09,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:49:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:09,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:49:09,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:49:10,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 89 [2024-11-07 15:49:10,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:49:10,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:10,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 89 [2024-11-07 15:49:10,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:10,092 INFO L124 PetriNetUnfolderBase]: 17/230 cut-off events. [2024-11-07 15:49:10,092 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-07 15:49:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 230 events. 17/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 814 event pairs, 1 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 227. Up to 49 conditions per place. [2024-11-07 15:49:10,096 INFO L140 encePairwiseOnDemand]: 81/89 looper letters, 15 selfloop transitions, 2 changer transitions 5/93 dead transitions. [2024-11-07 15:49:10,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 259 flow [2024-11-07 15:49:10,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 449 transitions. [2024-11-07 15:49:10,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8408239700374532 [2024-11-07 15:49:10,101 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 201 flow. Second operand 6 states and 449 transitions. [2024-11-07 15:49:10,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 259 flow [2024-11-07 15:49:10,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 249 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:10,104 INFO L231 Difference]: Finished difference. Result has 97 places, 86 transitions, 209 flow [2024-11-07 15:49:10,105 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=97, PETRI_TRANSITIONS=86} [2024-11-07 15:49:10,106 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 9 predicate places. [2024-11-07 15:49:10,107 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 86 transitions, 209 flow [2024-11-07 15:49:10,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:49:10,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:10,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:10,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:49:10,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-07 15:49:10,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash -667923900, now seen corresponding path program 1 times [2024-11-07 15:49:10,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:10,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508576402] [2024-11-07 15:49:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:10,176 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:49:10,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:10,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508576402] [2024-11-07 15:49:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508576402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:10,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165126159] [2024-11-07 15:49:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:10,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:10,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:10,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:10,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 89 [2024-11-07 15:49:10,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 86 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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:49:10,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:10,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 89 [2024-11-07 15:49:10,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:10,226 INFO L124 PetriNetUnfolderBase]: 5/167 cut-off events. [2024-11-07 15:49:10,226 INFO L125 PetriNetUnfolderBase]: For 19/32 co-relation queries the response was YES. [2024-11-07 15:49:10,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 167 events. 5/167 cut-off events. For 19/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 475 event pairs, 3 based on Foata normal form. 1/158 useless extension candidates. Maximal degree in co-relation 187. Up to 25 conditions per place. [2024-11-07 15:49:10,229 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 8 selfloop transitions, 4 changer transitions 3/89 dead transitions. [2024-11-07 15:49:10,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 245 flow [2024-11-07 15:49:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2024-11-07 15:49:10,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9063670411985019 [2024-11-07 15:49:10,231 INFO L175 Difference]: Start difference. First operand has 97 places, 86 transitions, 209 flow. Second operand 3 states and 242 transitions. [2024-11-07 15:49:10,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 245 flow [2024-11-07 15:49:10,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 231 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:10,234 INFO L231 Difference]: Finished difference. Result has 93 places, 86 transitions, 217 flow [2024-11-07 15:49:10,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=93, PETRI_TRANSITIONS=86} [2024-11-07 15:49:10,235 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2024-11-07 15:49:10,235 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 86 transitions, 217 flow [2024-11-07 15:49:10,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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:49:10,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:10,236 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] [2024-11-07 15:49:10,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:49:10,236 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-07 15:49:10,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:10,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1285259620, now seen corresponding path program 1 times [2024-11-07 15:49:10,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:10,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634829436] [2024-11-07 15:49:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:10,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:10,587 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:49:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634829436] [2024-11-07 15:49:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634829436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:10,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:10,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:10,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355411361] [2024-11-07 15:49:10,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:10,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:10,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:10,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:10,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 89 [2024-11-07 15:49:10,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 86 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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:49:10,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:10,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 89 [2024-11-07 15:49:10,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:10,769 INFO L124 PetriNetUnfolderBase]: 25/280 cut-off events. [2024-11-07 15:49:10,769 INFO L125 PetriNetUnfolderBase]: For 48/51 co-relation queries the response was YES. [2024-11-07 15:49:10,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456 conditions, 280 events. 25/280 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1222 event pairs, 15 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 370. Up to 55 conditions per place. [2024-11-07 15:49:10,772 INFO L140 encePairwiseOnDemand]: 83/89 looper letters, 12 selfloop transitions, 0 changer transitions 18/93 dead transitions. [2024-11-07 15:49:10,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 93 transitions, 285 flow [2024-11-07 15:49:10,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 424 transitions. [2024-11-07 15:49:10,775 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7940074906367042 [2024-11-07 15:49:10,775 INFO L175 Difference]: Start difference. First operand has 93 places, 86 transitions, 217 flow. Second operand 6 states and 424 transitions. [2024-11-07 15:49:10,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 93 transitions, 285 flow [2024-11-07 15:49:10,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 93 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:10,780 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 184 flow [2024-11-07 15:49:10,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2024-11-07 15:49:10,782 INFO L277 CegarLoopForPetriNet]: 88 programPoint places, 7 predicate places. [2024-11-07 15:49:10,782 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 184 flow [2024-11-07 15:49:10,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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:49:10,783 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:10,784 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-07 15:49:10,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:49:10,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-07 15:49:10,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1012954957, now seen corresponding path program 1 times [2024-11-07 15:49:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:10,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350033487] [2024-11-07 15:49:10,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:10,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:10,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:49:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:10,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:49:10,860 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:49:10,861 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-07 15:49:10,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-07 15:49:10,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-07 15:49:10,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-11-07 15:49:10,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-07 15:49:10,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-07 15:49:10,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:49:10,864 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 15:49:10,867 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:49:10,867 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-07 15:49:10,885 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:49:10,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 107 transitions, 230 flow [2024-11-07 15:49:10,917 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-11-07 15:49:10,917 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-07 15:49:10,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 446 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 125. Up to 8 conditions per place. [2024-11-07 15:49:10,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 107 transitions, 230 flow [2024-11-07 15:49:10,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 107 transitions, 230 flow [2024-11-07 15:49:10,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:49:10,921 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;@68803a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:49:10,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-07 15:49:10,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:49:10,926 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-07 15:49:10,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:49:10,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:10,926 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:10,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:10,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:10,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1073777201, now seen corresponding path program 1 times [2024-11-07 15:49:10,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:10,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261294028] [2024-11-07 15:49:10,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:10,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:10,952 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:49:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261294028] [2024-11-07 15:49:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261294028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204473382] [2024-11-07 15:49:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:10,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:10,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 107 [2024-11-07 15:49:10,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:49:10,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:10,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 107 [2024-11-07 15:49:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:11,075 INFO L124 PetriNetUnfolderBase]: 119/719 cut-off events. [2024-11-07 15:49:11,075 INFO L125 PetriNetUnfolderBase]: For 44/68 co-relation queries the response was YES. [2024-11-07 15:49:11,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 719 events. 119/719 cut-off events. For 44/68 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4242 event pairs, 50 based on Foata normal form. 36/670 useless extension candidates. Maximal degree in co-relation 741. Up to 139 conditions per place. [2024-11-07 15:49:11,081 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 16 selfloop transitions, 4 changer transitions 1/111 dead transitions. [2024-11-07 15:49:11,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 111 transitions, 278 flow [2024-11-07 15:49:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2024-11-07 15:49:11,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9252336448598131 [2024-11-07 15:49:11,083 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 297 transitions. [2024-11-07 15:49:11,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 111 transitions, 278 flow [2024-11-07 15:49:11,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:49:11,090 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 252 flow [2024-11-07 15:49:11,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2024-11-07 15:49:11,091 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2024-11-07 15:49:11,092 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 252 flow [2024-11-07 15:49:11,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:49:11,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:11,092 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] [2024-11-07 15:49:11,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:49:11,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:11,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash -76665168, now seen corresponding path program 1 times [2024-11-07 15:49:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:11,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709842746] [2024-11-07 15:49:11,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:11,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:11,342 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:49:11,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709842746] [2024-11-07 15:49:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709842746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:11,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:11,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666270959] [2024-11-07 15:49:11,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:11,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:11,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:11,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:11,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:11,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2024-11-07 15:49:11,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:49:11,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:11,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2024-11-07 15:49:11,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:11,684 INFO L124 PetriNetUnfolderBase]: 299/1306 cut-off events. [2024-11-07 15:49:11,685 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-07 15:49:11,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2039 conditions, 1306 events. 299/1306 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9787 event pairs, 58 based on Foata normal form. 0/1174 useless extension candidates. Maximal degree in co-relation 1408. Up to 372 conditions per place. [2024-11-07 15:49:11,696 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 36 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2024-11-07 15:49:11,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 121 transitions, 364 flow [2024-11-07 15:49:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2024-11-07 15:49:11,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.794392523364486 [2024-11-07 15:49:11,701 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 252 flow. Second operand 6 states and 510 transitions. [2024-11-07 15:49:11,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 121 transitions, 364 flow [2024-11-07 15:49:11,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 121 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:11,707 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 252 flow [2024-11-07 15:49:11,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2024-11-07 15:49:11,707 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2024-11-07 15:49:11,708 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 252 flow [2024-11-07 15:49:11,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:49:11,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:11,709 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] [2024-11-07 15:49:11,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:49:11,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1314465826, now seen corresponding path program 1 times [2024-11-07 15:49:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140411534] [2024-11-07 15:49:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:11,783 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:49:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140411534] [2024-11-07 15:49:11,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140411534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:11,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:11,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:11,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118750008] [2024-11-07 15:49:11,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:11,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:49:11,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:11,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:49:11,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:49:11,870 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 107 [2024-11-07 15:49:11,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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:49:11,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:11,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 107 [2024-11-07 15:49:11,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:12,046 INFO L124 PetriNetUnfolderBase]: 179/1195 cut-off events. [2024-11-07 15:49:12,046 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-07 15:49:12,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1195 events. 179/1195 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8712 event pairs, 75 based on Foata normal form. 1/1082 useless extension candidates. Maximal degree in co-relation 560. Up to 300 conditions per place. [2024-11-07 15:49:12,054 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 20 selfloop transitions, 2 changer transitions 5/113 dead transitions. [2024-11-07 15:49:12,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 113 transitions, 322 flow [2024-11-07 15:49:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 538 transitions. [2024-11-07 15:49:12,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.838006230529595 [2024-11-07 15:49:12,057 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 252 flow. Second operand 6 states and 538 transitions. [2024-11-07 15:49:12,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 113 transitions, 322 flow [2024-11-07 15:49:12,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 113 transitions, 312 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:12,062 INFO L231 Difference]: Finished difference. Result has 116 places, 106 transitions, 264 flow [2024-11-07 15:49:12,063 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=116, PETRI_TRANSITIONS=106} [2024-11-07 15:49:12,064 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 9 predicate places. [2024-11-07 15:49:12,064 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 106 transitions, 264 flow [2024-11-07 15:49:12,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.4) internal successors, (432), 5 states have internal predecessors, (432), 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:49:12,065 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:12,065 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:12,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:49:12,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:12,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2079582252, now seen corresponding path program 1 times [2024-11-07 15:49:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:12,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493144194] [2024-11-07 15:49:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:12,112 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:49:12,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:12,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493144194] [2024-11-07 15:49:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493144194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:12,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:12,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079239903] [2024-11-07 15:49:12,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:12,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:12,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:12,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:12,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2024-11-07 15:49:12,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 106 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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:49:12,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:12,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2024-11-07 15:49:12,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:12,262 INFO L124 PetriNetUnfolderBase]: 165/981 cut-off events. [2024-11-07 15:49:12,262 INFO L125 PetriNetUnfolderBase]: For 182/299 co-relation queries the response was YES. [2024-11-07 15:49:12,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 981 events. 165/981 cut-off events. For 182/299 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7175 event pairs, 88 based on Foata normal form. 3/880 useless extension candidates. Maximal degree in co-relation 1539. Up to 269 conditions per place. [2024-11-07 15:49:12,269 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2024-11-07 15:49:12,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 115 transitions, 348 flow [2024-11-07 15:49:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2024-11-07 15:49:12,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9065420560747663 [2024-11-07 15:49:12,271 INFO L175 Difference]: Start difference. First operand has 116 places, 106 transitions, 264 flow. Second operand 3 states and 291 transitions. [2024-11-07 15:49:12,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 115 transitions, 348 flow [2024-11-07 15:49:12,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 115 transitions, 336 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 15:49:12,274 INFO L231 Difference]: Finished difference. Result has 113 places, 111 transitions, 308 flow [2024-11-07 15:49:12,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=113, PETRI_TRANSITIONS=111} [2024-11-07 15:49:12,275 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2024-11-07 15:49:12,275 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 111 transitions, 308 flow [2024-11-07 15:49:12,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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:49:12,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:12,276 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] [2024-11-07 15:49:12,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:49:12,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:12,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1021294111, now seen corresponding path program 1 times [2024-11-07 15:49:12,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:12,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829312474] [2024-11-07 15:49:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:12,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:12,552 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:49:12,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:12,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829312474] [2024-11-07 15:49:12,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829312474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175650388] [2024-11-07 15:49:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:12,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:12,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:12,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:12,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 107 [2024-11-07 15:49:12,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 111 transitions, 308 flow. Second operand has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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:49:12,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:12,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 107 [2024-11-07 15:49:12,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:12,877 INFO L124 PetriNetUnfolderBase]: 356/1815 cut-off events. [2024-11-07 15:49:12,878 INFO L125 PetriNetUnfolderBase]: For 306/352 co-relation queries the response was YES. [2024-11-07 15:49:12,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2992 conditions, 1815 events. 356/1815 cut-off events. For 306/352 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15341 event pairs, 177 based on Foata normal form. 3/1659 useless extension candidates. Maximal degree in co-relation 2422. Up to 360 conditions per place. [2024-11-07 15:49:12,890 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 34 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2024-11-07 15:49:12,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 126 transitions, 416 flow [2024-11-07 15:49:12,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 520 transitions. [2024-11-07 15:49:12,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8099688473520249 [2024-11-07 15:49:12,893 INFO L175 Difference]: Start difference. First operand has 113 places, 111 transitions, 308 flow. Second operand 6 states and 520 transitions. [2024-11-07 15:49:12,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 126 transitions, 416 flow [2024-11-07 15:49:12,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 126 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:12,897 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 302 flow [2024-11-07 15:49:12,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2024-11-07 15:49:12,897 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2024-11-07 15:49:12,898 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 302 flow [2024-11-07 15:49:12,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.16666666666667) internal successors, (493), 6 states have internal predecessors, (493), 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:49:12,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:12,898 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] [2024-11-07 15:49:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 15:49:12,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 179882135, now seen corresponding path program 1 times [2024-11-07 15:49:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552555454] [2024-11-07 15:49:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:12,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:12,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552555454] [2024-11-07 15:49:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552555454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:49:12,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484828161] [2024-11-07 15:49:12,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:12,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:49:12,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:49:12,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:49:12,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 15:49:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:13,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:49:13,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:49:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:13,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:49:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:13,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484828161] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:49:13,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:49:13,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-07 15:49:13,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583486318] [2024-11-07 15:49:13,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:49:13,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:49:13,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:49:13,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:49:13,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2024-11-07 15:49:13,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 302 flow. Second operand has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 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:49:13,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:13,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2024-11-07 15:49:13,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:13,605 INFO L124 PetriNetUnfolderBase]: 161/977 cut-off events. [2024-11-07 15:49:13,605 INFO L125 PetriNetUnfolderBase]: For 131/153 co-relation queries the response was YES. [2024-11-07 15:49:13,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 977 events. 161/977 cut-off events. For 131/153 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6598 event pairs, 35 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 952. Up to 157 conditions per place. [2024-11-07 15:49:13,611 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 27 selfloop transitions, 9 changer transitions 9/132 dead transitions. [2024-11-07 15:49:13,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 132 transitions, 440 flow [2024-11-07 15:49:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 15:49:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 15:49:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 710 transitions. [2024-11-07 15:49:13,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8294392523364486 [2024-11-07 15:49:13,615 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 302 flow. Second operand 8 states and 710 transitions. [2024-11-07 15:49:13,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 132 transitions, 440 flow [2024-11-07 15:49:13,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 132 transitions, 428 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:13,619 INFO L231 Difference]: Finished difference. Result has 120 places, 111 transitions, 325 flow [2024-11-07 15:49:13,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=120, PETRI_TRANSITIONS=111} [2024-11-07 15:49:13,620 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 13 predicate places. [2024-11-07 15:49:13,621 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 111 transitions, 325 flow [2024-11-07 15:49:13,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 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:49:13,622 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:13,622 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-07 15:49:13,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 15:49:13,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 15:49:13,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:13,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:13,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1060604224, now seen corresponding path program 1 times [2024-11-07 15:49:13,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:13,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136084861] [2024-11-07 15:49:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:13,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 15:49:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136084861] [2024-11-07 15:49:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136084861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:13,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:13,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979442987] [2024-11-07 15:49:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:13,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:13,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:13,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 107 [2024-11-07 15:49:13,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 111 transitions, 325 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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:49:13,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:13,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 107 [2024-11-07 15:49:13,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:13,962 INFO L124 PetriNetUnfolderBase]: 56/601 cut-off events. [2024-11-07 15:49:13,962 INFO L125 PetriNetUnfolderBase]: For 229/290 co-relation queries the response was YES. [2024-11-07 15:49:13,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 601 events. 56/601 cut-off events. For 229/290 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3609 event pairs, 30 based on Foata normal form. 3/581 useless extension candidates. Maximal degree in co-relation 910. Up to 119 conditions per place. [2024-11-07 15:49:13,967 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 19 selfloop transitions, 7 changer transitions 1/118 dead transitions. [2024-11-07 15:49:13,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 118 transitions, 402 flow [2024-11-07 15:49:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2024-11-07 15:49:13,970 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9034267912772586 [2024-11-07 15:49:13,970 INFO L175 Difference]: Start difference. First operand has 120 places, 111 transitions, 325 flow. Second operand 3 states and 290 transitions. [2024-11-07 15:49:13,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 118 transitions, 402 flow [2024-11-07 15:49:13,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 396 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 15:49:13,973 INFO L231 Difference]: Finished difference. Result has 121 places, 114 transitions, 369 flow [2024-11-07 15:49:13,973 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=121, PETRI_TRANSITIONS=114} [2024-11-07 15:49:13,975 INFO L277 CegarLoopForPetriNet]: 107 programPoint places, 14 predicate places. [2024-11-07 15:49:13,975 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 114 transitions, 369 flow [2024-11-07 15:49:13,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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:49:13,976 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:13,976 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 15:49:13,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 15:49:13,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-07 15:49:13,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash -881547959, now seen corresponding path program 1 times [2024-11-07 15:49:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:13,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726371331] [2024-11-07 15:49:13,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:13,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:14,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:49:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:14,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:49:14,031 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:49:14,031 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-07 15:49:14,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-07 15:49:14,031 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-07 15:49:14,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-07 15:49:14,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-07 15:49:14,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-07 15:49:14,032 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-07 15:49:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 15:49:14,032 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:14,032 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:49:14,033 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-07 15:49:14,050 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-07 15:49:14,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 125 transitions, 277 flow [2024-11-07 15:49:14,101 INFO L124 PetriNetUnfolderBase]: 21/336 cut-off events. [2024-11-07 15:49:14,101 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-07 15:49:14,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 336 events. 21/336 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 902 event pairs, 1 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 214. Up to 16 conditions per place. [2024-11-07 15:49:14,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 125 transitions, 277 flow [2024-11-07 15:49:14,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 125 transitions, 277 flow [2024-11-07 15:49:14,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:49:14,105 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;@68803a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:49:14,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 15:49:14,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:49:14,109 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-07 15:49:14,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:49:14,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:14,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:14,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:14,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1758380177, now seen corresponding path program 1 times [2024-11-07 15:49:14,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:14,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608438515] [2024-11-07 15:49:14,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:14,130 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:49:14,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:14,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608438515] [2024-11-07 15:49:14,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608438515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:14,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:14,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250052266] [2024-11-07 15:49:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:14,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:14,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:14,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:14,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 125 [2024-11-07 15:49:14,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 125 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:49:14,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:14,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 125 [2024-11-07 15:49:14,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:14,605 INFO L124 PetriNetUnfolderBase]: 1071/3960 cut-off events. [2024-11-07 15:49:14,605 INFO L125 PetriNetUnfolderBase]: For 337/442 co-relation queries the response was YES. [2024-11-07 15:49:14,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5875 conditions, 3960 events. 1071/3960 cut-off events. For 337/442 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35581 event pairs, 542 based on Foata normal form. 179/3698 useless extension candidates. Maximal degree in co-relation 4604. Up to 1110 conditions per place. [2024-11-07 15:49:14,634 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 23 selfloop transitions, 5 changer transitions 1/132 dead transitions. [2024-11-07 15:49:14,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 132 transitions, 347 flow [2024-11-07 15:49:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:14,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:14,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2024-11-07 15:49:14,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173333333333333 [2024-11-07 15:49:14,636 INFO L175 Difference]: Start difference. First operand has 126 places, 125 transitions, 277 flow. Second operand 3 states and 344 transitions. [2024-11-07 15:49:14,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 132 transitions, 347 flow [2024-11-07 15:49:14,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 132 transitions, 347 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:49:14,639 INFO L231 Difference]: Finished difference. Result has 130 places, 125 transitions, 307 flow [2024-11-07 15:49:14,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=130, PETRI_TRANSITIONS=125} [2024-11-07 15:49:14,639 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 4 predicate places. [2024-11-07 15:49:14,639 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 307 flow [2024-11-07 15:49:14,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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:49:14,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:14,640 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] [2024-11-07 15:49:14,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 15:49:14,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:14,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash -850124816, now seen corresponding path program 1 times [2024-11-07 15:49:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466408046] [2024-11-07 15:49:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:14,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:14,858 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:49:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:14,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466408046] [2024-11-07 15:49:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466408046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937456449] [2024-11-07 15:49:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:14,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:14,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:14,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 125 [2024-11-07 15:49:14,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 307 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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:49:14,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:14,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 125 [2024-11-07 15:49:14,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:15,744 INFO L124 PetriNetUnfolderBase]: 2135/6741 cut-off events. [2024-11-07 15:49:15,744 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-11-07 15:49:15,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10971 conditions, 6741 events. 2135/6741 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 67071 event pairs, 440 based on Foata normal form. 0/5959 useless extension candidates. Maximal degree in co-relation 6909. Up to 2247 conditions per place. [2024-11-07 15:49:15,797 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 48 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2024-11-07 15:49:15,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 148 transitions, 459 flow [2024-11-07 15:49:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2024-11-07 15:49:15,800 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.808 [2024-11-07 15:49:15,800 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 307 flow. Second operand 6 states and 606 transitions. [2024-11-07 15:49:15,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 148 transitions, 459 flow [2024-11-07 15:49:15,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 148 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:15,811 INFO L231 Difference]: Finished difference. Result has 131 places, 124 transitions, 305 flow [2024-11-07 15:49:15,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=124} [2024-11-07 15:49:15,812 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2024-11-07 15:49:15,812 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 305 flow [2024-11-07 15:49:15,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 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:49:15,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:15,813 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] [2024-11-07 15:49:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 15:49:15,813 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:15,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash 541006178, now seen corresponding path program 1 times [2024-11-07 15:49:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034416842] [2024-11-07 15:49:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:15,878 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:49:15,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034416842] [2024-11-07 15:49:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034416842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:15,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409740704] [2024-11-07 15:49:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:15,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:49:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:49:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:49:15,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2024-11-07 15:49:15,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:49:15,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:15,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2024-11-07 15:49:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:16,816 INFO L124 PetriNetUnfolderBase]: 1392/6275 cut-off events. [2024-11-07 15:49:16,816 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2024-11-07 15:49:16,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8980 conditions, 6275 events. 1392/6275 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 63462 event pairs, 1074 based on Foata normal form. 1/5612 useless extension candidates. Maximal degree in co-relation 5639. Up to 1837 conditions per place. [2024-11-07 15:49:16,858 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 24 selfloop transitions, 2 changer transitions 5/132 dead transitions. [2024-11-07 15:49:16,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 383 flow [2024-11-07 15:49:16,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 626 transitions. [2024-11-07 15:49:16,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8346666666666667 [2024-11-07 15:49:16,861 INFO L175 Difference]: Start difference. First operand has 131 places, 124 transitions, 305 flow. Second operand 6 states and 626 transitions. [2024-11-07 15:49:16,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 383 flow [2024-11-07 15:49:16,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 132 transitions, 373 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:16,865 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 317 flow [2024-11-07 15:49:16,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2024-11-07 15:49:16,866 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 9 predicate places. [2024-11-07 15:49:16,866 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 317 flow [2024-11-07 15:49:16,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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:49:16,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:16,867 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:16,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 15:49:16,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 917682500, now seen corresponding path program 1 times [2024-11-07 15:49:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436350998] [2024-11-07 15:49:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:16,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:16,898 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:49:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:16,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436350998] [2024-11-07 15:49:16,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436350998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:16,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:16,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249556996] [2024-11-07 15:49:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:16,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:16,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:16,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:16,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:16,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-11-07 15:49:16,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 317 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:49:16,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:16,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-11-07 15:49:16,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:17,651 INFO L124 PetriNetUnfolderBase]: 1740/6509 cut-off events. [2024-11-07 15:49:17,651 INFO L125 PetriNetUnfolderBase]: For 1635/2354 co-relation queries the response was YES. [2024-11-07 15:49:17,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11100 conditions, 6509 events. 1740/6509 cut-off events. For 1635/2354 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 67622 event pairs, 967 based on Foata normal form. 10/5761 useless extension candidates. Maximal degree in co-relation 11041. Up to 2240 conditions per place. [2024-11-07 15:49:17,707 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 29 selfloop transitions, 9 changer transitions 0/140 dead transitions. [2024-11-07 15:49:17,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 140 transitions, 451 flow [2024-11-07 15:49:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2024-11-07 15:49:17,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2024-11-07 15:49:17,710 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 317 flow. Second operand 3 states and 340 transitions. [2024-11-07 15:49:17,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 140 transitions, 451 flow [2024-11-07 15:49:17,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 439 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 15:49:17,725 INFO L231 Difference]: Finished difference. Result has 132 places, 132 transitions, 381 flow [2024-11-07 15:49:17,725 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=132, PETRI_TRANSITIONS=132} [2024-11-07 15:49:17,726 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 6 predicate places. [2024-11-07 15:49:17,726 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 132 transitions, 381 flow [2024-11-07 15:49:17,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:49:17,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:17,727 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] [2024-11-07 15:49:17,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 15:49:17,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:17,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash 161140844, now seen corresponding path program 1 times [2024-11-07 15:49:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315196075] [2024-11-07 15:49:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:17,967 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:49:17,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315196075] [2024-11-07 15:49:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315196075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:17,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615319556] [2024-11-07 15:49:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:17,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:18,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 125 [2024-11-07 15:49:18,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 132 transitions, 381 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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:49:18,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:18,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 125 [2024-11-07 15:49:18,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:19,322 INFO L124 PetriNetUnfolderBase]: 2856/10331 cut-off events. [2024-11-07 15:49:19,323 INFO L125 PetriNetUnfolderBase]: For 1730/2294 co-relation queries the response was YES. [2024-11-07 15:49:19,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 10331 events. 2856/10331 cut-off events. For 1730/2294 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 114378 event pairs, 1400 based on Foata normal form. 17/9184 useless extension candidates. Maximal degree in co-relation 13963. Up to 2139 conditions per place. [2024-11-07 15:49:19,418 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 46 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2024-11-07 15:49:19,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 155 transitions, 529 flow [2024-11-07 15:49:19,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2024-11-07 15:49:19,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8213333333333334 [2024-11-07 15:49:19,421 INFO L175 Difference]: Start difference. First operand has 132 places, 132 transitions, 381 flow. Second operand 6 states and 616 transitions. [2024-11-07 15:49:19,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 155 transitions, 529 flow [2024-11-07 15:49:19,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 155 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:19,433 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 371 flow [2024-11-07 15:49:19,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2024-11-07 15:49:19,434 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 8 predicate places. [2024-11-07 15:49:19,434 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 371 flow [2024-11-07 15:49:19,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 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:49:19,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:19,435 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] [2024-11-07 15:49:19,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 15:49:19,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:19,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:19,436 INFO L85 PathProgramCache]: Analyzing trace with hash 694988840, now seen corresponding path program 1 times [2024-11-07 15:49:19,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:19,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941448883] [2024-11-07 15:49:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:19,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:19,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:19,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941448883] [2024-11-07 15:49:19,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941448883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:49:19,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728342038] [2024-11-07 15:49:19,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:19,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:49:19,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:49:19,535 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:49:19,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 15:49:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:19,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:49:19,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:49:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:19,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:49:19,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:19,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728342038] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:49:19,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:49:19,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-07 15:49:19,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081881036] [2024-11-07 15:49:19,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:49:19,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:49:19,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:19,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:49:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:49:19,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 125 [2024-11-07 15:49:19,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 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:49:19,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:19,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 125 [2024-11-07 15:49:19,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:20,505 INFO L124 PetriNetUnfolderBase]: 1459/6147 cut-off events. [2024-11-07 15:49:20,505 INFO L125 PetriNetUnfolderBase]: For 935/1162 co-relation queries the response was YES. [2024-11-07 15:49:20,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10404 conditions, 6147 events. 1459/6147 cut-off events. For 935/1162 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 62125 event pairs, 454 based on Foata normal form. 1/5513 useless extension candidates. Maximal degree in co-relation 5059. Up to 1044 conditions per place. [2024-11-07 15:49:20,537 INFO L140 encePairwiseOnDemand]: 115/125 looper letters, 48 selfloop transitions, 10 changer transitions 0/163 dead transitions. [2024-11-07 15:49:20,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 163 transitions, 562 flow [2024-11-07 15:49:20,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 15:49:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 15:49:20,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 835 transitions. [2024-11-07 15:49:20,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.835 [2024-11-07 15:49:20,540 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 371 flow. Second operand 8 states and 835 transitions. [2024-11-07 15:49:20,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 163 transitions, 562 flow [2024-11-07 15:49:20,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 163 transitions, 550 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:20,547 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 405 flow [2024-11-07 15:49:20,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=405, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2024-11-07 15:49:20,548 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 13 predicate places. [2024-11-07 15:49:20,548 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 405 flow [2024-11-07 15:49:20,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.22222222222223) internal successors, (893), 9 states have internal predecessors, (893), 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:49:20,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:20,549 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-07 15:49:20,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 15:49:20,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:49:20,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:20,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2119836893, now seen corresponding path program 1 times [2024-11-07 15:49:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:20,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756682074] [2024-11-07 15:49:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 15:49:20,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:20,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756682074] [2024-11-07 15:49:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756682074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343175549] [2024-11-07 15:49:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:20,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:20,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-11-07 15:49:20,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:49:20,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:20,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-11-07 15:49:20,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:21,247 INFO L124 PetriNetUnfolderBase]: 1088/4747 cut-off events. [2024-11-07 15:49:21,247 INFO L125 PetriNetUnfolderBase]: For 2578/2820 co-relation queries the response was YES. [2024-11-07 15:49:21,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9139 conditions, 4747 events. 1088/4747 cut-off events. For 2578/2820 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 49421 event pairs, 589 based on Foata normal form. 7/4392 useless extension candidates. Maximal degree in co-relation 8357. Up to 1450 conditions per place. [2024-11-07 15:49:21,273 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 31 selfloop transitions, 13 changer transitions 0/150 dead transitions. [2024-11-07 15:49:21,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 150 transitions, 566 flow [2024-11-07 15:49:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2024-11-07 15:49:21,275 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.904 [2024-11-07 15:49:21,275 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 405 flow. Second operand 3 states and 339 transitions. [2024-11-07 15:49:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 150 transitions, 566 flow [2024-11-07 15:49:21,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 150 transitions, 560 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 15:49:21,281 INFO L231 Difference]: Finished difference. Result has 140 places, 143 transitions, 517 flow [2024-11-07 15:49:21,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=140, PETRI_TRANSITIONS=143} [2024-11-07 15:49:21,282 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2024-11-07 15:49:21,282 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 143 transitions, 517 flow [2024-11-07 15:49:21,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:49:21,282 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:21,282 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-07 15:49:21,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 15:49:21,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:21,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1392824919, now seen corresponding path program 1 times [2024-11-07 15:49:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:21,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937418047] [2024-11-07 15:49:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 15:49:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937418047] [2024-11-07 15:49:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937418047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:21,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:21,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:49:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038621160] [2024-11-07 15:49:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:21,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:21,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 125 [2024-11-07 15:49:21,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 143 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:49:21,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:21,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 125 [2024-11-07 15:49:21,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:21,525 INFO L124 PetriNetUnfolderBase]: 124/1629 cut-off events. [2024-11-07 15:49:21,526 INFO L125 PetriNetUnfolderBase]: For 736/839 co-relation queries the response was YES. [2024-11-07 15:49:21,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1629 events. 124/1629 cut-off events. For 736/839 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 13490 event pairs, 20 based on Foata normal form. 21/1580 useless extension candidates. Maximal degree in co-relation 1118. Up to 142 conditions per place. [2024-11-07 15:49:21,533 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 12 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2024-11-07 15:49:21,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 490 flow [2024-11-07 15:49:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2024-11-07 15:49:21,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.928 [2024-11-07 15:49:21,535 INFO L175 Difference]: Start difference. First operand has 140 places, 143 transitions, 517 flow. Second operand 3 states and 348 transitions. [2024-11-07 15:49:21,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 490 flow [2024-11-07 15:49:21,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 138 transitions, 476 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:21,540 INFO L231 Difference]: Finished difference. Result has 140 places, 133 transitions, 421 flow [2024-11-07 15:49:21,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=140, PETRI_TRANSITIONS=133} [2024-11-07 15:49:21,541 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2024-11-07 15:49:21,541 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 133 transitions, 421 flow [2024-11-07 15:49:21,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:49:21,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:21,542 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 15:49:21,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 15:49:21,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:21,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1765073251, now seen corresponding path program 1 times [2024-11-07 15:49:21,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:21,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239708296] [2024-11-07 15:49:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-07 15:49:21,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:21,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239708296] [2024-11-07 15:49:21,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239708296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:21,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:21,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548798209] [2024-11-07 15:49:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:21,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:21,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:21,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 125 [2024-11-07 15:49:21,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 133 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:49:21,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:21,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 125 [2024-11-07 15:49:21,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:21,778 INFO L124 PetriNetUnfolderBase]: 203/1827 cut-off events. [2024-11-07 15:49:21,779 INFO L125 PetriNetUnfolderBase]: For 1356/1421 co-relation queries the response was YES. [2024-11-07 15:49:21,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1827 events. 203/1827 cut-off events. For 1356/1421 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15943 event pairs, 134 based on Foata normal form. 3/1739 useless extension candidates. Maximal degree in co-relation 2957. Up to 435 conditions per place. [2024-11-07 15:49:21,788 INFO L140 encePairwiseOnDemand]: 120/125 looper letters, 25 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2024-11-07 15:49:21,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 138 transitions, 503 flow [2024-11-07 15:49:21,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-11-07 15:49:21,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853333333333333 [2024-11-07 15:49:21,790 INFO L175 Difference]: Start difference. First operand has 140 places, 133 transitions, 421 flow. Second operand 3 states and 332 transitions. [2024-11-07 15:49:21,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 138 transitions, 503 flow [2024-11-07 15:49:21,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 138 transitions, 497 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:49:21,797 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 455 flow [2024-11-07 15:49:21,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-11-07 15:49:21,797 INFO L277 CegarLoopForPetriNet]: 126 programPoint places, 17 predicate places. [2024-11-07 15:49:21,797 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 455 flow [2024-11-07 15:49:21,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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:49:21,798 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:21,798 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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:49:21,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 15:49:21,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-07 15:49:21,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1997245556, now seen corresponding path program 1 times [2024-11-07 15:49:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:21,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139586949] [2024-11-07 15:49:21,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:21,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:49:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:21,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:49:21,858 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:49:21,858 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-07 15:49:21,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-07 15:49:21,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-07 15:49:21,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-07 15:49:21,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-07 15:49:21,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-07 15:49:21,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-07 15:49:21,859 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-07 15:49:21,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 15:49:21,859 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:21,861 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-07 15:49:21,861 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-07 15:49:21,884 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-07 15:49:21,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 143 transitions, 326 flow [2024-11-07 15:49:21,931 INFO L124 PetriNetUnfolderBase]: 43/562 cut-off events. [2024-11-07 15:49:21,931 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-07 15:49:21,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 562 events. 43/562 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1997 event pairs, 6 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 356. Up to 32 conditions per place. [2024-11-07 15:49:21,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 143 transitions, 326 flow [2024-11-07 15:49:21,935 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 143 transitions, 326 flow [2024-11-07 15:49:21,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:49:21,937 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;@68803a17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:49:21,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-07 15:49:21,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:49:21,940 INFO L124 PetriNetUnfolderBase]: 3/50 cut-off events. [2024-11-07 15:49:21,940 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:49:21,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:21,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:21,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:21,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:21,940 INFO L85 PathProgramCache]: Analyzing trace with hash 310292303, now seen corresponding path program 1 times [2024-11-07 15:49:21,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:21,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119285579] [2024-11-07 15:49:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:21,957 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:49:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:21,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119285579] [2024-11-07 15:49:21,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119285579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:21,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553198213] [2024-11-07 15:49:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:21,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:21,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 143 [2024-11-07 15:49:21,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:49:21,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:21,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 143 [2024-11-07 15:49:21,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:23,655 INFO L124 PetriNetUnfolderBase]: 7859/23223 cut-off events. [2024-11-07 15:49:23,656 INFO L125 PetriNetUnfolderBase]: For 2355/2706 co-relation queries the response was YES. [2024-11-07 15:49:23,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35573 conditions, 23223 events. 7859/23223 cut-off events. For 2355/2706 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 267152 event pairs, 4292 based on Foata normal form. 903/21908 useless extension candidates. Maximal degree in co-relation 28335. Up to 7653 conditions per place. [2024-11-07 15:49:23,780 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 30 selfloop transitions, 6 changer transitions 1/153 dead transitions. [2024-11-07 15:49:23,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 153 transitions, 418 flow [2024-11-07 15:49:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions. [2024-11-07 15:49:23,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9114219114219114 [2024-11-07 15:49:23,782 INFO L175 Difference]: Start difference. First operand has 145 places, 143 transitions, 326 flow. Second operand 3 states and 391 transitions. [2024-11-07 15:49:23,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 153 transitions, 418 flow [2024-11-07 15:49:23,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 153 transitions, 418 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-07 15:49:23,785 INFO L231 Difference]: Finished difference. Result has 149 places, 144 transitions, 364 flow [2024-11-07 15:49:23,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=149, PETRI_TRANSITIONS=144} [2024-11-07 15:49:23,786 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 4 predicate places. [2024-11-07 15:49:23,786 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 364 flow [2024-11-07 15:49:23,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:49:23,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:23,787 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] [2024-11-07 15:49:23,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 15:49:23,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:23,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1425725008, now seen corresponding path program 1 times [2024-11-07 15:49:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:23,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925910404] [2024-11-07 15:49:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:23,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:24,101 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:49:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925910404] [2024-11-07 15:49:24,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925910404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:24,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396283621] [2024-11-07 15:49:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:24,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:24,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 143 [2024-11-07 15:49:24,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 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:49:24,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:24,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 143 [2024-11-07 15:49:24,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:27,637 INFO L124 PetriNetUnfolderBase]: 12676/35344 cut-off events. [2024-11-07 15:49:27,638 INFO L125 PetriNetUnfolderBase]: For 3145/3145 co-relation queries the response was YES. [2024-11-07 15:49:27,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57702 conditions, 35344 events. 12676/35344 cut-off events. For 3145/3145 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 432859 event pairs, 5965 based on Foata normal form. 0/31767 useless extension candidates. Maximal degree in co-relation 35470. Up to 13083 conditions per place. [2024-11-07 15:49:27,858 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 60 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2024-11-07 15:49:27,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 175 transitions, 556 flow [2024-11-07 15:49:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2024-11-07 15:49:27,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2024-11-07 15:49:27,861 INFO L175 Difference]: Start difference. First operand has 149 places, 144 transitions, 364 flow. Second operand 6 states and 702 transitions. [2024-11-07 15:49:27,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 175 transitions, 556 flow [2024-11-07 15:49:27,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 175 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:27,926 INFO L231 Difference]: Finished difference. Result has 150 places, 143 transitions, 360 flow [2024-11-07 15:49:27,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=150, PETRI_TRANSITIONS=143} [2024-11-07 15:49:27,926 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 5 predicate places. [2024-11-07 15:49:27,927 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 143 transitions, 360 flow [2024-11-07 15:49:27,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 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:49:27,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:27,927 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] [2024-11-07 15:49:27,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 15:49:27,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:27,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash -34594014, now seen corresponding path program 1 times [2024-11-07 15:49:27,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:27,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350959901] [2024-11-07 15:49:27,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:27,973 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:49:27,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:27,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350959901] [2024-11-07 15:49:27,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350959901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:27,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:27,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:27,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239678610] [2024-11-07 15:49:27,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:27,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 15:49:27,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 15:49:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 15:49:28,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 143 [2024-11-07 15:49:28,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 143 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:49:28,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:28,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 143 [2024-11-07 15:49:28,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:31,132 INFO L124 PetriNetUnfolderBase]: 8788/32683 cut-off events. [2024-11-07 15:49:31,132 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2024-11-07 15:49:31,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47760 conditions, 32683 events. 8788/32683 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 418503 event pairs, 5700 based on Foata normal form. 1/28182 useless extension candidates. Maximal degree in co-relation 16955. Up to 9905 conditions per place. [2024-11-07 15:49:31,324 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 28 selfloop transitions, 2 changer transitions 5/151 dead transitions. [2024-11-07 15:49:31,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 151 transitions, 446 flow [2024-11-07 15:49:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2024-11-07 15:49:31,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8321678321678322 [2024-11-07 15:49:31,326 INFO L175 Difference]: Start difference. First operand has 150 places, 143 transitions, 360 flow. Second operand 6 states and 714 transitions. [2024-11-07 15:49:31,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 151 transitions, 446 flow [2024-11-07 15:49:31,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 151 transitions, 436 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:31,331 INFO L231 Difference]: Finished difference. Result has 154 places, 144 transitions, 372 flow [2024-11-07 15:49:31,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=154, PETRI_TRANSITIONS=144} [2024-11-07 15:49:31,332 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2024-11-07 15:49:31,332 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 372 flow [2024-11-07 15:49:31,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:49:31,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:31,332 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:31,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 15:49:31,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:31,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:31,333 INFO L85 PathProgramCache]: Analyzing trace with hash 257971780, now seen corresponding path program 1 times [2024-11-07 15:49:31,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:31,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377989635] [2024-11-07 15:49:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:31,356 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:49:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377989635] [2024-11-07 15:49:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377989635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278237409] [2024-11-07 15:49:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:31,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:31,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:31,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-07 15:49:31,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:49:31,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:31,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-07 15:49:31,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:35,142 INFO L124 PetriNetUnfolderBase]: 13629/40864 cut-off events. [2024-11-07 15:49:35,142 INFO L125 PetriNetUnfolderBase]: For 10496/12940 co-relation queries the response was YES. [2024-11-07 15:49:35,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71721 conditions, 40864 events. 13629/40864 cut-off events. For 10496/12940 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 523312 event pairs, 7860 based on Foata normal form. 36/36352 useless extension candidates. Maximal degree in co-relation 71661. Up to 15880 conditions per place. [2024-11-07 15:49:35,432 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 39 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2024-11-07 15:49:35,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 558 flow [2024-11-07 15:49:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2024-11-07 15:49:35,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9067599067599068 [2024-11-07 15:49:35,434 INFO L175 Difference]: Start difference. First operand has 154 places, 144 transitions, 372 flow. Second operand 3 states and 389 transitions. [2024-11-07 15:49:35,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 558 flow [2024-11-07 15:49:35,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 165 transitions, 546 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-07 15:49:35,554 INFO L231 Difference]: Finished difference. Result has 151 places, 153 transitions, 456 flow [2024-11-07 15:49:35,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=151, PETRI_TRANSITIONS=153} [2024-11-07 15:49:35,554 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 6 predicate places. [2024-11-07 15:49:35,554 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 153 transitions, 456 flow [2024-11-07 15:49:35,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 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:49:35,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:35,555 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] [2024-11-07 15:49:35,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 15:49:35,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:35,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1295200181, now seen corresponding path program 1 times [2024-11-07 15:49:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61314578] [2024-11-07 15:49:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:35,921 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:49:35,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:35,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61314578] [2024-11-07 15:49:35,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61314578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:35,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:35,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 15:49:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590200943] [2024-11-07 15:49:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:35,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 15:49:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 15:49:35,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:49:36,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 143 [2024-11-07 15:49:36,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 153 transitions, 456 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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:49:36,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:36,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 143 [2024-11-07 15:49:36,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:40,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [130#L1024true, 170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 45#L1022-3true, 144#true, 142#true]) [2024-11-07 15:49:40,072 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-11-07 15:49:40,072 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-07 15:49:40,073 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-07 15:49:40,073 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is cut-off event [2024-11-07 15:49:40,213 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][182], [170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 146#true, 140#true, 141#true, 175#true, Black: 150#(= |#race~data~0| 0), 98#L1023-6true, 144#true, 23#L1023-5true]) [2024-11-07 15:49:40,214 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-07 15:49:40,214 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-07 15:49:40,214 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-07 15:49:40,214 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-07 15:49:40,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([590] L1023-4-->L1023-5: Formula: (= |v_#race~data~0_4| |v_threadThread3of4ForFork0_#t~nondet5_3|) InVars {threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} OutVars{#race~data~0=|v_#race~data~0_4|, threadThread3of4ForFork0_#t~nondet5=|v_threadThread3of4ForFork0_#t~nondet5_3|} AuxVars[] AssignedVars[#race~data~0][150], [170#true, 20#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 112#L1023-5true, 140#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 142#true]) [2024-11-07 15:49:40,280 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-07 15:49:40,280 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-07 15:49:40,280 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-07 15:49:40,280 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-07 15:49:40,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][177], [130#L1024true, 170#true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 57#L1023-5true, 146#true, 140#true, 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 23#L1023-5true]) [2024-11-07 15:49:40,906 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-11-07 15:49:40,906 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-07 15:49:40,906 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-07 15:49:40,906 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-07 15:49:41,194 INFO L124 PetriNetUnfolderBase]: 19866/57035 cut-off events. [2024-11-07 15:49:41,194 INFO L125 PetriNetUnfolderBase]: For 9377/13250 co-relation queries the response was YES. [2024-11-07 15:49:41,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99820 conditions, 57035 events. 19866/57035 cut-off events. For 9377/13250 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 746315 event pairs, 9571 based on Foata normal form. 80/49862 useless extension candidates. Maximal degree in co-relation 78994. Up to 12589 conditions per place. [2024-11-07 15:49:41,590 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 58 selfloop transitions, 5 changer transitions 0/184 dead transitions. [2024-11-07 15:49:41,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 184 transitions, 644 flow [2024-11-07 15:49:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 15:49:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-07 15:49:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2024-11-07 15:49:41,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8298368298368298 [2024-11-07 15:49:41,591 INFO L175 Difference]: Start difference. First operand has 151 places, 153 transitions, 456 flow. Second operand 6 states and 712 transitions. [2024-11-07 15:49:41,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 184 transitions, 644 flow [2024-11-07 15:49:41,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:41,661 INFO L231 Difference]: Finished difference. Result has 153 places, 152 transitions, 442 flow [2024-11-07 15:49:41,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=153, PETRI_TRANSITIONS=152} [2024-11-07 15:49:41,662 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 8 predicate places. [2024-11-07 15:49:41,662 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 152 transitions, 442 flow [2024-11-07 15:49:41,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 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:49:41,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:41,662 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] [2024-11-07 15:49:41,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 15:49:41,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:41,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:41,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1577931351, now seen corresponding path program 1 times [2024-11-07 15:49:41,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:41,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720356678] [2024-11-07 15:49:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:41,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:41,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720356678] [2024-11-07 15:49:41,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720356678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:49:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537207190] [2024-11-07 15:49:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:41,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:49:41,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:49:41,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 15:49:41,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 15:49:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:42,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 15:49:42,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:49:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:42,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 15:49:42,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:49:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537207190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 15:49:42,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 15:49:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-07 15:49:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085335676] [2024-11-07 15:49:42,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 15:49:42,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 15:49:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 15:49:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 15:49:42,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 143 [2024-11-07 15:49:42,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 152 transitions, 442 flow. Second operand has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 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:49:42,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:42,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 143 [2024-11-07 15:49:42,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:44,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][190], [Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 57#L1023-5true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 98#L1023-6true, 144#true, 23#L1023-5true]) [2024-11-07 15:49:44,689 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-07 15:49:44,689 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-07 15:49:44,689 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-07 15:49:44,689 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-07 15:49:45,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([638] L1023-4-->L1023-5: Formula: (= |v_threadThread4of4ForFork0_#t~nondet5_3| |v_#race~data~0_4|) InVars {threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|} OutVars{threadThread4of4ForFork0_#t~nondet5=|v_threadThread4of4ForFork0_#t~nondet5_3|, #race~data~0=|v_#race~data~0_4|} AuxVars[] AssignedVars[#race~data~0][188], [130#L1024true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 118#L1038-1true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 146#true, 57#L1023-5true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 141#true, Black: 150#(= |#race~data~0| 0), 175#true, 144#true, 23#L1023-5true]) [2024-11-07 15:49:45,418 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-11-07 15:49:45,418 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-07 15:49:45,418 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-07 15:49:45,418 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2024-11-07 15:49:45,699 INFO L124 PetriNetUnfolderBase]: 11178/36923 cut-off events. [2024-11-07 15:49:45,700 INFO L125 PetriNetUnfolderBase]: For 5999/7801 co-relation queries the response was YES. [2024-11-07 15:49:45,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63969 conditions, 36923 events. 11178/36923 cut-off events. For 5999/7801 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 472404 event pairs, 4636 based on Foata normal form. 15/32381 useless extension candidates. Maximal degree in co-relation 32374. Up to 6529 conditions per place. [2024-11-07 15:49:45,919 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 61 selfloop transitions, 10 changer transitions 0/193 dead transitions. [2024-11-07 15:49:45,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 193 transitions, 680 flow [2024-11-07 15:49:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 15:49:45,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-07 15:49:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2024-11-07 15:49:45,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8391608391608392 [2024-11-07 15:49:45,920 INFO L175 Difference]: Start difference. First operand has 153 places, 152 transitions, 442 flow. Second operand 8 states and 960 transitions. [2024-11-07 15:49:45,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 193 transitions, 680 flow [2024-11-07 15:49:45,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 193 transitions, 668 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-07 15:49:45,937 INFO L231 Difference]: Finished difference. Result has 158 places, 155 transitions, 476 flow [2024-11-07 15:49:45,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=476, PETRI_PLACES=158, PETRI_TRANSITIONS=155} [2024-11-07 15:49:45,937 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 13 predicate places. [2024-11-07 15:49:45,937 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 155 transitions, 476 flow [2024-11-07 15:49:45,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.22222222222223) internal successors, (1019), 9 states have internal predecessors, (1019), 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:49:45,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:45,938 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-07 15:49:45,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 15:49:46,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:49:46,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:46,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:46,139 INFO L85 PathProgramCache]: Analyzing trace with hash -404304548, now seen corresponding path program 1 times [2024-11-07 15:49:46,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:46,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720412613] [2024-11-07 15:49:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:46,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 15:49:46,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:46,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720412613] [2024-11-07 15:49:46,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720412613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:46,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:46,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:46,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276279620] [2024-11-07 15:49:46,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:46,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:46,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:46,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:46,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-07 15:49:46,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:49:46,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:46,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-07 15:49:46,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:49,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), 33#L1024true, Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 69#L1038true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, 545#true, Black: 148#true, 98#L1023-6true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), 142#true]) [2024-11-07 15:49:49,899 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2024-11-07 15:49:49,899 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-11-07 15:49:49,899 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-07 15:49:49,899 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-07 15:49:49,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([543] L1037-1-->L1038: Formula: (= |v_#race~data~0_1| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_1|} AuxVars[] AssignedVars[#race~data~0][157], [Black: 186#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 1 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 161#(= |ULTIMATE.start_main_~i~0#1| 0), 145#true, 117#L1024-3true, Black: 172#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet5|), 69#L1038true, 140#true, 185#(<= 1 |ULTIMATE.start_main_~threads_total~0#1|), 143#true, 545#true, Black: 148#true, 98#L1023-6true, Black: 183#(= |ULTIMATE.start_main_~i~0#1| 0), 142#true]) [2024-11-07 15:49:49,906 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2024-11-07 15:49:49,906 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-07 15:49:49,906 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-07 15:49:49,906 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2024-11-07 15:49:49,943 INFO L124 PetriNetUnfolderBase]: 11773/38290 cut-off events. [2024-11-07 15:49:49,943 INFO L125 PetriNetUnfolderBase]: For 22561/24261 co-relation queries the response was YES. [2024-11-07 15:49:50,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76142 conditions, 38290 events. 11773/38290 cut-off events. For 22561/24261 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 513457 event pairs, 6499 based on Foata normal form. 24/34728 useless extension candidates. Maximal degree in co-relation 68804. Up to 13617 conditions per place. [2024-11-07 15:49:50,183 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 43 selfloop transitions, 18 changer transitions 0/180 dead transitions. [2024-11-07 15:49:50,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 180 transitions, 721 flow [2024-11-07 15:49:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2024-11-07 15:49:50,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9044289044289044 [2024-11-07 15:49:50,184 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 476 flow. Second operand 3 states and 388 transitions. [2024-11-07 15:49:50,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 180 transitions, 721 flow [2024-11-07 15:49:50,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 180 transitions, 715 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-07 15:49:50,203 INFO L231 Difference]: Finished difference. Result has 159 places, 169 transitions, 648 flow [2024-11-07 15:49:50,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=159, PETRI_TRANSITIONS=169} [2024-11-07 15:49:50,203 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 14 predicate places. [2024-11-07 15:49:50,203 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 169 transitions, 648 flow [2024-11-07 15:49:50,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:49:50,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:50,204 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-07 15:49:50,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 15:49:50,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:50,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1149769352, now seen corresponding path program 1 times [2024-11-07 15:49:50,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:50,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243942074] [2024-11-07 15:49:50,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:50,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-07 15:49:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:50,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243942074] [2024-11-07 15:49:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243942074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:50,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:50,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:49:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079003325] [2024-11-07 15:49:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:50,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:50,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 143 [2024-11-07 15:49:50,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 169 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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:49:50,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:50,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 143 [2024-11-07 15:49:50,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:50,743 INFO L124 PetriNetUnfolderBase]: 688/6572 cut-off events. [2024-11-07 15:49:50,743 INFO L125 PetriNetUnfolderBase]: For 3280/3754 co-relation queries the response was YES. [2024-11-07 15:49:50,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11505 conditions, 6572 events. 688/6572 cut-off events. For 3280/3754 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 75229 event pairs, 149 based on Foata normal form. 177/6357 useless extension candidates. Maximal degree in co-relation 4603. Up to 662 conditions per place. [2024-11-07 15:49:50,772 INFO L140 encePairwiseOnDemand]: 135/143 looper letters, 16 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2024-11-07 15:49:50,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 581 flow [2024-11-07 15:49:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2024-11-07 15:49:50,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9254079254079254 [2024-11-07 15:49:50,773 INFO L175 Difference]: Start difference. First operand has 159 places, 169 transitions, 648 flow. Second operand 3 states and 397 transitions. [2024-11-07 15:49:50,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 581 flow [2024-11-07 15:49:50,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 159 transitions, 567 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:50,784 INFO L231 Difference]: Finished difference. Result has 159 places, 152 transitions, 488 flow [2024-11-07 15:49:50,785 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=159, PETRI_TRANSITIONS=152} [2024-11-07 15:49:50,785 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 14 predicate places. [2024-11-07 15:49:50,785 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 152 transitions, 488 flow [2024-11-07 15:49:50,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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:49:50,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:50,786 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-07 15:49:50,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 15:49:50,786 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1330462637, now seen corresponding path program 1 times [2024-11-07 15:49:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:50,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860950833] [2024-11-07 15:49:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-07 15:49:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860950833] [2024-11-07 15:49:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860950833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:50,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:50,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:50,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732958287] [2024-11-07 15:49:50,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:50,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:50,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:50,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:50,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:50,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-07 15:49:50,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 152 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:49:50,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:50,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-07 15:49:50,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:51,793 INFO L124 PetriNetUnfolderBase]: 1114/7642 cut-off events. [2024-11-07 15:49:51,793 INFO L125 PetriNetUnfolderBase]: For 6464/6625 co-relation queries the response was YES. [2024-11-07 15:49:51,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15275 conditions, 7642 events. 1114/7642 cut-off events. For 6464/6625 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 90898 event pairs, 714 based on Foata normal form. 7/7132 useless extension candidates. Maximal degree in co-relation 12014. Up to 2065 conditions per place. [2024-11-07 15:49:51,828 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2024-11-07 15:49:51,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 159 transitions, 602 flow [2024-11-07 15:49:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2024-11-07 15:49:51,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8811188811188811 [2024-11-07 15:49:51,830 INFO L175 Difference]: Start difference. First operand has 159 places, 152 transitions, 488 flow. Second operand 3 states and 378 transitions. [2024-11-07 15:49:51,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 159 transitions, 602 flow [2024-11-07 15:49:51,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:49:51,836 INFO L231 Difference]: Finished difference. Result has 162 places, 155 transitions, 520 flow [2024-11-07 15:49:51,836 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=162, PETRI_TRANSITIONS=155} [2024-11-07 15:49:51,837 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 17 predicate places. [2024-11-07 15:49:51,837 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 520 flow [2024-11-07 15:49:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:49:51,837 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:51,837 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 15:49:51,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:51,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1780606827, now seen corresponding path program 1 times [2024-11-07 15:49:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845434982] [2024-11-07 15:49:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:51,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:49:51,876 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-07 15:49:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:49:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845434982] [2024-11-07 15:49:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845434982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:49:51,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:49:51,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:49:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075828138] [2024-11-07 15:49:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:49:51,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:49:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:49:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:49:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:49:51,897 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2024-11-07 15:49:51,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:49:51,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:49:51,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2024-11-07 15:49:51,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:49:52,700 INFO L124 PetriNetUnfolderBase]: 1121/7928 cut-off events. [2024-11-07 15:49:52,700 INFO L125 PetriNetUnfolderBase]: For 8615/8767 co-relation queries the response was YES. [2024-11-07 15:49:52,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16348 conditions, 7928 events. 1121/7928 cut-off events. For 8615/8767 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 95369 event pairs, 707 based on Foata normal form. 4/7482 useless extension candidates. Maximal degree in co-relation 13094. Up to 2095 conditions per place. [2024-11-07 15:49:52,723 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2024-11-07 15:49:52,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 161 transitions, 625 flow [2024-11-07 15:49:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:49:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:49:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2024-11-07 15:49:52,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8787878787878788 [2024-11-07 15:49:52,724 INFO L175 Difference]: Start difference. First operand has 162 places, 155 transitions, 520 flow. Second operand 3 states and 377 transitions. [2024-11-07 15:49:52,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 161 transitions, 625 flow [2024-11-07 15:49:52,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 611 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-07 15:49:52,731 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 548 flow [2024-11-07 15:49:52,731 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2024-11-07 15:49:52,732 INFO L277 CegarLoopForPetriNet]: 145 programPoint places, 19 predicate places. [2024-11-07 15:49:52,732 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 548 flow [2024-11-07 15:49:52,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 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:49:52,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:49:52,732 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-07 15:49:52,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 15:49:52,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-07 15:49:52,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:49:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash 2042999134, now seen corresponding path program 1 times [2024-11-07 15:49:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:49:52,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089827664] [2024-11-07 15:49:52,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:49:52,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:49:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:52,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 15:49:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 15:49:52,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 15:49:52,792 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-07 15:49:52,793 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-07 15:49:52,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-07 15:49:52,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 15:49:52,794 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:49:52,870 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2024-11-07 15:49:52,870 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:49:52,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:49:52 BasicIcfg [2024-11-07 15:49:52,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:49:52,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:49:52,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:49:52,877 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:49:52,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:49:08" (3/4) ... [2024-11-07 15:49:52,879 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 15:49:52,936 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:49:52,936 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:49:52,937 INFO L158 Benchmark]: Toolchain (without parser) took 45908.73ms. Allocated memory was 117.4MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 89.7MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-11-07 15:49:52,938 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:49:52,938 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 61.9MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 15:49:52,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.48ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 59.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:49:52,938 INFO L158 Benchmark]: Boogie Preprocessor took 42.92ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 58.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:49:52,939 INFO L158 Benchmark]: RCFGBuilder took 441.18ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 89.5MB in the end (delta: -31.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-07 15:49:52,939 INFO L158 Benchmark]: TraceAbstraction took 44811.16ms. Allocated memory was 117.4MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 88.6MB in the beginning and 9.9GB in the end (delta: -9.9GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2024-11-07 15:49:52,939 INFO L158 Benchmark]: Witness Printer took 59.49ms. Allocated memory is still 12.6GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 15:49:52,941 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.29ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.00ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 61.9MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.48ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 59.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.92ms. Allocated memory is still 117.4MB. Free memory was 59.8MB in the beginning and 58.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 441.18ms. Allocated memory is still 117.4MB. Free memory was 58.6MB in the beginning and 89.5MB in the end (delta: -31.0MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44811.16ms. Allocated memory was 117.4MB in the beginning and 12.6GB in the end (delta: 12.5GB). Free memory was 88.6MB in the beginning and 9.9GB in the end (delta: -9.9GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. * Witness Printer took 59.49ms. Allocated memory is still 12.6GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1023]: Data race detected Data race detected The following path leads to a data race: [L1019] 0 int data = 0; VAL [data=0] [L1020] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L1028] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_total=2] [L1029] CALL 0 assume_abort_if_not(threads_total >= 0) [L1016] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}] [L1029] RET 0 assume_abort_if_not(threads_total >= 0) [L1030] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1031] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1031] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1032] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1032] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=2, tids={-2:0}] [L1031] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1031] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1034] 0 int i = 0; VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1034] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] EXPR 0 tids[i] VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1035] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1023] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1025] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1035] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=2, tids={-2:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L1034] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1034] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=2, tids={-2:0}] [L1038] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=2, tids={-2:0}] [L1023] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [1038] and C: data = __VERIFIER_nondet_int() [1023] - UnprovableResult [Line: 1038]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1032]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 103 locations, 6 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.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 5 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 1.3s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, 120 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 804 IncrementalHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 35 mSDtfsCounter, 804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 457 NumberOfCodeBlocks, 457 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 884 SizeOfPredicates, 4 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 12/15 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 3 thread instances CFG has 5 procedures, 137 locations, 8 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.8s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 620 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 428 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 42 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=7, InterpolantAutomatonStates: 41, 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.8s InterpolantComputationTime, 625 NumberOfCodeBlocks, 625 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 1061 SizeOfPredicates, 4 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 62/65 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 4 thread instances CFG has 6 procedures, 154 locations, 9 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: 30.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 768 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 522 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 57 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=648occurred in iteration=7, InterpolantAutomatonStates: 44, 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, 1.1s InterpolantComputationTime, 735 NumberOfCodeBlocks, 735 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 681 ConstructedInterpolants, 0 QuantifiedInterpolants, 1159 SizeOfPredicates, 4 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 146/149 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:49:52,973 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