./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.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_bad.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', '051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38'] 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_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 15:46:00,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 15:46:00,517 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:00,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 15:46:00,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 15:46:00,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 15:46:00,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 15:46:00,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 15:46:00,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 15:46:00,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 15:46:00,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 15:46:00,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 15:46:00,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 15:46:00,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 15:46:00,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 15:46:00,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 15:46:00,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 15:46:00,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 15:46:00,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 15:46:00,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 15:46:00,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 15:46:00,561 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 15:46:00,561 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-07 15:46:00,561 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 15:46:00,562 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 15:46:00,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 15:46:00,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 15:46:00,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 15:46:00,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 15:46:00,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 15:46:00,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 15:46:00,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:46:00,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 15:46:00,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 15:46:00,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 15:46:00,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 15:46:00,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 15:46:00,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 15:46:00,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 15:46:00,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 15:46:00,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 15:46:00,564 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-11-07 15:46:00,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 15:46:00,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 15:46:00,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 15:46:00,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 15:46:00,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 15:46:00,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-07 15:46:02,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 15:46:02,448 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 15:46:02,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-07 15:46:02,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caef93464/7504c2912e4d4e5c8a57316836ec647d/FLAG2340ff576 [2024-11-07 15:46:02,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caef93464/7504c2912e4d4e5c8a57316836ec647d [2024-11-07 15:46:02,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 15:46:02,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 15:46:02,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 15:46:02,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 15:46:02,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 15:46:02,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:02" (1/1) ... [2024-11-07 15:46:02,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a836c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:02, skipping insertion in model container [2024-11-07 15:46:02,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:46:02" (1/1) ... [2024-11-07 15:46:02,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 15:46:02,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:46:02,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 15:46:02,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 15:46:02,978 INFO L204 MainTranslator]: Completed translation [2024-11-07 15:46:02,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:02 WrapperNode [2024-11-07 15:46:02,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 15:46:02,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 15:46:02,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 15:46:02,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 15:46:02,984 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:02" (1/1) ... [2024-11-07 15:46:03,007 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:02" (1/1) ... [2024-11-07 15:46:03,040 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 274 [2024-11-07 15:46:03,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 15:46:03,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 15:46:03,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 15:46:03,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 15:46:03,048 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:02" (1/1) ... [2024-11-07 15:46:03,048 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:02" (1/1) ... [2024-11-07 15:46:03,056 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:02" (1/1) ... [2024-11-07 15:46:03,056 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:02" (1/1) ... [2024-11-07 15:46:03,070 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:02" (1/1) ... [2024-11-07 15:46:03,079 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:02" (1/1) ... [2024-11-07 15:46:03,085 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:02" (1/1) ... [2024-11-07 15:46:03,086 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:02" (1/1) ... [2024-11-07 15:46:03,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 15:46:03,091 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 15:46:03,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 15:46:03,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 15:46:03,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:02" (1/1) ... [2024-11-07 15:46:03,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 15:46:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:03,138 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:03,140 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:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-07 15:46:03,160 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-07 15:46:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-07 15:46:03,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-07 15:46:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-07 15:46:03,161 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-07 15:46:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-07 15:46:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 15:46:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 15:46:03,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 15:46:03,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 15:46:03,162 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:03,308 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 15:46:03,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 15:46:03,713 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-07 15:46:03,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 15:46:03,755 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 15:46:03,755 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-07 15:46:03,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:03 BoogieIcfgContainer [2024-11-07 15:46:03,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 15:46:03,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 15:46:03,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 15:46:03,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 15:46:03,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:46:02" (1/3) ... [2024-11-07 15:46:03,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9ec0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:03, skipping insertion in model container [2024-11-07 15:46:03,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:46:02" (2/3) ... [2024-11-07 15:46:03,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9ec0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:46:03, skipping insertion in model container [2024-11-07 15:46:03,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:46:03" (3/3) ... [2024-11-07 15:46:03,767 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-07 15:46:03,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 15:46:03,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-07 15:46:03,783 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-07 15:46:03,871 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-07 15:46:03,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 379 transitions, 772 flow [2024-11-07 15:46:04,101 INFO L124 PetriNetUnfolderBase]: 11/377 cut-off events. [2024-11-07 15:46:04,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-07 15:46:04,114 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:04,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 375 places, 379 transitions, 772 flow [2024-11-07 15:46:04,125 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 363 transitions, 738 flow [2024-11-07 15:46:04,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 15:46:04,152 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;@1e0e324, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 15:46:04,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-07 15:46:04,211 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-07 15:46:04,211 INFO L124 PetriNetUnfolderBase]: 0/241 cut-off events. [2024-11-07 15:46:04,211 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-07 15:46:04,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:04,212 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:04,212 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:04,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1274538100, now seen corresponding path program 1 times [2024-11-07 15:46:04,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:04,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565510140] [2024-11-07 15:46:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:04,740 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:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565510140] [2024-11-07 15:46:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565510140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:04,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691083428] [2024-11-07 15:46:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:04,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:04,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:04,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:04,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 379 [2024-11-07 15:46:04,850 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:04,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:04,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 379 [2024-11-07 15:46:04,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:05,057 INFO L124 PetriNetUnfolderBase]: 89/653 cut-off events. [2024-11-07 15:46:05,057 INFO L125 PetriNetUnfolderBase]: For 62/68 co-relation queries the response was YES. [2024-11-07 15:46:05,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 653 events. 89/653 cut-off events. For 62/68 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:05,067 INFO L140 encePairwiseOnDemand]: 372/379 looper letters, 21 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-07 15:46:05,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 358 transitions, 774 flow [2024-11-07 15:46:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1069 transitions. [2024-11-07 15:46:05,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.940193491644679 [2024-11-07 15:46:05,092 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:05,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 358 transitions, 774 flow [2024-11-07 15:46:05,101 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:05,109 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 724 flow [2024-11-07 15:46:05,114 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:05,118 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2024-11-07 15:46:05,119 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 724 flow [2024-11-07 15:46:05,120 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:05,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:05,120 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:05,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 15:46:05,121 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:05,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1606664058, now seen corresponding path program 1 times [2024-11-07 15:46:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371484449] [2024-11-07 15:46:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:05,383 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:05,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:05,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371484449] [2024-11-07 15:46:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371484449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:05,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:05,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916311946] [2024-11-07 15:46:05,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:05,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 379 [2024-11-07 15:46:05,443 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:05,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:05,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 379 [2024-11-07 15:46:05,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:05,613 INFO L124 PetriNetUnfolderBase]: 75/700 cut-off events. [2024-11-07 15:46:05,613 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-11-07 15:46:05,615 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:05,618 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-07 15:46:05,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 357 transitions, 766 flow [2024-11-07 15:46:05,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1067 transitions. [2024-11-07 15:46:05,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384344766930519 [2024-11-07 15:46:05,622 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:05,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 357 transitions, 766 flow [2024-11-07 15:46:05,628 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:05,635 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 722 flow [2024-11-07 15:46:05,636 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:05,636 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -4 predicate places. [2024-11-07 15:46:05,636 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 722 flow [2024-11-07 15:46:05,637 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:05,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:05,637 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:05,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 15:46:05,638 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:05,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash 563269571, now seen corresponding path program 1 times [2024-11-07 15:46:05,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:05,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565586308] [2024-11-07 15:46:05,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:05,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:05,849 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:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:05,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565586308] [2024-11-07 15:46:05,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565586308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:05,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759150520] [2024-11-07 15:46:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:05,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:05,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:05,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:05,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 379 [2024-11-07 15:46:05,895 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:05,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:05,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 379 [2024-11-07 15:46:05,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:06,146 INFO L124 PetriNetUnfolderBase]: 207/1202 cut-off events. [2024-11-07 15:46:06,146 INFO L125 PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES. [2024-11-07 15:46:06,150 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:06,157 INFO L140 encePairwiseOnDemand]: 365/379 looper letters, 37 selfloop transitions, 10 changer transitions 0/377 dead transitions. [2024-11-07 15:46:06,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 377 transitions, 858 flow [2024-11-07 15:46:06,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:06,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1086 transitions. [2024-11-07 15:46:06,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9551451187335093 [2024-11-07 15:46:06,162 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:06,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 377 transitions, 858 flow [2024-11-07 15:46:06,164 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:06,170 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 806 flow [2024-11-07 15:46:06,171 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:06,172 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -2 predicate places. [2024-11-07 15:46:06,172 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 806 flow [2024-11-07 15:46:06,173 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:06,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:06,174 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:06,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 15:46:06,174 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:06,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:06,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1043580549, now seen corresponding path program 1 times [2024-11-07 15:46:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:06,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406819632] [2024-11-07 15:46:06,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:06,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:06,371 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,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:06,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406819632] [2024-11-07 15:46:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406819632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:06,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:46:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568029000] [2024-11-07 15:46:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:06,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:06,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 379 [2024-11-07 15:46:06,390 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:06,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:06,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 379 [2024-11-07 15:46:06,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:06,725 INFO L124 PetriNetUnfolderBase]: 266/1801 cut-off events. [2024-11-07 15:46:06,725 INFO L125 PetriNetUnfolderBase]: For 119/121 co-relation queries the response was YES. [2024-11-07 15:46:06,732 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:06,738 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-07 15:46:06,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 377 transitions, 879 flow [2024-11-07 15:46:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1095 transitions. [2024-11-07 15:46:06,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630606860158312 [2024-11-07 15:46:06,741 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:06,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 377 transitions, 879 flow [2024-11-07 15:46:06,745 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:06,750 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 798 flow [2024-11-07 15:46:06,751 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:06,753 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -1 predicate places. [2024-11-07 15:46:06,753 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 798 flow [2024-11-07 15:46:06,754 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:06,754 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:06,754 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:06,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 15:46:06,754 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:06,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1070020697, now seen corresponding path program 1 times [2024-11-07 15:46:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:06,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724751609] [2024-11-07 15:46:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 15:46:06,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:06,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724751609] [2024-11-07 15:46:06,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724751609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:06,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:06,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526521800] [2024-11-07 15:46:06,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:06,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:06,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:06,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:06,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:06,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 379 [2024-11-07 15:46:06,954 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:06,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:06,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 379 [2024-11-07 15:46:06,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:07,280 INFO L124 PetriNetUnfolderBase]: 443/2130 cut-off events. [2024-11-07 15:46:07,280 INFO L125 PetriNetUnfolderBase]: For 279/326 co-relation queries the response was YES. [2024-11-07 15:46:07,287 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:07,295 INFO L140 encePairwiseOnDemand]: 372/379 looper letters, 32 selfloop transitions, 10 changer transitions 0/381 dead transitions. [2024-11-07 15:46:07,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 381 transitions, 921 flow [2024-11-07 15:46:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2024-11-07 15:46:07,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9507475813544415 [2024-11-07 15:46:07,325 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:07,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 381 transitions, 921 flow [2024-11-07 15:46:07,329 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:07,333 INFO L231 Difference]: Finished difference. Result has 364 places, 376 transitions, 882 flow [2024-11-07 15:46:07,333 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:07,334 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, 2 predicate places. [2024-11-07 15:46:07,334 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 376 transitions, 882 flow [2024-11-07 15:46:07,335 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:07,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:07,335 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:07,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 15:46:07,336 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:07,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash 662990335, now seen corresponding path program 1 times [2024-11-07 15:46:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:07,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017943468] [2024-11-07 15:46:07,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:07,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:07,492 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,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:07,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017943468] [2024-11-07 15:46:07,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017943468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:07,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:07,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:46:07,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71191255] [2024-11-07 15:46:07,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:07,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:07,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:07,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:07,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:07,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 379 [2024-11-07 15:46:07,516 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:07,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:07,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 379 [2024-11-07 15:46:07,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:07,731 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:07,733 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is cut-off event [2024-11-07 15:46:07,733 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-07 15:46:07,733 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-07 15:46:07,733 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-07 15:46:07,964 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:07,964 INFO L294 olderBase$Statistics]: this new event has 346 ancestors and is cut-off event [2024-11-07 15:46:07,964 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-07 15:46:07,965 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:07,965 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:07,971 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:07,971 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is cut-off event [2024-11-07 15:46:07,972 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-07 15:46:07,972 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:07,972 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-07 15:46:07,972 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-07 15:46:07,972 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:07,973 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-11-07 15:46:07,973 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-07 15:46:07,973 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-07 15:46:07,973 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-07 15:46:07,974 INFO L124 PetriNetUnfolderBase]: 542/2486 cut-off events. [2024-11-07 15:46:07,974 INFO L125 PetriNetUnfolderBase]: For 440/478 co-relation queries the response was YES. [2024-11-07 15:46:07,980 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:07,989 INFO L140 encePairwiseOnDemand]: 374/379 looper letters, 27 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2024-11-07 15:46:07,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 387 transitions, 966 flow [2024-11-07 15:46:07,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2024-11-07 15:46:07,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9595426561125769 [2024-11-07 15:46:07,993 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:07,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 387 transitions, 966 flow [2024-11-07 15:46:08,002 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:08,007 INFO L231 Difference]: Finished difference. Result has 366 places, 378 transitions, 886 flow [2024-11-07 15:46:08,009 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:08,011 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, 4 predicate places. [2024-11-07 15:46:08,011 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 378 transitions, 886 flow [2024-11-07 15:46:08,012 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:08,012 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:08,013 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:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 15:46:08,013 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:08,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1436826995, now seen corresponding path program 1 times [2024-11-07 15:46:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898859429] [2024-11-07 15:46:08,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:08,347 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,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:08,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898859429] [2024-11-07 15:46:08,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898859429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:08,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:08,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 15:46:08,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755821661] [2024-11-07 15:46:08,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:08,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:08,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:08,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:08,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:08,371 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 379 [2024-11-07 15:46:08,373 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:08,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:08,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 379 [2024-11-07 15:46:08,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:08,538 INFO L124 PetriNetUnfolderBase]: 51/770 cut-off events. [2024-11-07 15:46:08,538 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-07 15:46:08,540 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:08,543 INFO L140 encePairwiseOnDemand]: 371/379 looper letters, 8 selfloop transitions, 8 changer transitions 0/359 dead transitions. [2024-11-07 15:46:08,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 822 flow [2024-11-07 15:46:08,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:08,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:08,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2024-11-07 15:46:08,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621811785400176 [2024-11-07 15:46:08,547 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:08,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 822 flow [2024-11-07 15:46:08,551 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:08,556 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 768 flow [2024-11-07 15:46:08,557 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:08,557 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2024-11-07 15:46:08,557 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 768 flow [2024-11-07 15:46:08,558 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:08,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:08,558 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:08,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 15:46:08,559 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:08,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1408103733, now seen corresponding path program 1 times [2024-11-07 15:46:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984089200] [2024-11-07 15:46:08,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:08,721 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,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984089200] [2024-11-07 15:46:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984089200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884689244] [2024-11-07 15:46:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:08,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:08,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:08,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:08,755 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 379 [2024-11-07 15:46:08,757 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:08,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:08,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 379 [2024-11-07 15:46:08,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:08,902 INFO L124 PetriNetUnfolderBase]: 80/845 cut-off events. [2024-11-07 15:46:08,903 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-07 15:46:08,906 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:08,909 INFO L140 encePairwiseOnDemand]: 371/379 looper letters, 20 selfloop transitions, 4 changer transitions 3/359 dead transitions. [2024-11-07 15:46:08,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 831 flow [2024-11-07 15:46:08,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2024-11-07 15:46:08,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9428320140721196 [2024-11-07 15:46:08,912 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:08,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 831 flow [2024-11-07 15:46:08,916 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:08,919 INFO L231 Difference]: Finished difference. Result has 357 places, 351 transitions, 756 flow [2024-11-07 15:46:08,920 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:08,921 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -5 predicate places. [2024-11-07 15:46:08,921 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 351 transitions, 756 flow [2024-11-07 15:46:08,922 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:08,922 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:08,922 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:08,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 15:46:08,922 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:08,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash -64203076, now seen corresponding path program 1 times [2024-11-07 15:46:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357425404] [2024-11-07 15:46:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:09,035 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,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:09,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357425404] [2024-11-07 15:46:09,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357425404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:09,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:09,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:09,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214749082] [2024-11-07 15:46:09,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:09,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:09,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:09,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:09,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:09,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 379 [2024-11-07 15:46:09,068 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:09,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:09,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 379 [2024-11-07 15:46:09,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:09,205 INFO L124 PetriNetUnfolderBase]: 75/808 cut-off events. [2024-11-07 15:46:09,205 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-07 15:46:09,207 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:09,210 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 19 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2024-11-07 15:46:09,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 351 transitions, 799 flow [2024-11-07 15:46:09,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2024-11-07 15:46:09,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9428320140721196 [2024-11-07 15:46:09,213 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:09,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 351 transitions, 799 flow [2024-11-07 15:46:09,216 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:09,246 INFO L231 Difference]: Finished difference. Result has 353 places, 350 transitions, 750 flow [2024-11-07 15:46:09,246 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:09,247 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -9 predicate places. [2024-11-07 15:46:09,247 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 350 transitions, 750 flow [2024-11-07 15:46:09,247 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:09,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:09,248 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:09,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 15:46:09,248 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:09,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 912439908, now seen corresponding path program 1 times [2024-11-07 15:46:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221056389] [2024-11-07 15:46:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:09,366 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,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:09,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221056389] [2024-11-07 15:46:09,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221056389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:09,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 15:46:09,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 15:46:09,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368042807] [2024-11-07 15:46:09,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:09,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:09,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:09,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:09,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 15:46:09,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 379 [2024-11-07 15:46:09,402 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:09,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:09,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 379 [2024-11-07 15:46:09,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:09,518 INFO L124 PetriNetUnfolderBase]: 71/763 cut-off events. [2024-11-07 15:46:09,519 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-07 15:46:09,520 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:09,523 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 23 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2024-11-07 15:46:09,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 350 transitions, 801 flow [2024-11-07 15:46:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2024-11-07 15:46:09,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.941952506596306 [2024-11-07 15:46:09,526 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:09,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 350 transitions, 801 flow [2024-11-07 15:46:09,529 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:09,532 INFO L231 Difference]: Finished difference. Result has 352 places, 349 transitions, 748 flow [2024-11-07 15:46:09,533 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:09,534 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -10 predicate places. [2024-11-07 15:46:09,534 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 748 flow [2024-11-07 15:46:09,535 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:09,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:09,535 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:09,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 15:46:09,535 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:09,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:09,536 INFO L85 PathProgramCache]: Analyzing trace with hash 216970297, now seen corresponding path program 1 times [2024-11-07 15:46:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347185586] [2024-11-07 15:46:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:09,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:09,799 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:09,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347185586] [2024-11-07 15:46:09,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347185586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:46:09,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536306321] [2024-11-07 15:46:09,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:09,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:09,803 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:09,805 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:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:10,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:46:10,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:46:10,178 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:10,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:46:10,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536306321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:10,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:46:10,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:46:10,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578357540] [2024-11-07 15:46:10,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:10,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:10,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:46:10,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 379 [2024-11-07 15:46:10,211 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:10,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:10,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 379 [2024-11-07 15:46:10,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:10,359 INFO L124 PetriNetUnfolderBase]: 92/891 cut-off events. [2024-11-07 15:46:10,359 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-07 15:46:10,362 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:10,365 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 23 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2024-11-07 15:46:10,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 353 transitions, 811 flow [2024-11-07 15:46:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1076 transitions. [2024-11-07 15:46:10,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9463500439753738 [2024-11-07 15:46:10,368 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:10,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 353 transitions, 811 flow [2024-11-07 15:46:10,371 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:10,374 INFO L231 Difference]: Finished difference. Result has 351 places, 348 transitions, 746 flow [2024-11-07 15:46:10,375 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:10,376 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -11 predicate places. [2024-11-07 15:46:10,376 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 348 transitions, 746 flow [2024-11-07 15:46:10,377 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:10,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:10,377 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:10,397 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:10,578 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:10,578 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:10,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -433418165, now seen corresponding path program 1 times [2024-11-07 15:46:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:10,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64951824] [2024-11-07 15:46:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:10,814 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:10,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:10,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64951824] [2024-11-07 15:46:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64951824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:46:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613470511] [2024-11-07 15:46:10,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:10,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:10,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:10,819 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:10,822 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:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:11,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:46:11,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:46:11,187 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,188 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:46:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613470511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:11,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:46:11,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:46:11,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24363189] [2024-11-07 15:46:11,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:11,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:46:11,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 379 [2024-11-07 15:46:11,202 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:11,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:11,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 379 [2024-11-07 15:46:11,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:11,367 INFO L124 PetriNetUnfolderBase]: 81/842 cut-off events. [2024-11-07 15:46:11,368 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-07 15:46:11,370 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:11,372 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 20 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2024-11-07 15:46:11,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 352 transitions, 803 flow [2024-11-07 15:46:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:11,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2024-11-07 15:46:11,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9542656112576957 [2024-11-07 15:46:11,376 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:11,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 352 transitions, 803 flow [2024-11-07 15:46:11,379 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:11,384 INFO L231 Difference]: Finished difference. Result has 350 places, 347 transitions, 744 flow [2024-11-07 15:46:11,385 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:11,387 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -12 predicate places. [2024-11-07 15:46:11,387 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 347 transitions, 744 flow [2024-11-07 15:46:11,388 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:11,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-07 15:46:11,388 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:11,406 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:11,588 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:11,589 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:11,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 15:46:11,590 INFO L85 PathProgramCache]: Analyzing trace with hash 816575416, now seen corresponding path program 1 times [2024-11-07 15:46:11,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 15:46:11,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258528120] [2024-11-07 15:46:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:11,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 15:46:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:11,852 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:11,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 15:46:11,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258528120] [2024-11-07 15:46:11,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258528120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 15:46:11,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223527542] [2024-11-07 15:46:11,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 15:46:11,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 15:46:11,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 15:46:11,855 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:11,857 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:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 15:46:12,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 15:46:12,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 15:46:12,222 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:12,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 15:46:12,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223527542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 15:46:12,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 15:46:12,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-07 15:46:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580872988] [2024-11-07 15:46:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 15:46:12,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 15:46:12,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 15:46:12,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 15:46:12,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 15:46:12,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 379 [2024-11-07 15:46:12,235 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:12,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-07 15:46:12,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 379 [2024-11-07 15:46:12,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-07 15:46:12,361 INFO L124 PetriNetUnfolderBase]: 58/761 cut-off events. [2024-11-07 15:46:12,362 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-07 15:46:12,364 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:12,365 INFO L140 encePairwiseOnDemand]: 377/379 looper letters, 0 selfloop transitions, 0 changer transitions 346/346 dead transitions. [2024-11-07 15:46:12,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 346 transitions, 770 flow [2024-11-07 15:46:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 15:46:12,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-07 15:46:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1083 transitions. [2024-11-07 15:46:12,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9525065963060686 [2024-11-07 15:46:12,369 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:12,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 346 transitions, 770 flow [2024-11-07 15:46:12,372 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:12,375 INFO L231 Difference]: Finished difference. Result has 349 places, 0 transitions, 0 flow [2024-11-07 15:46:12,375 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:12,376 INFO L277 CegarLoopForPetriNet]: 362 programPoint places, -13 predicate places. [2024-11-07 15:46:12,376 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 0 transitions, 0 flow [2024-11-07 15:46:12,377 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:12,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2024-11-07 15:46:12,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2024-11-07 15:46:12,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2024-11-07 15:46:12,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2024-11-07 15:46:12,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2024-11-07 15:46:12,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2024-11-07 15:46:12,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2024-11-07 15:46:12,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2024-11-07 15:46:12,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2024-11-07 15:46:12,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2024-11-07 15:46:12,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2024-11-07 15:46:12,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2024-11-07 15:46:12,403 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:12,587 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:12,588 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 15:46:12,594 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-07 15:46:12,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 15:46:12,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:46:12 BasicIcfg [2024-11-07 15:46:12,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 15:46:12,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 15:46:12,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 15:46:12,603 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 15:46:12,604 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:03" (3/4) ... [2024-11-07 15:46:12,606 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 15:46:12,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-07 15:46:12,608 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-07 15:46:12,614 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-07 15:46:12,615 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-07 15:46:12,615 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 15:46:12,616 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 15:46:12,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 15:46:12,692 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 15:46:12,692 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 15:46:12,695 INFO L158 Benchmark]: Toolchain (without parser) took 10207.11ms. Allocated memory was 100.7MB in the beginning and 578.8MB in the end (delta: 478.2MB). Free memory was 75.4MB in the beginning and 252.3MB in the end (delta: -177.0MB). Peak memory consumption was 298.3MB. Max. memory is 16.1GB. [2024-11-07 15:46:12,696 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:46:12,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.15ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 47.5MB in the end (delta: 27.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 15:46:12,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.12ms. Allocated memory is still 100.7MB. Free memory was 47.5MB in the beginning and 44.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:46:12,697 INFO L158 Benchmark]: Boogie Preprocessor took 49.83ms. Allocated memory is still 100.7MB. Free memory was 44.7MB in the beginning and 42.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 15:46:12,697 INFO L158 Benchmark]: RCFGBuilder took 664.02ms. Allocated memory is still 100.7MB. Free memory was 42.3MB in the beginning and 52.5MB in the end (delta: -10.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-07 15:46:12,698 INFO L158 Benchmark]: TraceAbstraction took 8844.19ms. Allocated memory was 100.7MB in the beginning and 578.8MB in the end (delta: 478.2MB). Free memory was 52.0MB in the beginning and 260.0MB in the end (delta: -208.0MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. [2024-11-07 15:46:12,698 INFO L158 Benchmark]: Witness Printer took 89.45ms. Allocated memory is still 578.8MB. Free memory was 260.0MB in the beginning and 252.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 15:46:12,700 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.24ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 490.15ms. Allocated memory is still 100.7MB. Free memory was 75.2MB in the beginning and 47.5MB in the end (delta: 27.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.12ms. Allocated memory is still 100.7MB. Free memory was 47.5MB in the beginning and 44.7MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.83ms. Allocated memory is still 100.7MB. Free memory was 44.7MB in the beginning and 42.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 664.02ms. Allocated memory is still 100.7MB. Free memory was 42.3MB in the beginning and 52.5MB in the end (delta: -10.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8844.19ms. Allocated memory was 100.7MB in the beginning and 578.8MB in the end (delta: 478.2MB). Free memory was 52.0MB in the beginning and 260.0MB in the end (delta: -208.0MB). Peak memory consumption was 268.2MB. Max. memory is 16.1GB. * Witness Printer took 89.45ms. Allocated memory is still 578.8MB. Free memory was 260.0MB in the beginning and 252.3MB in the end (delta: 7.7MB). 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.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.6s 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.7s 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:12,726 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