./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.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-deagle/arithmetic_prog_ok.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', '29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38'] 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-deagle/arithmetic_prog_ok.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 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:46:01,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:46:02,064 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:46:02,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:46:02,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:46:02,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:46:02,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:46:02,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:46:02,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:46:02,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:46:02,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:46:02,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:46:02,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:46:02,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:46:02,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:46:02,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:46:02,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:46:02,117 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 -> 29016034e4102bf62d4fcba069301a54da1d77dfd5739e4cf52e395ddaa22e38 [2024-11-07 15:46:02,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:46:02,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:46:02,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:46:02,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:46:02,421 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:46:02,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2024-11-07 15:46:03,685 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:46:03,948 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:46:03,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_ok.i [2024-11-07 15:46:03,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/276bbe2da/10d27acc85b642a58a85bddf0078ff24/FLAG38ca512fb [2024-11-07 15:46:03,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/276bbe2da/10d27acc85b642a58a85bddf0078ff24 [2024-11-07 15:46:03,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:46:03,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:46:03,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:46:03,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:46:03,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:46:04,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:03" (1/1) ... [2024-11-07 15:46:04,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21df402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04, skipping insertion in model container [2024-11-07 15:46:04,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:03" (1/1) ... [2024-11-07 15:46:04,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:46:04,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:46:04,423 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:46:04,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:46:04,538 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:46:04,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04 WrapperNode [2024-11-07 15:46:04,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:46:04,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:46:04,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:46:04,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:46:04,545 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:46:04" (1/1) ... [2024-11-07 15:46:04,567 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:46:04" (1/1) ... [2024-11-07 15:46:04,599 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 274 [2024-11-07 15:46:04,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:46:04,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:46:04,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:46:04,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:46:04,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,635 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:46:04,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:46:04,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:46:04,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:46:04,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (1/1) ... [2024-11-07 15:46:04,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:46:04,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:04,687 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:46:04,690 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:46:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-07 15:46:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:46:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:46:04,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:46:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:46:04,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:46:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:46:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:46:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:46:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:46:04,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:46:04,716 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:46:04,853 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:46:04,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:46:05,291 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:46:05,291 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:46:05,337 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:46:05,337 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 15:46:05,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:05 BoogieIcfgContainer [2024-11-07 15:46:05,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:46:05,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:46:05,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:46:05,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:46:05,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:03" (1/3) ... [2024-11-07 15:46:05,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10026ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:05, skipping insertion in model container [2024-11-07 15:46:05,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:04" (2/3) ... [2024-11-07 15:46:05,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10026ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:05, skipping insertion in model container [2024-11-07 15:46:05,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:05" (3/3) ... [2024-11-07 15:46:05,349 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2024-11-07 15:46:05,363 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:46:05,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-07 15:46:05,364 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:46:05,466 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:46:05,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 379 transitions, 772 flow [2024-11-07 15:46:05,656 INFO L124 PetriNetUnfolderBase]: 11/377 cut-off events. [2024-11-07 15:46:05,659 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:46:05,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 377 events. 11/377 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 284 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 296. Up to 3 conditions per place. [2024-11-07 15:46:05,666 INFO L82 GeneralOperation]: Start removeDead. Operand has 375 places, 379 transitions, 772 flow [2024-11-07 15:46:05,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 363 transitions, 738 flow [2024-11-07 15:46:05,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:46:05,724 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;@1fc456de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:46:05,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-07 15:46:05,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:46:05,779 INFO L124 PetriNetUnfolderBase]: 0/241 cut-off events. [2024-11-07 15:46:05,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:46:05,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:05,781 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:05,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:05,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:05,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1274538100, now seen corresponding path program 1 times [2024-11-07 15:46:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571490799] [2024-11-07 15:46:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:05,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:06,265 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:46:06,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:06,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571490799] [2024-11-07 15:46:06,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571490799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:06,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:06,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251511510] [2024-11-07 15:46:06,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:06,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:06,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:06,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 379 [2024-11-07 15:46:06,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 363 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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:46:06,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:06,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 379 [2024-11-07 15:46:06,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:06,597 INFO L124 PetriNetUnfolderBase]: 89/653 cut-off events. [2024-11-07 15:46:06,598 INFO L125 PetriNetUnfolderBase]: For 56/62 co-relation queries the response was YES. [2024-11-07 15:46:06,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 653 events. 89/653 cut-off events. For 56/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2056 event pairs, 53 based on Foata normal form. 23/615 useless extension candidates. Maximal degree in co-relation 517. Up to 163 conditions per place. [2024-11-07 15:46:06,607 INFO L140 encePairwiseOnDemand]: 372/379 looper letters, 21 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-07 15:46:06,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 358 transitions, 774 flow [2024-11-07 15:46:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1069 transitions. [2024-11-07 15:46:06,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.940193491644679 [2024-11-07 15:46:06,632 INFO L175 Difference]: Start difference. First operand has 362 places, 363 transitions, 738 flow. Second operand 3 states and 1069 transitions. [2024-11-07 15:46:06,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 358 transitions, 774 flow [2024-11-07 15:46:06,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 358 transitions, 766 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-07 15:46:06,647 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 724 flow [2024-11-07 15:46:06,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-11-07 15:46:06,655 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2024-11-07 15:46:06,655 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 724 flow [2024-11-07 15:46:06,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 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:46:06,657 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:06,657 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:06,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:46:06,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:06,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:06,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1606664058, now seen corresponding path program 1 times [2024-11-07 15:46:06,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:06,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147219427] [2024-11-07 15:46:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:06,914 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:46:06,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:06,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147219427] [2024-11-07 15:46:06,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147219427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:06,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:06,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:06,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195282641] [2024-11-07 15:46:06,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:06,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:06,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:06,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:06,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 379 [2024-11-07 15:46:06,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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:46:06,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:06,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 379 [2024-11-07 15:46:06,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:07,110 INFO L124 PetriNetUnfolderBase]: 75/700 cut-off events. [2024-11-07 15:46:07,110 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-11-07 15:46:07,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 700 events. 75/700 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2516 event pairs, 33 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 590. Up to 128 conditions per place. [2024-11-07 15:46:07,115 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-07 15:46:07,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 357 transitions, 766 flow [2024-11-07 15:46:07,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1067 transitions. [2024-11-07 15:46:07,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384344766930519 [2024-11-07 15:46:07,118 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 724 flow. Second operand 3 states and 1067 transitions. [2024-11-07 15:46:07,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 357 transitions, 766 flow [2024-11-07 15:46:07,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:07,130 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 722 flow [2024-11-07 15:46:07,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2024-11-07 15:46:07,132 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -4 predicate places. [2024-11-07 15:46:07,133 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 722 flow [2024-11-07 15:46:07,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 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:46:07,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:07,135 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:07,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:46:07,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 563269571, now seen corresponding path program 1 times [2024-11-07 15:46:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:07,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499629514] [2024-11-07 15:46:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:07,326 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:46:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499629514] [2024-11-07 15:46:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499629514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:07,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:07,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:07,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983571829] [2024-11-07 15:46:07,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:07,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:07,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:07,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:07,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 379 [2024-11-07 15:46:07,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 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:46:07,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:07,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 379 [2024-11-07 15:46:07,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:07,608 INFO L124 PetriNetUnfolderBase]: 207/1202 cut-off events. [2024-11-07 15:46:07,608 INFO L125 PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES. [2024-11-07 15:46:07,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 1202 events. 207/1202 cut-off events. For 29/38 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6055 event pairs, 55 based on Foata normal form. 1/1072 useless extension candidates. Maximal degree in co-relation 1368. Up to 266 conditions per place. [2024-11-07 15:46:07,617 INFO L140 encePairwiseOnDemand]: 365/379 looper letters, 37 selfloop transitions, 10 changer transitions 0/377 dead transitions. [2024-11-07 15:46:07,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 377 transitions, 858 flow [2024-11-07 15:46:07,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1086 transitions. [2024-11-07 15:46:07,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9551451187335093 [2024-11-07 15:46:07,621 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 722 flow. Second operand 3 states and 1086 transitions. [2024-11-07 15:46:07,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 377 transitions, 858 flow [2024-11-07 15:46:07,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 377 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:07,628 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 806 flow [2024-11-07 15:46:07,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=360, PETRI_TRANSITIONS=367} [2024-11-07 15:46:07,629 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -2 predicate places. [2024-11-07 15:46:07,629 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 806 flow [2024-11-07 15:46:07,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 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:46:07,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:07,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:46:07,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:07,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:07,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1043580549, now seen corresponding path program 1 times [2024-11-07 15:46:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003203427] [2024-11-07 15:46:07,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:46:07,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003203427] [2024-11-07 15:46:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003203427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:46:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511910432] [2024-11-07 15:46:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:07,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:07,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:07,886 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 379 [2024-11-07 15:46:07,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 367 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 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:46:07,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:07,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 379 [2024-11-07 15:46:07,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:08,198 INFO L124 PetriNetUnfolderBase]: 266/1801 cut-off events. [2024-11-07 15:46:08,199 INFO L125 PetriNetUnfolderBase]: For 119/121 co-relation queries the response was YES. [2024-11-07 15:46:08,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1801 events. 266/1801 cut-off events. For 119/121 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11165 event pairs, 87 based on Foata normal form. 6/1609 useless extension candidates. Maximal degree in co-relation 2027. Up to 260 conditions per place. [2024-11-07 15:46:08,211 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-07 15:46:08,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 377 transitions, 879 flow [2024-11-07 15:46:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1095 transitions. [2024-11-07 15:46:08,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630606860158312 [2024-11-07 15:46:08,214 INFO L175 Difference]: Start difference. First operand has 360 places, 367 transitions, 806 flow. Second operand 3 states and 1095 transitions. [2024-11-07 15:46:08,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 377 transitions, 879 flow [2024-11-07 15:46:08,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 377 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:08,224 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 798 flow [2024-11-07 15:46:08,225 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=361, PETRI_TRANSITIONS=368} [2024-11-07 15:46:08,227 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -1 predicate places. [2024-11-07 15:46:08,227 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 798 flow [2024-11-07 15:46:08,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 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:46:08,228 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:08,228 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:08,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:46:08,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:08,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:08,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1070020697, now seen corresponding path program 1 times [2024-11-07 15:46:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:08,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048528427] [2024-11-07 15:46:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:08,382 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:46:08,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:08,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048528427] [2024-11-07 15:46:08,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048528427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:08,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:08,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:08,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113873778] [2024-11-07 15:46:08,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:08,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:08,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:08,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:08,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:08,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 379 [2024-11-07 15:46:08,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 368 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 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:46:08,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:08,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 379 [2024-11-07 15:46:08,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:08,731 INFO L124 PetriNetUnfolderBase]: 443/2130 cut-off events. [2024-11-07 15:46:08,731 INFO L125 PetriNetUnfolderBase]: For 279/326 co-relation queries the response was YES. [2024-11-07 15:46:08,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 2130 events. 443/2130 cut-off events. For 279/326 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13603 event pairs, 166 based on Foata normal form. 15/1918 useless extension candidates. Maximal degree in co-relation 2861. Up to 688 conditions per place. [2024-11-07 15:46:08,743 INFO L140 encePairwiseOnDemand]: 372/379 looper letters, 32 selfloop transitions, 10 changer transitions 0/381 dead transitions. [2024-11-07 15:46:08,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 381 transitions, 921 flow [2024-11-07 15:46:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2024-11-07 15:46:08,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9507475813544415 [2024-11-07 15:46:08,745 INFO L175 Difference]: Start difference. First operand has 361 places, 368 transitions, 798 flow. Second operand 3 states and 1081 transitions. [2024-11-07 15:46:08,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 381 transitions, 921 flow [2024-11-07 15:46:08,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 381 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:46:08,752 INFO L231 Difference]: Finished difference. Result has 364 places, 376 transitions, 882 flow [2024-11-07 15:46:08,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=364, PETRI_TRANSITIONS=376} [2024-11-07 15:46:08,753 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, 2 predicate places. [2024-11-07 15:46:08,754 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 376 transitions, 882 flow [2024-11-07 15:46:08,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 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:46:08,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:08,755 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:08,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:46:08,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:08,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 662990335, now seen corresponding path program 1 times [2024-11-07 15:46:08,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:08,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850941331] [2024-11-07 15:46:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:08,897 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:46:08,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850941331] [2024-11-07 15:46:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850941331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:08,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:08,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:46:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724626981] [2024-11-07 15:46:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:08,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 379 [2024-11-07 15:46:08,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 376 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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:46:08,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:08,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 379 [2024-11-07 15:46:08,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:09,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [248#L894-2true, Black: 384#true, 400#(= ~num~0 0), 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 393#true]) [2024-11-07 15:46:09,083 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is cut-off event [2024-11-07 15:46:09,083 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-07 15:46:09,083 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-07 15:46:09,083 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-07 15:46:09,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [248#L894-2true, Black: 384#true, 398#true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 393#true]) [2024-11-07 15:46:09,310 INFO L294 olderBase$Statistics]: this new event has 346 ancestors and is cut-off event [2024-11-07 15:46:09,310 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-07 15:46:09,310 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:09,310 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:09,317 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [248#L894-2true, Black: 384#true, 398#true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 393#true]) [2024-11-07 15:46:09,317 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is cut-off event [2024-11-07 15:46:09,317 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-07 15:46:09,317 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:09,318 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:09,318 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-07 15:46:09,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [Black: 384#true, 398#true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 228#L894-1true, 393#true]) [2024-11-07 15:46:09,318 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-11-07 15:46:09,318 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-07 15:46:09,318 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-07 15:46:09,318 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-07 15:46:09,320 INFO L124 PetriNetUnfolderBase]: 542/2486 cut-off events. [2024-11-07 15:46:09,320 INFO L125 PetriNetUnfolderBase]: For 440/478 co-relation queries the response was YES. [2024-11-07 15:46:09,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4134 conditions, 2486 events. 542/2486 cut-off events. For 440/478 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 15992 event pairs, 154 based on Foata normal form. 21/2209 useless extension candidates. Maximal degree in co-relation 3514. Up to 449 conditions per place. [2024-11-07 15:46:09,336 INFO L140 encePairwiseOnDemand]: 374/379 looper letters, 27 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2024-11-07 15:46:09,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 387 transitions, 966 flow [2024-11-07 15:46:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2024-11-07 15:46:09,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9595426561125769 [2024-11-07 15:46:09,339 INFO L175 Difference]: Start difference. First operand has 364 places, 376 transitions, 882 flow. Second operand 3 states and 1091 transitions. [2024-11-07 15:46:09,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 387 transitions, 966 flow [2024-11-07 15:46:09,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 387 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:09,351 INFO L231 Difference]: Finished difference. Result has 366 places, 378 transitions, 886 flow [2024-11-07 15:46:09,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=366, PETRI_TRANSITIONS=378} [2024-11-07 15:46:09,352 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, 4 predicate places. [2024-11-07 15:46:09,352 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 378 transitions, 886 flow [2024-11-07 15:46:09,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 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:46:09,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:09,353 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:46:09,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1436826995, now seen corresponding path program 1 times [2024-11-07 15:46:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463278830] [2024-11-07 15:46:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:09,669 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:46:09,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:09,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463278830] [2024-11-07 15:46:09,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463278830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:09,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:09,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:46:09,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187647637] [2024-11-07 15:46:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:09,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:09,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:09,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:09,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 379 [2024-11-07 15:46:09,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 378 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 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:46:09,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:09,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 379 [2024-11-07 15:46:09,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:09,850 INFO L124 PetriNetUnfolderBase]: 51/770 cut-off events. [2024-11-07 15:46:09,850 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-07 15:46:09,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 770 events. 51/770 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2186 event pairs, 7 based on Foata normal form. 22/759 useless extension candidates. Maximal degree in co-relation 553. Up to 87 conditions per place. [2024-11-07 15:46:09,854 INFO L140 encePairwiseOnDemand]: 371/379 looper letters, 8 selfloop transitions, 8 changer transitions 0/359 dead transitions. [2024-11-07 15:46:09,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 822 flow [2024-11-07 15:46:09,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2024-11-07 15:46:09,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621811785400176 [2024-11-07 15:46:09,858 INFO L175 Difference]: Start difference. First operand has 366 places, 378 transitions, 886 flow. Second operand 3 states and 1094 transitions. [2024-11-07 15:46:09,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 822 flow [2024-11-07 15:46:09,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 790 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-07 15:46:09,867 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 768 flow [2024-11-07 15:46:09,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2024-11-07 15:46:09,869 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2024-11-07 15:46:09,869 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 768 flow [2024-11-07 15:46:09,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 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:46:09,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:09,870 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:09,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:46:09,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:09,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1408103733, now seen corresponding path program 1 times [2024-11-07 15:46:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577157507] [2024-11-07 15:46:09,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:10,018 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:46:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:10,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577157507] [2024-11-07 15:46:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577157507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:10,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:10,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:10,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832645836] [2024-11-07 15:46:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:10,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 379 [2024-11-07 15:46:10,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 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:46:10,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:10,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 379 [2024-11-07 15:46:10,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:10,195 INFO L124 PetriNetUnfolderBase]: 80/845 cut-off events. [2024-11-07 15:46:10,195 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-07 15:46:10,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 845 events. 80/845 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2877 event pairs, 22 based on Foata normal form. 1/813 useless extension candidates. Maximal degree in co-relation 674. Up to 115 conditions per place. [2024-11-07 15:46:10,200 INFO L140 encePairwiseOnDemand]: 371/379 looper letters, 20 selfloop transitions, 4 changer transitions 3/359 dead transitions. [2024-11-07 15:46:10,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 831 flow [2024-11-07 15:46:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2024-11-07 15:46:10,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9428320140721196 [2024-11-07 15:46:10,203 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 768 flow. Second operand 3 states and 1072 transitions. [2024-11-07 15:46:10,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 831 flow [2024-11-07 15:46:10,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 359 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-07 15:46:10,209 INFO L231 Difference]: Finished difference. Result has 357 places, 351 transitions, 756 flow [2024-11-07 15:46:10,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=357, PETRI_TRANSITIONS=351} [2024-11-07 15:46:10,210 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -5 predicate places. [2024-11-07 15:46:10,210 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 351 transitions, 756 flow [2024-11-07 15:46:10,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 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:46:10,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:10,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:10,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:46:10,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:10,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash -64203076, now seen corresponding path program 1 times [2024-11-07 15:46:10,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709027148] [2024-11-07 15:46:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:10,337 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:46:10,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:10,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709027148] [2024-11-07 15:46:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709027148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:10,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207949385] [2024-11-07 15:46:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:10,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:10,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 379 [2024-11-07 15:46:10,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 351 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 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:46:10,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:10,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 379 [2024-11-07 15:46:10,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:10,493 INFO L124 PetriNetUnfolderBase]: 75/808 cut-off events. [2024-11-07 15:46:10,493 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-07 15:46:10,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 808 events. 75/808 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2689 event pairs, 29 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 598. Up to 142 conditions per place. [2024-11-07 15:46:10,497 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 19 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2024-11-07 15:46:10,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 351 transitions, 799 flow [2024-11-07 15:46:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2024-11-07 15:46:10,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9428320140721196 [2024-11-07 15:46:10,500 INFO L175 Difference]: Start difference. First operand has 357 places, 351 transitions, 756 flow. Second operand 3 states and 1072 transitions. [2024-11-07 15:46:10,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 351 transitions, 799 flow [2024-11-07 15:46:10,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 351 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:10,506 INFO L231 Difference]: Finished difference. Result has 353 places, 350 transitions, 750 flow [2024-11-07 15:46:10,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=353, PETRI_TRANSITIONS=350} [2024-11-07 15:46:10,508 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -9 predicate places. [2024-11-07 15:46:10,508 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 350 transitions, 750 flow [2024-11-07 15:46:10,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 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:46:10,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:10,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:10,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:46:10,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:10,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash 912439908, now seen corresponding path program 1 times [2024-11-07 15:46:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678571627] [2024-11-07 15:46:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:10,626 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:46:10,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:10,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678571627] [2024-11-07 15:46:10,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678571627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:10,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:10,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780718347] [2024-11-07 15:46:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:10,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:10,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:10,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:10,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 379 [2024-11-07 15:46:10,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 350 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 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:46:10,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:10,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 379 [2024-11-07 15:46:10,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:10,770 INFO L124 PetriNetUnfolderBase]: 71/763 cut-off events. [2024-11-07 15:46:10,771 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-07 15:46:10,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 763 events. 71/763 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2309 event pairs, 30 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 611. Up to 176 conditions per place. [2024-11-07 15:46:10,774 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 23 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2024-11-07 15:46:10,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 350 transitions, 801 flow [2024-11-07 15:46:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2024-11-07 15:46:10,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.941952506596306 [2024-11-07 15:46:10,777 INFO L175 Difference]: Start difference. First operand has 353 places, 350 transitions, 750 flow. Second operand 3 states and 1071 transitions. [2024-11-07 15:46:10,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 350 transitions, 801 flow [2024-11-07 15:46:10,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 350 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:10,783 INFO L231 Difference]: Finished difference. Result has 352 places, 349 transitions, 748 flow [2024-11-07 15:46:10,784 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=352, PETRI_TRANSITIONS=349} [2024-11-07 15:46:10,785 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -10 predicate places. [2024-11-07 15:46:10,785 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 748 flow [2024-11-07 15:46:10,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 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:46:10,786 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:10,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:46:10,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:10,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash 216970297, now seen corresponding path program 1 times [2024-11-07 15:46:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464128103] [2024-11-07 15:46:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:11,036 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:46:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464128103] [2024-11-07 15:46:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464128103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:46:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361351581] [2024-11-07 15:46:11,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:11,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:11,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:11,040 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:46:11,042 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:46:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:11,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:46:11,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:46:11,422 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:46:11,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:46:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361351581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:46:11,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:46:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694346782] [2024-11-07 15:46:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:11,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:11,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:11,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:46:11,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 379 [2024-11-07 15:46:11,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 349 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 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:46:11,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:11,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 379 [2024-11-07 15:46:11,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:11,587 INFO L124 PetriNetUnfolderBase]: 92/891 cut-off events. [2024-11-07 15:46:11,588 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-07 15:46:11,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 891 events. 92/891 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3188 event pairs, 32 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 727. Up to 149 conditions per place. [2024-11-07 15:46:11,592 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 23 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2024-11-07 15:46:11,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 353 transitions, 811 flow [2024-11-07 15:46:11,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1076 transitions. [2024-11-07 15:46:11,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9463500439753738 [2024-11-07 15:46:11,596 INFO L175 Difference]: Start difference. First operand has 352 places, 349 transitions, 748 flow. Second operand 3 states and 1076 transitions. [2024-11-07 15:46:11,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 353 transitions, 811 flow [2024-11-07 15:46:11,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 353 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:11,601 INFO L231 Difference]: Finished difference. Result has 351 places, 348 transitions, 746 flow [2024-11-07 15:46:11,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=351, PETRI_TRANSITIONS=348} [2024-11-07 15:46:11,602 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -11 predicate places. [2024-11-07 15:46:11,602 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 348 transitions, 746 flow [2024-11-07 15:46:11,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 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:46:11,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:11,603 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:11,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 15:46:11,807 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,SelfDestructingSolverStorable10 [2024-11-07 15:46:11,808 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:11,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -433418165, now seen corresponding path program 1 times [2024-11-07 15:46:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381578736] [2024-11-07 15:46:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:12,034 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:46:12,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:12,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381578736] [2024-11-07 15:46:12,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381578736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:46:12,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300499301] [2024-11-07 15:46:12,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:12,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:12,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:12,038 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:46:12,040 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:46:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:12,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:46:12,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:46:12,385 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:46:12,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:46:12,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300499301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:12,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:46:12,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:46:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184847868] [2024-11-07 15:46:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:12,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:12,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:46:12,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 379 [2024-11-07 15:46:12,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 348 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 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:46:12,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:12,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 379 [2024-11-07 15:46:12,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:12,512 INFO L124 PetriNetUnfolderBase]: 81/842 cut-off events. [2024-11-07 15:46:12,513 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-07 15:46:12,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 842 events. 81/842 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2753 event pairs, 24 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 918. Up to 121 conditions per place. [2024-11-07 15:46:12,516 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 20 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2024-11-07 15:46:12,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 352 transitions, 803 flow [2024-11-07 15:46:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2024-11-07 15:46:12,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542656112576957 [2024-11-07 15:46:12,519 INFO L175 Difference]: Start difference. First operand has 351 places, 348 transitions, 746 flow. Second operand 3 states and 1085 transitions. [2024-11-07 15:46:12,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 352 transitions, 803 flow [2024-11-07 15:46:12,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 352 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:12,525 INFO L231 Difference]: Finished difference. Result has 350 places, 347 transitions, 744 flow [2024-11-07 15:46:12,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=350, PETRI_TRANSITIONS=347} [2024-11-07 15:46:12,526 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -12 predicate places. [2024-11-07 15:46:12,526 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 347 transitions, 744 flow [2024-11-07 15:46:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 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:46:12,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:12,527 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:12,546 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:46:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:12,728 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-07 15:46:12,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash 816575416, now seen corresponding path program 1 times [2024-11-07 15:46:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445423323] [2024-11-07 15:46:12,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 15:46:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445423323] [2024-11-07 15:46:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445423323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:46:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762018436] [2024-11-07 15:46:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:12,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:12,943 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:46:12,944 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:46:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:13,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:46:13,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:46:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 15:46:13,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:46:13,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762018436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:13,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:46:13,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:46:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121778660] [2024-11-07 15:46:13,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:13,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:13,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:13,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:46:13,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 379 [2024-11-07 15:46:13,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 347 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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:46:13,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:13,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 379 [2024-11-07 15:46:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:13,354 INFO L124 PetriNetUnfolderBase]: 58/761 cut-off events. [2024-11-07 15:46:13,354 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-07 15:46:13,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 761 events. 58/761 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2155 event pairs, 19 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 933. Up to 105 conditions per place. [2024-11-07 15:46:13,357 INFO L140 encePairwiseOnDemand]: 377/379 looper letters, 0 selfloop transitions, 0 changer transitions 346/346 dead transitions. [2024-11-07 15:46:13,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 346 transitions, 770 flow [2024-11-07 15:46:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1083 transitions. [2024-11-07 15:46:13,360 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9525065963060686 [2024-11-07 15:46:13,360 INFO L175 Difference]: Start difference. First operand has 350 places, 347 transitions, 744 flow. Second operand 3 states and 1083 transitions. [2024-11-07 15:46:13,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 346 transitions, 770 flow [2024-11-07 15:46:13,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 346 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-07 15:46:13,364 INFO L231 Difference]: Finished difference. Result has 349 places, 0 transitions, 0 flow [2024-11-07 15:46:13,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=349, PETRI_TRANSITIONS=0} [2024-11-07 15:46:13,365 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -13 predicate places. [2024-11-07 15:46:13,365 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 0 transitions, 0 flow [2024-11-07 15:46:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 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:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2024-11-07 15:46:13,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2024-11-07 15:46:13,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2024-11-07 15:46:13,386 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:46:13,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:13,570 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:13,576 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:46:13,576 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:46:13,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:46:13 BasicIcfg [2024-11-07 15:46:13,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:46:13,580 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:46:13,580 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:46:13,580 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:46:13,580 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:05" (3/4) ... [2024-11-07 15:46:13,582 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:46:13,584 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:46:13,584 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:46:13,591 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 15:46:13,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-07 15:46:13,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:46:13,592 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:46:13,668 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:46:13,669 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:46:13,669 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:46:13,671 INFO L158 Benchmark]: Toolchain (without parser) took 9675.42ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 90.2MB in the beginning and 209.3MB in the end (delta: -119.1MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2024-11-07 15:46:13,671 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:46:13,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.41ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 62.4MB in the end (delta: 27.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:46:13,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.15ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:46:13,672 INFO L158 Benchmark]: Boogie Preprocessor took 48.78ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 57.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:46:13,673 INFO L158 Benchmark]: RCFGBuilder took 688.18ms. Allocated memory is still 117.4MB. Free memory was 57.2MB in the beginning and 75.2MB in the end (delta: -18.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-07 15:46:13,673 INFO L158 Benchmark]: TraceAbstraction took 8237.17ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 74.2MB in the beginning and 217.7MB in the end (delta: -143.5MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-11-07 15:46:13,674 INFO L158 Benchmark]: Witness Printer took 89.27ms. Allocated memory is still 352.3MB. Free memory was 217.7MB in the beginning and 209.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:46:13,675 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.21ms. Allocated memory is still 117.4MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.41ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 62.4MB in the end (delta: 27.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.15ms. Allocated memory is still 117.4MB. Free memory was 62.4MB in the beginning and 59.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.78ms. Allocated memory is still 117.4MB. Free memory was 59.6MB in the beginning and 57.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 688.18ms. Allocated memory is still 117.4MB. Free memory was 57.2MB in the beginning and 75.2MB in the end (delta: -18.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8237.17ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 74.2MB in the beginning and 217.7MB in the end (delta: -143.5MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. * Witness Printer took 89.27ms. Allocated memory is still 352.3MB. Free memory was 217.7MB in the beginning and 209.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 880]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 902]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 894]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 896]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 902]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 896]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 903]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 897]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 897]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 909]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 917]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 918]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 457 locations, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 659 IncrementalHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 69 mSDtfsCounter, 659 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1006 GetRequests, 984 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=886occurred in iteration=6, InterpolantAutomatonStates: 39, 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.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 4661 NumberOfCodeBlocks, 4661 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4645 ConstructedInterpolants, 0 QuantifiedInterpolants, 4951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 5/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-07 15:46:13,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE