./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:07,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:07,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:07,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:07,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:07,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:07,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:07,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:07,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:07,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:07,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:07,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:07,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:07,614 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:07,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:07,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:07,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:07,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:07,616 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 -> 5bb11505151393f96d52a572beff0352326876d897656a8082ae272a8f39e0b4 [2025-02-08 05:37:07,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:07,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:07,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:07,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:07,834 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:07,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-08 05:37:09,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/547266259/88c325bd5e4f4b4d9c96caa3b42e3f04/FLAG3c4fcf111 [2025-02-08 05:37:09,320 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:09,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-trans.wvr.c [2025-02-08 05:37:09,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/547266259/88c325bd5e4f4b4d9c96caa3b42e3f04/FLAG3c4fcf111 [2025-02-08 05:37:09,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/547266259/88c325bd5e4f4b4d9c96caa3b42e3f04 [2025-02-08 05:37:09,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:09,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:09,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:09,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:09,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:09,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@369fb0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09, skipping insertion in model container [2025-02-08 05:37:09,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:09,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:09,775 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:09,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:09,807 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:09,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09 WrapperNode [2025-02-08 05:37:09,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:09,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:09,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:09,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:09,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,842 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 472 [2025-02-08 05:37:09,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:09,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:09,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:09,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:09,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:09,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:09,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:09,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:09,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:09,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:09,907 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) [2025-02-08 05:37:09,909 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 [2025-02-08 05:37:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:09,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:09,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:09,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:09,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:09,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:09,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:09,926 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:09,999 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:10,001 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: havoc #t~nondet8#1; [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-1: havoc #t~ret7#1; [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-2: havoc #t~mem6#1; [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: assume #race~res1~0 == #t~nondet8#1; [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-3: assume !(#race~res1~0 == #t~nondet8#1); [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-4: havoc #t~mem5#1; [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-5: #race~res1~0 := #t~nondet8#1; [2025-02-08 05:37:10,210 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-6: havoc #t~nondet8#1; [2025-02-08 05:37:10,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-7: ~res1~0 := #t~ret7#1; [2025-02-08 05:37:10,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 05:37:10,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:10,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:10,211 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: #t~ret7#1 := minus_#res#1; [2025-02-08 05:37:10,323 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: havoc #t~nondet17#1; [2025-02-08 05:37:10,323 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: havoc #t~ret16#1; [2025-02-08 05:37:10,323 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-2: havoc #t~mem15#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: assume #race~res2~0 == #t~nondet17#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-3: assume !(#race~res2~0 == #t~nondet17#1); [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-4: havoc #t~mem14#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-5: #race~res2~0 := #t~nondet17#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-6: havoc #t~nondet17#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-7: ~res2~0 := #t~ret16#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:10,324 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-11: #t~ret16#1 := minus_#res#1; [2025-02-08 05:37:10,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80: havoc #t~nondet26#1; [2025-02-08 05:37:10,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-1: havoc #t~ret25#1; [2025-02-08 05:37:10,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-2: havoc #t~mem24#1; [2025-02-08 05:37:10,416 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: assume #race~res3~0 == #t~nondet26#1; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-3: assume !(#race~res3~0 == #t~nondet26#1); [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-4: havoc #t~mem23#1; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-5: #race~res3~0 := #t~nondet26#1; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-6: havoc #t~nondet26#1; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-7: ~res3~0 := #t~ret25#1; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:10,417 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L80-11: #t~ret25#1 := minus_#res#1; [2025-02-08 05:37:10,614 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:10,614 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:10,638 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:10,638 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:10,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:10 BoogieIcfgContainer [2025-02-08 05:37:10,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:10,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:10,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:10,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:10,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:09" (1/3) ... [2025-02-08 05:37:10,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c42c71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:10, skipping insertion in model container [2025-02-08 05:37:10,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (2/3) ... [2025-02-08 05:37:10,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c42c71c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:10, skipping insertion in model container [2025-02-08 05:37:10,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:10" (3/3) ... [2025-02-08 05:37:10,646 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-trans.wvr.c [2025-02-08 05:37:10,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:10,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-trans.wvr.c that has 4 procedures, 554 locations, 1 initial locations, 6 loop locations, and 57 error locations. [2025-02-08 05:37:10,658 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:10,817 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:10,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 563 places, 580 transitions, 1181 flow [2025-02-08 05:37:11,063 INFO L124 PetriNetUnfolderBase]: 27/577 cut-off events. [2025-02-08 05:37:11,066 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:11,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 577 events. 27/577 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1399 event pairs, 0 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 438. Up to 2 conditions per place. [2025-02-08 05:37:11,080 INFO L82 GeneralOperation]: Start removeDead. Operand has 563 places, 580 transitions, 1181 flow [2025-02-08 05:37:11,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 541 places, 556 transitions, 1130 flow [2025-02-08 05:37:11,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:11,111 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;@55e4d452, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:11,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2025-02-08 05:37:11,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:11,120 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-02-08 05:37:11,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:11,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,121 INFO L206 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] [2025-02-08 05:37:11,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:11,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash -77597201, now seen corresponding path program 1 times [2025-02-08 05:37:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934392772] [2025-02-08 05:37:11,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:37:11,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:37:11,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934392772] [2025-02-08 05:37:11,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934392772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211205110] [2025-02-08 05:37:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 580 [2025-02-08 05:37:11,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 556 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 546.3333333333334) internal successors, (1639), 3 states have internal predecessors, (1639), 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) [2025-02-08 05:37:11,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 580 [2025-02-08 05:37:11,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,589 INFO L124 PetriNetUnfolderBase]: 30/944 cut-off events. [2025-02-08 05:37:11,590 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:37:11,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 944 events. 30/944 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4193 event pairs, 12 based on Foata normal form. 31/823 useless extension candidates. Maximal degree in co-relation 741. Up to 39 conditions per place. [2025-02-08 05:37:11,604 INFO L140 encePairwiseOnDemand]: 562/580 looper letters, 14 selfloop transitions, 2 changer transitions 6/540 dead transitions. [2025-02-08 05:37:11,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 540 transitions, 1130 flow [2025-02-08 05:37:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1667 transitions. [2025-02-08 05:37:11,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9580459770114943 [2025-02-08 05:37:11,623 INFO L175 Difference]: Start difference. First operand has 541 places, 556 transitions, 1130 flow. Second operand 3 states and 1667 transitions. [2025-02-08 05:37:11,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 540 transitions, 1130 flow [2025-02-08 05:37:11,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 540 transitions, 1118 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:11,643 INFO L231 Difference]: Finished difference. Result has 536 places, 534 transitions, 1078 flow [2025-02-08 05:37:11,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1078, PETRI_PLACES=536, PETRI_TRANSITIONS=534} [2025-02-08 05:37:11,649 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -5 predicate places. [2025-02-08 05:37:11,651 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 534 transitions, 1078 flow [2025-02-08 05:37:11,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.3333333333334) internal successors, (1639), 3 states have internal predecessors, (1639), 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) [2025-02-08 05:37:11,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,652 INFO L206 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] [2025-02-08 05:37:11,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:11,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:11,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash 284555958, now seen corresponding path program 1 times [2025-02-08 05:37:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403880664] [2025-02-08 05:37:11,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:37:11,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:37:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403880664] [2025-02-08 05:37:11,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403880664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49620181] [2025-02-08 05:37:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:11,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:11,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 580 [2025-02-08 05:37:11,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 534 transitions, 1078 flow. Second operand has 3 states, 3 states have (on average 546.3333333333334) internal successors, (1639), 3 states have internal predecessors, (1639), 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) [2025-02-08 05:37:11,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 580 [2025-02-08 05:37:11,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:11,955 INFO L124 PetriNetUnfolderBase]: 46/1317 cut-off events. [2025-02-08 05:37:11,955 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:11,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1317 events. 46/1317 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7310 event pairs, 20 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 1353. Up to 51 conditions per place. [2025-02-08 05:37:11,968 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 14 selfloop transitions, 2 changer transitions 0/533 dead transitions. [2025-02-08 05:37:11,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 533 transitions, 1108 flow [2025-02-08 05:37:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-02-08 05:37:11,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9494252873563218 [2025-02-08 05:37:11,971 INFO L175 Difference]: Start difference. First operand has 536 places, 534 transitions, 1078 flow. Second operand 3 states and 1652 transitions. [2025-02-08 05:37:11,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 533 transitions, 1108 flow [2025-02-08 05:37:11,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 533 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:11,978 INFO L231 Difference]: Finished difference. Result has 529 places, 533 transitions, 1076 flow [2025-02-08 05:37:11,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1076, PETRI_PLACES=529, PETRI_TRANSITIONS=533} [2025-02-08 05:37:11,980 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -12 predicate places. [2025-02-08 05:37:11,980 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 533 transitions, 1076 flow [2025-02-08 05:37:11,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.3333333333334) internal successors, (1639), 3 states have internal predecessors, (1639), 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) [2025-02-08 05:37:11,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:11,981 INFO L206 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] [2025-02-08 05:37:11,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:11,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:11,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash -555080215, now seen corresponding path program 1 times [2025-02-08 05:37:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:11,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045247975] [2025-02-08 05:37:11,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:11,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 05:37:11,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 05:37:11,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:11,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045247975] [2025-02-08 05:37:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045247975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060802387] [2025-02-08 05:37:12,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 580 [2025-02-08 05:37:12,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 533 transitions, 1076 flow. Second operand has 3 states, 3 states have (on average 546.3333333333334) internal successors, (1639), 3 states have internal predecessors, (1639), 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) [2025-02-08 05:37:12,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 580 [2025-02-08 05:37:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,276 INFO L124 PetriNetUnfolderBase]: 46/1304 cut-off events. [2025-02-08 05:37:12,276 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-02-08 05:37:12,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 1304 events. 46/1304 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6865 event pairs, 20 based on Foata normal form. 0/1094 useless extension candidates. Maximal degree in co-relation 1324. Up to 51 conditions per place. [2025-02-08 05:37:12,294 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 14 selfloop transitions, 2 changer transitions 0/532 dead transitions. [2025-02-08 05:37:12,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 532 transitions, 1106 flow [2025-02-08 05:37:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-02-08 05:37:12,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9494252873563218 [2025-02-08 05:37:12,298 INFO L175 Difference]: Start difference. First operand has 529 places, 533 transitions, 1076 flow. Second operand 3 states and 1652 transitions. [2025-02-08 05:37:12,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 532 transitions, 1106 flow [2025-02-08 05:37:12,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 532 transitions, 1102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,305 INFO L231 Difference]: Finished difference. Result has 528 places, 532 transitions, 1074 flow [2025-02-08 05:37:12,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=528, PETRI_TRANSITIONS=532} [2025-02-08 05:37:12,306 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -13 predicate places. [2025-02-08 05:37:12,306 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 532 transitions, 1074 flow [2025-02-08 05:37:12,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 546.3333333333334) internal successors, (1639), 3 states have internal predecessors, (1639), 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) [2025-02-08 05:37:12,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,307 INFO L206 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] [2025-02-08 05:37:12,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:12,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:12,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1903010318, now seen corresponding path program 1 times [2025-02-08 05:37:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911278379] [2025-02-08 05:37:12,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:12,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:12,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911278379] [2025-02-08 05:37:12,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911278379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100046658] [2025-02-08 05:37:12,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 580 [2025-02-08 05:37:12,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 532 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 542.0) internal successors, (1626), 3 states have internal predecessors, (1626), 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) [2025-02-08 05:37:12,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 580 [2025-02-08 05:37:12,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,606 INFO L124 PetriNetUnfolderBase]: 58/1319 cut-off events. [2025-02-08 05:37:12,606 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:37:12,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 1319 events. 58/1319 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7433 event pairs, 32 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 1366. Up to 80 conditions per place. [2025-02-08 05:37:12,625 INFO L140 encePairwiseOnDemand]: 574/580 looper letters, 16 selfloop transitions, 1 changer transitions 0/527 dead transitions. [2025-02-08 05:37:12,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 527 transitions, 1098 flow [2025-02-08 05:37:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1645 transitions. [2025-02-08 05:37:12,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454022988505747 [2025-02-08 05:37:12,628 INFO L175 Difference]: Start difference. First operand has 528 places, 532 transitions, 1074 flow. Second operand 3 states and 1645 transitions. [2025-02-08 05:37:12,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 527 transitions, 1098 flow [2025-02-08 05:37:12,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 527 transitions, 1094 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,636 INFO L231 Difference]: Finished difference. Result has 523 places, 527 transitions, 1062 flow [2025-02-08 05:37:12,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1062, PETRI_PLACES=523, PETRI_TRANSITIONS=527} [2025-02-08 05:37:12,637 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -18 predicate places. [2025-02-08 05:37:12,638 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 527 transitions, 1062 flow [2025-02-08 05:37:12,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.0) internal successors, (1626), 3 states have internal predecessors, (1626), 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) [2025-02-08 05:37:12,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,639 INFO L206 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] [2025-02-08 05:37:12,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:12,639 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:12,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 516729067, now seen corresponding path program 1 times [2025-02-08 05:37:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092648830] [2025-02-08 05:37:12,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:12,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:12,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:13,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092648830] [2025-02-08 05:37:13,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092648830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:13,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59409093] [2025-02-08 05:37:13,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:13,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:13,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:13,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 467 out of 580 [2025-02-08 05:37:13,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 527 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 468.5) internal successors, (2811), 6 states have internal predecessors, (2811), 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) [2025-02-08 05:37:13,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 467 of 580 [2025-02-08 05:37:13,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,056 INFO L124 PetriNetUnfolderBase]: 11574/45306 cut-off events. [2025-02-08 05:37:19,057 INFO L125 PetriNetUnfolderBase]: For 611/613 co-relation queries the response was YES. [2025-02-08 05:37:19,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62499 conditions, 45306 events. 11574/45306 cut-off events. For 611/613 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 598303 event pairs, 10080 based on Foata normal form. 0/39019 useless extension candidates. Maximal degree in co-relation 62450. Up to 16868 conditions per place. [2025-02-08 05:37:19,412 INFO L140 encePairwiseOnDemand]: 562/580 looper letters, 78 selfloop transitions, 15 changer transitions 0/524 dead transitions. [2025-02-08 05:37:19,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 524 transitions, 1242 flow [2025-02-08 05:37:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2898 transitions. [2025-02-08 05:37:19,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8327586206896552 [2025-02-08 05:37:19,418 INFO L175 Difference]: Start difference. First operand has 523 places, 527 transitions, 1062 flow. Second operand 6 states and 2898 transitions. [2025-02-08 05:37:19,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 524 transitions, 1242 flow [2025-02-08 05:37:19,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 524 transitions, 1241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:19,428 INFO L231 Difference]: Finished difference. Result has 524 places, 524 transitions, 1085 flow [2025-02-08 05:37:19,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1085, PETRI_PLACES=524, PETRI_TRANSITIONS=524} [2025-02-08 05:37:19,430 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -17 predicate places. [2025-02-08 05:37:19,430 INFO L471 AbstractCegarLoop]: Abstraction has has 524 places, 524 transitions, 1085 flow [2025-02-08 05:37:19,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 468.5) internal successors, (2811), 6 states have internal predecessors, (2811), 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) [2025-02-08 05:37:19,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,433 INFO L206 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] [2025-02-08 05:37:19,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:19,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:19,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash -222470273, now seen corresponding path program 1 times [2025-02-08 05:37:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159528735] [2025-02-08 05:37:19,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 05:37:19,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 05:37:19,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:19,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159528735] [2025-02-08 05:37:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159528735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673910204] [2025-02-08 05:37:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:19,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:19,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 580 [2025-02-08 05:37:19,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 524 transitions, 1085 flow. Second operand has 3 states, 3 states have (on average 547.3333333333334) internal successors, (1642), 3 states have internal predecessors, (1642), 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) [2025-02-08 05:37:19,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 580 [2025-02-08 05:37:19,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,647 INFO L124 PetriNetUnfolderBase]: 30/949 cut-off events. [2025-02-08 05:37:19,648 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:37:19,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 949 events. 30/949 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4064 event pairs, 12 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 966. Up to 38 conditions per place. [2025-02-08 05:37:19,660 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 13 selfloop transitions, 2 changer transitions 0/523 dead transitions. [2025-02-08 05:37:19,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 523 transitions, 1113 flow [2025-02-08 05:37:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:19,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1654 transitions. [2025-02-08 05:37:19,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9505747126436782 [2025-02-08 05:37:19,663 INFO L175 Difference]: Start difference. First operand has 524 places, 524 transitions, 1085 flow. Second operand 3 states and 1654 transitions. [2025-02-08 05:37:19,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 523 transitions, 1113 flow [2025-02-08 05:37:19,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 523 transitions, 1083 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:19,672 INFO L231 Difference]: Finished difference. Result has 520 places, 523 transitions, 1057 flow [2025-02-08 05:37:19,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1057, PETRI_PLACES=520, PETRI_TRANSITIONS=523} [2025-02-08 05:37:19,675 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -21 predicate places. [2025-02-08 05:37:19,675 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 523 transitions, 1057 flow [2025-02-08 05:37:19,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.3333333333334) internal successors, (1642), 3 states have internal predecessors, (1642), 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) [2025-02-08 05:37:19,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,676 INFO L206 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] [2025-02-08 05:37:19,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:19,677 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1883617713, now seen corresponding path program 1 times [2025-02-08 05:37:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202173] [2025-02-08 05:37:19,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:19,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:19,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202173] [2025-02-08 05:37:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660243852] [2025-02-08 05:37:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:19,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:19,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 580 [2025-02-08 05:37:19,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 523 transitions, 1057 flow. Second operand has 3 states, 3 states have (on average 542.0) internal successors, (1626), 3 states have internal predecessors, (1626), 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) [2025-02-08 05:37:19,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 580 [2025-02-08 05:37:19,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:20,108 INFO L124 PetriNetUnfolderBase]: 116/2201 cut-off events. [2025-02-08 05:37:20,109 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:37:20,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 2201 events. 116/2201 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 16254 event pairs, 64 based on Foata normal form. 0/1868 useless extension candidates. Maximal degree in co-relation 2330. Up to 141 conditions per place. [2025-02-08 05:37:20,140 INFO L140 encePairwiseOnDemand]: 574/580 looper letters, 16 selfloop transitions, 1 changer transitions 0/518 dead transitions. [2025-02-08 05:37:20,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 518 transitions, 1081 flow [2025-02-08 05:37:20,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1645 transitions. [2025-02-08 05:37:20,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454022988505747 [2025-02-08 05:37:20,146 INFO L175 Difference]: Start difference. First operand has 520 places, 523 transitions, 1057 flow. Second operand 3 states and 1645 transitions. [2025-02-08 05:37:20,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 518 transitions, 1081 flow [2025-02-08 05:37:20,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 518 transitions, 1077 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:20,155 INFO L231 Difference]: Finished difference. Result has 515 places, 518 transitions, 1045 flow [2025-02-08 05:37:20,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=515, PETRI_TRANSITIONS=518} [2025-02-08 05:37:20,169 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -26 predicate places. [2025-02-08 05:37:20,169 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 518 transitions, 1045 flow [2025-02-08 05:37:20,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.0) internal successors, (1626), 3 states have internal predecessors, (1626), 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) [2025-02-08 05:37:20,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:20,172 INFO L206 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] [2025-02-08 05:37:20,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:20,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1664000576, now seen corresponding path program 1 times [2025-02-08 05:37:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283819083] [2025-02-08 05:37:20,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:37:20,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:37:20,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:20,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283819083] [2025-02-08 05:37:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283819083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170936845] [2025-02-08 05:37:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:20,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:20,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 580 [2025-02-08 05:37:20,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 518 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 547.3333333333334) internal successors, (1642), 3 states have internal predecessors, (1642), 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) [2025-02-08 05:37:20,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 580 [2025-02-08 05:37:20,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:20,460 INFO L124 PetriNetUnfolderBase]: 50/1545 cut-off events. [2025-02-08 05:37:20,461 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-02-08 05:37:20,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 1545 events. 50/1545 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8259 event pairs, 20 based on Foata normal form. 0/1320 useless extension candidates. Maximal degree in co-relation 1564. Up to 50 conditions per place. [2025-02-08 05:37:20,475 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 13 selfloop transitions, 2 changer transitions 0/517 dead transitions. [2025-02-08 05:37:20,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 517 transitions, 1073 flow [2025-02-08 05:37:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1654 transitions. [2025-02-08 05:37:20,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9505747126436782 [2025-02-08 05:37:20,478 INFO L175 Difference]: Start difference. First operand has 515 places, 518 transitions, 1045 flow. Second operand 3 states and 1654 transitions. [2025-02-08 05:37:20,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 517 transitions, 1073 flow [2025-02-08 05:37:20,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 517 transitions, 1072 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:20,486 INFO L231 Difference]: Finished difference. Result has 515 places, 517 transitions, 1046 flow [2025-02-08 05:37:20,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1046, PETRI_PLACES=515, PETRI_TRANSITIONS=517} [2025-02-08 05:37:20,489 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -26 predicate places. [2025-02-08 05:37:20,489 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 517 transitions, 1046 flow [2025-02-08 05:37:20,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.3333333333334) internal successors, (1642), 3 states have internal predecessors, (1642), 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) [2025-02-08 05:37:20,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:20,491 INFO L206 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] [2025-02-08 05:37:20,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:20,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:20,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:20,492 INFO L85 PathProgramCache]: Analyzing trace with hash -154166825, now seen corresponding path program 1 times [2025-02-08 05:37:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:20,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711930327] [2025-02-08 05:37:20,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:37:20,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:37:20,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:20,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:20,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711930327] [2025-02-08 05:37:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711930327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:20,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468671215] [2025-02-08 05:37:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:20,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:20,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 580 [2025-02-08 05:37:20,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 517 transitions, 1046 flow. Second operand has 3 states, 3 states have (on average 542.0) internal successors, (1626), 3 states have internal predecessors, (1626), 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) [2025-02-08 05:37:20,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 580 [2025-02-08 05:37:20,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,078 INFO L124 PetriNetUnfolderBase]: 116/2161 cut-off events. [2025-02-08 05:37:21,079 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2025-02-08 05:37:21,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 2161 events. 116/2161 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 15471 event pairs, 64 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 2267. Up to 141 conditions per place. [2025-02-08 05:37:21,104 INFO L140 encePairwiseOnDemand]: 574/580 looper letters, 16 selfloop transitions, 1 changer transitions 0/512 dead transitions. [2025-02-08 05:37:21,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 512 transitions, 1070 flow [2025-02-08 05:37:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1645 transitions. [2025-02-08 05:37:21,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454022988505747 [2025-02-08 05:37:21,107 INFO L175 Difference]: Start difference. First operand has 515 places, 517 transitions, 1046 flow. Second operand 3 states and 1645 transitions. [2025-02-08 05:37:21,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 512 transitions, 1070 flow [2025-02-08 05:37:21,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 512 transitions, 1066 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,112 INFO L231 Difference]: Finished difference. Result has 510 places, 512 transitions, 1034 flow [2025-02-08 05:37:21,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=512, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1034, PETRI_PLACES=510, PETRI_TRANSITIONS=512} [2025-02-08 05:37:21,113 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -31 predicate places. [2025-02-08 05:37:21,113 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 512 transitions, 1034 flow [2025-02-08 05:37:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.0) internal successors, (1626), 3 states have internal predecessors, (1626), 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) [2025-02-08 05:37:21,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,114 INFO L206 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] [2025-02-08 05:37:21,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:21,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:21,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2111694180, now seen corresponding path program 1 times [2025-02-08 05:37:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906169335] [2025-02-08 05:37:21,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-08 05:37:21,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-08 05:37:21,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906169335] [2025-02-08 05:37:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906169335] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144423074] [2025-02-08 05:37:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 580 [2025-02-08 05:37:21,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 512 transitions, 1034 flow. Second operand has 3 states, 3 states have (on average 547.3333333333334) internal successors, (1642), 3 states have internal predecessors, (1642), 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) [2025-02-08 05:37:21,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 580 [2025-02-08 05:37:21,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,338 INFO L124 PetriNetUnfolderBase]: 34/737 cut-off events. [2025-02-08 05:37:21,338 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-02-08 05:37:21,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 737 events. 34/737 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2630 event pairs, 20 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 749. Up to 50 conditions per place. [2025-02-08 05:37:21,347 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 13 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-02-08 05:37:21,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 511 transitions, 1062 flow [2025-02-08 05:37:21,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1654 transitions. [2025-02-08 05:37:21,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9505747126436782 [2025-02-08 05:37:21,353 INFO L175 Difference]: Start difference. First operand has 510 places, 512 transitions, 1034 flow. Second operand 3 states and 1654 transitions. [2025-02-08 05:37:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 511 transitions, 1062 flow [2025-02-08 05:37:21,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 510 places, 511 transitions, 1061 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:21,359 INFO L231 Difference]: Finished difference. Result has 510 places, 511 transitions, 1035 flow [2025-02-08 05:37:21,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1035, PETRI_PLACES=510, PETRI_TRANSITIONS=511} [2025-02-08 05:37:21,360 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -31 predicate places. [2025-02-08 05:37:21,360 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 511 transitions, 1035 flow [2025-02-08 05:37:21,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 547.3333333333334) internal successors, (1642), 3 states have internal predecessors, (1642), 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) [2025-02-08 05:37:21,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,361 INFO L206 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] [2025-02-08 05:37:21,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:21,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:21,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 211776886, now seen corresponding path program 1 times [2025-02-08 05:37:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701164132] [2025-02-08 05:37:21,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 05:37:21,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 05:37:21,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701164132] [2025-02-08 05:37:21,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701164132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009443131] [2025-02-08 05:37:21,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 580 [2025-02-08 05:37:21,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 511 transitions, 1035 flow. Second operand has 3 states, 3 states have (on average 552.3333333333334) internal successors, (1657), 3 states have internal predecessors, (1657), 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) [2025-02-08 05:37:21,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 580 [2025-02-08 05:37:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,525 INFO L124 PetriNetUnfolderBase]: 26/889 cut-off events. [2025-02-08 05:37:21,525 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:37:21,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 935 conditions, 889 events. 26/889 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3837 event pairs, 4 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 886. Up to 18 conditions per place. [2025-02-08 05:37:21,534 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 11 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2025-02-08 05:37:21,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 512 transitions, 1065 flow [2025-02-08 05:37:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1667 transitions. [2025-02-08 05:37:21,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9580459770114943 [2025-02-08 05:37:21,536 INFO L175 Difference]: Start difference. First operand has 510 places, 511 transitions, 1035 flow. Second operand 3 states and 1667 transitions. [2025-02-08 05:37:21,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 512 transitions, 1065 flow [2025-02-08 05:37:21,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 512 transitions, 1061 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,542 INFO L231 Difference]: Finished difference. Result has 509 places, 510 transitions, 1033 flow [2025-02-08 05:37:21,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1033, PETRI_PLACES=509, PETRI_TRANSITIONS=510} [2025-02-08 05:37:21,543 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -32 predicate places. [2025-02-08 05:37:21,543 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 510 transitions, 1033 flow [2025-02-08 05:37:21,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.3333333333334) internal successors, (1657), 3 states have internal predecessors, (1657), 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) [2025-02-08 05:37:21,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,544 INFO L206 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] [2025-02-08 05:37:21,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:21,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:21,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1230132443, now seen corresponding path program 1 times [2025-02-08 05:37:21,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363828577] [2025-02-08 05:37:21,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 05:37:21,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 05:37:21,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:21,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363828577] [2025-02-08 05:37:21,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363828577] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963795215] [2025-02-08 05:37:21,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 580 [2025-02-08 05:37:21,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 510 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 552.6666666666666) internal successors, (1658), 3 states have internal predecessors, (1658), 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) [2025-02-08 05:37:21,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 580 [2025-02-08 05:37:21,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,689 INFO L124 PetriNetUnfolderBase]: 24/788 cut-off events. [2025-02-08 05:37:21,690 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2025-02-08 05:37:21,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 788 events. 24/788 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2960 event pairs, 4 based on Foata normal form. 1/702 useless extension candidates. Maximal degree in co-relation 781. Up to 18 conditions per place. [2025-02-08 05:37:21,699 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 11 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-02-08 05:37:21,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 511 transitions, 1063 flow [2025-02-08 05:37:21,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1667 transitions. [2025-02-08 05:37:21,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9580459770114943 [2025-02-08 05:37:21,702 INFO L175 Difference]: Start difference. First operand has 509 places, 510 transitions, 1033 flow. Second operand 3 states and 1667 transitions. [2025-02-08 05:37:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 511 transitions, 1063 flow [2025-02-08 05:37:21,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 511 transitions, 1059 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,708 INFO L231 Difference]: Finished difference. Result has 508 places, 509 transitions, 1031 flow [2025-02-08 05:37:21,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1031, PETRI_PLACES=508, PETRI_TRANSITIONS=509} [2025-02-08 05:37:21,710 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -33 predicate places. [2025-02-08 05:37:21,710 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 509 transitions, 1031 flow [2025-02-08 05:37:21,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.6666666666666) internal successors, (1658), 3 states have internal predecessors, (1658), 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) [2025-02-08 05:37:21,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,711 INFO L206 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] [2025-02-08 05:37:21,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:21,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:21,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,712 INFO L85 PathProgramCache]: Analyzing trace with hash -224606481, now seen corresponding path program 1 times [2025-02-08 05:37:21,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025749781] [2025-02-08 05:37:21,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:37:21,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:37:21,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:21,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025749781] [2025-02-08 05:37:21,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025749781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258056763] [2025-02-08 05:37:21,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 580 [2025-02-08 05:37:21,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 509 transitions, 1031 flow. Second operand has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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) [2025-02-08 05:37:21,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 580 [2025-02-08 05:37:21,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,863 INFO L124 PetriNetUnfolderBase]: 34/892 cut-off events. [2025-02-08 05:37:21,863 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2025-02-08 05:37:21,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 892 events. 34/892 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3790 event pairs, 12 based on Foata normal form. 1/788 useless extension candidates. Maximal degree in co-relation 923. Up to 39 conditions per place. [2025-02-08 05:37:21,871 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 14 selfloop transitions, 3 changer transitions 0/512 dead transitions. [2025-02-08 05:37:21,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 512 transitions, 1073 flow [2025-02-08 05:37:21,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-02-08 05:37:21,874 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9568965517241379 [2025-02-08 05:37:21,874 INFO L175 Difference]: Start difference. First operand has 508 places, 509 transitions, 1031 flow. Second operand 3 states and 1665 transitions. [2025-02-08 05:37:21,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 512 transitions, 1073 flow [2025-02-08 05:37:21,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 512 transitions, 1069 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,883 INFO L231 Difference]: Finished difference. Result has 510 places, 510 transitions, 1045 flow [2025-02-08 05:37:21,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1045, PETRI_PLACES=510, PETRI_TRANSITIONS=510} [2025-02-08 05:37:21,885 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -31 predicate places. [2025-02-08 05:37:21,885 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 510 transitions, 1045 flow [2025-02-08 05:37:21,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 550.6666666666666) internal successors, (1652), 3 states have internal predecessors, (1652), 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) [2025-02-08 05:37:21,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,886 INFO L206 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] [2025-02-08 05:37:21,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:21,887 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash 924193681, now seen corresponding path program 1 times [2025-02-08 05:37:21,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813994452] [2025-02-08 05:37:21,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:37:21,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:37:21,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:21,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813994452] [2025-02-08 05:37:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813994452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143666263] [2025-02-08 05:37:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 551 out of 580 [2025-02-08 05:37:21,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 510 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 553.0) internal successors, (1659), 3 states have internal predecessors, (1659), 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) [2025-02-08 05:37:21,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 551 of 580 [2025-02-08 05:37:21,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,024 INFO L124 PetriNetUnfolderBase]: 22/691 cut-off events. [2025-02-08 05:37:22,024 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2025-02-08 05:37:22,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 691 events. 22/691 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2177 event pairs, 4 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 686. Up to 18 conditions per place. [2025-02-08 05:37:22,030 INFO L140 encePairwiseOnDemand]: 577/580 looper letters, 11 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-02-08 05:37:22,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 511 transitions, 1075 flow [2025-02-08 05:37:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1667 transitions. [2025-02-08 05:37:22,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9580459770114943 [2025-02-08 05:37:22,032 INFO L175 Difference]: Start difference. First operand has 510 places, 510 transitions, 1045 flow. Second operand 3 states and 1667 transitions. [2025-02-08 05:37:22,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 511 places, 511 transitions, 1075 flow [2025-02-08 05:37:22,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 511 transitions, 1069 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,038 INFO L231 Difference]: Finished difference. Result has 509 places, 509 transitions, 1041 flow [2025-02-08 05:37:22,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1041, PETRI_PLACES=509, PETRI_TRANSITIONS=509} [2025-02-08 05:37:22,039 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -32 predicate places. [2025-02-08 05:37:22,039 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 509 transitions, 1041 flow [2025-02-08 05:37:22,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 553.0) internal successors, (1659), 3 states have internal predecessors, (1659), 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) [2025-02-08 05:37:22,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,040 INFO L206 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] [2025-02-08 05:37:22,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:22,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:22,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1914790565, now seen corresponding path program 1 times [2025-02-08 05:37:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881094194] [2025-02-08 05:37:22,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 05:37:22,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 05:37:22,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881094194] [2025-02-08 05:37:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881094194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066039911] [2025-02-08 05:37:22,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 580 [2025-02-08 05:37:22,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 509 transitions, 1041 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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) [2025-02-08 05:37:22,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 580 [2025-02-08 05:37:22,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,368 INFO L124 PetriNetUnfolderBase]: 72/1366 cut-off events. [2025-02-08 05:37:22,369 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-02-08 05:37:22,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1366 events. 72/1366 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7749 event pairs, 12 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 1464. Up to 96 conditions per place. [2025-02-08 05:37:22,392 INFO L140 encePairwiseOnDemand]: 574/580 looper letters, 20 selfloop transitions, 2 changer transitions 0/512 dead transitions. [2025-02-08 05:37:22,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 512 transitions, 1096 flow [2025-02-08 05:37:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1658 transitions. [2025-02-08 05:37:22,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528735632183908 [2025-02-08 05:37:22,397 INFO L175 Difference]: Start difference. First operand has 509 places, 509 transitions, 1041 flow. Second operand 3 states and 1658 transitions. [2025-02-08 05:37:22,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 512 transitions, 1096 flow [2025-02-08 05:37:22,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 512 transitions, 1092 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:22,406 INFO L231 Difference]: Finished difference. Result has 506 places, 507 transitions, 1043 flow [2025-02-08 05:37:22,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=506, PETRI_TRANSITIONS=507} [2025-02-08 05:37:22,407 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -35 predicate places. [2025-02-08 05:37:22,407 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 507 transitions, 1043 flow [2025-02-08 05:37:22,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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) [2025-02-08 05:37:22,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,409 INFO L206 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] [2025-02-08 05:37:22,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:22,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:22,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash 696374150, now seen corresponding path program 1 times [2025-02-08 05:37:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258892873] [2025-02-08 05:37:22,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-08 05:37:22,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-08 05:37:22,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:22,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258892873] [2025-02-08 05:37:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258892873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:22,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968917716] [2025-02-08 05:37:22,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 580 [2025-02-08 05:37:22,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 507 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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) [2025-02-08 05:37:22,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 580 [2025-02-08 05:37:22,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:22,726 INFO L124 PetriNetUnfolderBase]: 56/1112 cut-off events. [2025-02-08 05:37:22,726 INFO L125 PetriNetUnfolderBase]: For 22/85 co-relation queries the response was YES. [2025-02-08 05:37:22,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 1112 events. 56/1112 cut-off events. For 22/85 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5689 event pairs, 18 based on Foata normal form. 2/984 useless extension candidates. Maximal degree in co-relation 1181. Up to 57 conditions per place. [2025-02-08 05:37:22,741 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 14 selfloop transitions, 3 changer transitions 0/510 dead transitions. [2025-02-08 05:37:22,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 510 transitions, 1085 flow [2025-02-08 05:37:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-02-08 05:37:22,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9568965517241379 [2025-02-08 05:37:22,744 INFO L175 Difference]: Start difference. First operand has 506 places, 507 transitions, 1043 flow. Second operand 3 states and 1665 transitions. [2025-02-08 05:37:22,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 510 transitions, 1085 flow [2025-02-08 05:37:22,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 510 transitions, 1085 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:22,749 INFO L231 Difference]: Finished difference. Result has 510 places, 508 transitions, 1061 flow [2025-02-08 05:37:22,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=506, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=510, PETRI_TRANSITIONS=508} [2025-02-08 05:37:22,750 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -31 predicate places. [2025-02-08 05:37:22,750 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 508 transitions, 1061 flow [2025-02-08 05:37:22,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.0) internal successors, (1653), 3 states have internal predecessors, (1653), 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) [2025-02-08 05:37:22,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:22,752 INFO L206 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] [2025-02-08 05:37:22,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:22,752 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:22,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:22,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1697184172, now seen corresponding path program 1 times [2025-02-08 05:37:22,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908679821] [2025-02-08 05:37:22,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:22,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:37:22,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:37:22,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:22,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908679821] [2025-02-08 05:37:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908679821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:22,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:22,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264145428] [2025-02-08 05:37:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:22,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:22,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:22,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:22,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 580 [2025-02-08 05:37:22,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 508 transitions, 1061 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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) [2025-02-08 05:37:22,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:22,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 580 [2025-02-08 05:37:22,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:23,071 INFO L124 PetriNetUnfolderBase]: 135/2324 cut-off events. [2025-02-08 05:37:23,071 INFO L125 PetriNetUnfolderBase]: For 25/39 co-relation queries the response was YES. [2025-02-08 05:37:23,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 2324 events. 135/2324 cut-off events. For 25/39 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 16350 event pairs, 31 based on Foata normal form. 1/2068 useless extension candidates. Maximal degree in co-relation 2606. Up to 159 conditions per place. [2025-02-08 05:37:23,099 INFO L140 encePairwiseOnDemand]: 574/580 looper letters, 20 selfloop transitions, 2 changer transitions 0/511 dead transitions. [2025-02-08 05:37:23,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 511 transitions, 1116 flow [2025-02-08 05:37:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1658 transitions. [2025-02-08 05:37:23,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528735632183908 [2025-02-08 05:37:23,101 INFO L175 Difference]: Start difference. First operand has 510 places, 508 transitions, 1061 flow. Second operand 3 states and 1658 transitions. [2025-02-08 05:37:23,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 511 transitions, 1116 flow [2025-02-08 05:37:23,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 511 transitions, 1110 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:23,107 INFO L231 Difference]: Finished difference. Result has 507 places, 506 transitions, 1061 flow [2025-02-08 05:37:23,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1061, PETRI_PLACES=507, PETRI_TRANSITIONS=506} [2025-02-08 05:37:23,108 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -34 predicate places. [2025-02-08 05:37:23,108 INFO L471 AbstractCegarLoop]: Abstraction has has 507 places, 506 transitions, 1061 flow [2025-02-08 05:37:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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) [2025-02-08 05:37:23,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:23,109 INFO L206 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] [2025-02-08 05:37:23,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:23,109 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:23,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:23,109 INFO L85 PathProgramCache]: Analyzing trace with hash 343695592, now seen corresponding path program 1 times [2025-02-08 05:37:23,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:23,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767626726] [2025-02-08 05:37:23,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:23,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:23,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-02-08 05:37:23,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-02-08 05:37:23,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:23,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:23,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:23,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767626726] [2025-02-08 05:37:23,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767626726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:23,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:23,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:23,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599764291] [2025-02-08 05:37:23,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:23,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:23,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:23,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:23,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 518 out of 580 [2025-02-08 05:37:23,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 506 transitions, 1061 flow. Second operand has 8 states, 8 states have (on average 522.125) internal successors, (4177), 8 states have internal predecessors, (4177), 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) [2025-02-08 05:37:23,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:23,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 518 of 580 [2025-02-08 05:37:23,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:24,147 INFO L124 PetriNetUnfolderBase]: 125/2140 cut-off events. [2025-02-08 05:37:24,148 INFO L125 PetriNetUnfolderBase]: For 11/48 co-relation queries the response was YES. [2025-02-08 05:37:24,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 2140 events. 125/2140 cut-off events. For 11/48 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 13951 event pairs, 47 based on Foata normal form. 3/1953 useless extension candidates. Maximal degree in co-relation 2577. Up to 186 conditions per place. [2025-02-08 05:37:24,173 INFO L140 encePairwiseOnDemand]: 566/580 looper letters, 69 selfloop transitions, 15 changer transitions 0/544 dead transitions. [2025-02-08 05:37:24,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 544 transitions, 1321 flow [2025-02-08 05:37:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5782 transitions. [2025-02-08 05:37:24,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062695924764891 [2025-02-08 05:37:24,180 INFO L175 Difference]: Start difference. First operand has 507 places, 506 transitions, 1061 flow. Second operand 11 states and 5782 transitions. [2025-02-08 05:37:24,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 544 transitions, 1321 flow [2025-02-08 05:37:24,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 544 transitions, 1321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:24,189 INFO L231 Difference]: Finished difference. Result has 522 places, 514 transitions, 1137 flow [2025-02-08 05:37:24,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1137, PETRI_PLACES=522, PETRI_TRANSITIONS=514} [2025-02-08 05:37:24,190 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -19 predicate places. [2025-02-08 05:37:24,190 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 514 transitions, 1137 flow [2025-02-08 05:37:24,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 522.125) internal successors, (4177), 8 states have internal predecessors, (4177), 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) [2025-02-08 05:37:24,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:24,192 INFO L206 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] [2025-02-08 05:37:24,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:24,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1771447401, now seen corresponding path program 1 times [2025-02-08 05:37:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:24,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825792533] [2025-02-08 05:37:24,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:24,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-08 05:37:24,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-08 05:37:24,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:24,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825792533] [2025-02-08 05:37:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825792533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695945389] [2025-02-08 05:37:24,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:24,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:24,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:24,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:24,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 518 out of 580 [2025-02-08 05:37:24,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 514 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 522.25) internal successors, (4178), 8 states have internal predecessors, (4178), 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) [2025-02-08 05:37:24,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:24,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 518 of 580 [2025-02-08 05:37:24,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:25,378 INFO L124 PetriNetUnfolderBase]: 253/3428 cut-off events. [2025-02-08 05:37:25,378 INFO L125 PetriNetUnfolderBase]: For 128/248 co-relation queries the response was YES. [2025-02-08 05:37:25,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 3428 events. 253/3428 cut-off events. For 128/248 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 28468 event pairs, 98 based on Foata normal form. 8/3088 useless extension candidates. Maximal degree in co-relation 4220. Up to 314 conditions per place. [2025-02-08 05:37:25,427 INFO L140 encePairwiseOnDemand]: 566/580 looper letters, 65 selfloop transitions, 15 changer transitions 0/543 dead transitions. [2025-02-08 05:37:25,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 543 transitions, 1371 flow [2025-02-08 05:37:25,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5773 transitions. [2025-02-08 05:37:25,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.904858934169279 [2025-02-08 05:37:25,435 INFO L175 Difference]: Start difference. First operand has 522 places, 514 transitions, 1137 flow. Second operand 11 states and 5773 transitions. [2025-02-08 05:37:25,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 543 transitions, 1371 flow [2025-02-08 05:37:25,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 543 transitions, 1367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:25,452 INFO L231 Difference]: Finished difference. Result has 536 places, 522 transitions, 1209 flow [2025-02-08 05:37:25,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1209, PETRI_PLACES=536, PETRI_TRANSITIONS=522} [2025-02-08 05:37:25,454 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -5 predicate places. [2025-02-08 05:37:25,454 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 522 transitions, 1209 flow [2025-02-08 05:37:25,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 522.25) internal successors, (4178), 8 states have internal predecessors, (4178), 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) [2025-02-08 05:37:25,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:25,456 INFO L206 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] [2025-02-08 05:37:25,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:25,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:25,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:25,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1979749245, now seen corresponding path program 1 times [2025-02-08 05:37:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:25,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982557176] [2025-02-08 05:37:25,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:25,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:25,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-08 05:37:25,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-08 05:37:25,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:25,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982557176] [2025-02-08 05:37:25,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982557176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:25,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:37:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126617967] [2025-02-08 05:37:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:25,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:25,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:25,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:25,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 580 [2025-02-08 05:37:25,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 522 transitions, 1209 flow. Second operand has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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) [2025-02-08 05:37:25,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:25,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 580 [2025-02-08 05:37:25,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,110 INFO L124 PetriNetUnfolderBase]: 338/2935 cut-off events. [2025-02-08 05:37:26,110 INFO L125 PetriNetUnfolderBase]: For 259/330 co-relation queries the response was YES. [2025-02-08 05:37:26,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 2935 events. 338/2935 cut-off events. For 259/330 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 23404 event pairs, 144 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 3743. Up to 419 conditions per place. [2025-02-08 05:37:26,147 INFO L140 encePairwiseOnDemand]: 576/580 looper letters, 14 selfloop transitions, 3 changer transitions 0/525 dead transitions. [2025-02-08 05:37:26,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 525 transitions, 1251 flow [2025-02-08 05:37:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1665 transitions. [2025-02-08 05:37:26,151 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9568965517241379 [2025-02-08 05:37:26,151 INFO L175 Difference]: Start difference. First operand has 536 places, 522 transitions, 1209 flow. Second operand 3 states and 1665 transitions. [2025-02-08 05:37:26,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 525 transitions, 1251 flow [2025-02-08 05:37:26,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 525 transitions, 1247 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:26,160 INFO L231 Difference]: Finished difference. Result has 539 places, 523 transitions, 1223 flow [2025-02-08 05:37:26,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1223, PETRI_PLACES=539, PETRI_TRANSITIONS=523} [2025-02-08 05:37:26,161 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, -2 predicate places. [2025-02-08 05:37:26,162 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 523 transitions, 1223 flow [2025-02-08 05:37:26,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 551.3333333333334) internal successors, (1654), 3 states have internal predecessors, (1654), 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) [2025-02-08 05:37:26,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,162 INFO L206 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] [2025-02-08 05:37:26,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:26,163 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:26,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash -367840317, now seen corresponding path program 1 times [2025-02-08 05:37:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117867369] [2025-02-08 05:37:26,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-08 05:37:26,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-08 05:37:26,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:26,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:26,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117867369] [2025-02-08 05:37:26,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117867369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:26,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059308488] [2025-02-08 05:37:26,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:26,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:26,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:26,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 518 out of 580 [2025-02-08 05:37:26,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 523 transitions, 1223 flow. Second operand has 8 states, 8 states have (on average 522.375) internal successors, (4179), 8 states have internal predecessors, (4179), 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) [2025-02-08 05:37:26,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 518 of 580 [2025-02-08 05:37:26,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,373 INFO L124 PetriNetUnfolderBase]: 276/3033 cut-off events. [2025-02-08 05:37:27,374 INFO L125 PetriNetUnfolderBase]: For 318/376 co-relation queries the response was YES. [2025-02-08 05:37:27,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4099 conditions, 3033 events. 276/3033 cut-off events. For 318/376 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 23280 event pairs, 139 based on Foata normal form. 7/2762 useless extension candidates. Maximal degree in co-relation 4029. Up to 469 conditions per place. [2025-02-08 05:37:27,392 INFO L140 encePairwiseOnDemand]: 566/580 looper letters, 79 selfloop transitions, 15 changer transitions 0/561 dead transitions. [2025-02-08 05:37:27,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 561 transitions, 1537 flow [2025-02-08 05:37:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5782 transitions. [2025-02-08 05:37:27,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062695924764891 [2025-02-08 05:37:27,399 INFO L175 Difference]: Start difference. First operand has 539 places, 523 transitions, 1223 flow. Second operand 11 states and 5782 transitions. [2025-02-08 05:37:27,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 561 transitions, 1537 flow [2025-02-08 05:37:27,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 561 transitions, 1527 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,406 INFO L231 Difference]: Finished difference. Result has 550 places, 526 transitions, 1272 flow [2025-02-08 05:37:27,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1272, PETRI_PLACES=550, PETRI_TRANSITIONS=526} [2025-02-08 05:37:27,407 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 9 predicate places. [2025-02-08 05:37:27,407 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 526 transitions, 1272 flow [2025-02-08 05:37:27,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 522.375) internal successors, (4179), 8 states have internal predecessors, (4179), 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) [2025-02-08 05:37:27,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,409 INFO L206 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] [2025-02-08 05:37:27,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:37:27,409 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:27,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1116761372, now seen corresponding path program 1 times [2025-02-08 05:37:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412749701] [2025-02-08 05:37:27,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-08 05:37:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-08 05:37:27,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412749701] [2025-02-08 05:37:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412749701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587757716] [2025-02-08 05:37:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:27,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:27,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 518 out of 580 [2025-02-08 05:37:27,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 526 transitions, 1272 flow. Second operand has 8 states, 8 states have (on average 522.25) internal successors, (4178), 8 states have internal predecessors, (4178), 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) [2025-02-08 05:37:27,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 518 of 580 [2025-02-08 05:37:27,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,315 INFO L124 PetriNetUnfolderBase]: 143/2154 cut-off events. [2025-02-08 05:37:28,315 INFO L125 PetriNetUnfolderBase]: For 127/179 co-relation queries the response was YES. [2025-02-08 05:37:28,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 2154 events. 143/2154 cut-off events. For 127/179 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 13297 event pairs, 55 based on Foata normal form. 2/2015 useless extension candidates. Maximal degree in co-relation 2934. Up to 234 conditions per place. [2025-02-08 05:37:28,338 INFO L140 encePairwiseOnDemand]: 565/580 looper letters, 71 selfloop transitions, 18 changer transitions 0/556 dead transitions. [2025-02-08 05:37:28,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 556 transitions, 1550 flow [2025-02-08 05:37:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5775 transitions. [2025-02-08 05:37:28,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9051724137931034 [2025-02-08 05:37:28,346 INFO L175 Difference]: Start difference. First operand has 550 places, 526 transitions, 1272 flow. Second operand 11 states and 5775 transitions. [2025-02-08 05:37:28,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 556 transitions, 1550 flow [2025-02-08 05:37:28,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 556 transitions, 1529 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:37:28,353 INFO L231 Difference]: Finished difference. Result has 556 places, 532 transitions, 1346 flow [2025-02-08 05:37:28,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1346, PETRI_PLACES=556, PETRI_TRANSITIONS=532} [2025-02-08 05:37:28,354 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 15 predicate places. [2025-02-08 05:37:28,354 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 532 transitions, 1346 flow [2025-02-08 05:37:28,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 522.25) internal successors, (4178), 8 states have internal predecessors, (4178), 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) [2025-02-08 05:37:28,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,355 INFO L206 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] [2025-02-08 05:37:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:37:28,356 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:28,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1537120053, now seen corresponding path program 1 times [2025-02-08 05:37:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418443926] [2025-02-08 05:37:28,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-08 05:37:28,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-08 05:37:28,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:28,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418443926] [2025-02-08 05:37:28,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418443926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763121543] [2025-02-08 05:37:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:28,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:28,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 518 out of 580 [2025-02-08 05:37:28,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 532 transitions, 1346 flow. Second operand has 8 states, 8 states have (on average 522.375) internal successors, (4179), 8 states have internal predecessors, (4179), 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) [2025-02-08 05:37:28,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 518 of 580 [2025-02-08 05:37:28,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:29,341 INFO L124 PetriNetUnfolderBase]: 294/3593 cut-off events. [2025-02-08 05:37:29,342 INFO L125 PetriNetUnfolderBase]: For 438/550 co-relation queries the response was YES. [2025-02-08 05:37:29,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5093 conditions, 3593 events. 294/3593 cut-off events. For 438/550 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 29361 event pairs, 84 based on Foata normal form. 6/3331 useless extension candidates. Maximal degree in co-relation 5012. Up to 301 conditions per place. [2025-02-08 05:37:29,390 INFO L140 encePairwiseOnDemand]: 564/580 looper letters, 65 selfloop transitions, 22 changer transitions 0/560 dead transitions. [2025-02-08 05:37:29,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 560 transitions, 1618 flow [2025-02-08 05:37:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6287 transitions. [2025-02-08 05:37:29,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033045977011495 [2025-02-08 05:37:29,396 INFO L175 Difference]: Start difference. First operand has 556 places, 532 transitions, 1346 flow. Second operand 12 states and 6287 transitions. [2025-02-08 05:37:29,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 560 transitions, 1618 flow [2025-02-08 05:37:29,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 560 transitions, 1597 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-08 05:37:29,405 INFO L231 Difference]: Finished difference. Result has 566 places, 544 transitions, 1457 flow [2025-02-08 05:37:29,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1457, PETRI_PLACES=566, PETRI_TRANSITIONS=544} [2025-02-08 05:37:29,407 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 25 predicate places. [2025-02-08 05:37:29,407 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 544 transitions, 1457 flow [2025-02-08 05:37:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 522.375) internal successors, (4179), 8 states have internal predecessors, (4179), 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) [2025-02-08 05:37:29,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:29,408 INFO L206 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] [2025-02-08 05:37:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 05:37:29,408 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:29,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 823300599, now seen corresponding path program 1 times [2025-02-08 05:37:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965860869] [2025-02-08 05:37:29,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:29,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-08 05:37:29,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-08 05:37:29,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:29,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:29,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:29,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965860869] [2025-02-08 05:37:29,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965860869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:29,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:29,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 05:37:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806148519] [2025-02-08 05:37:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:29,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:37:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:29,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:37:29,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:37:29,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 518 out of 580 [2025-02-08 05:37:29,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 544 transitions, 1457 flow. Second operand has 8 states, 8 states have (on average 522.5) internal successors, (4180), 8 states have internal predecessors, (4180), 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) [2025-02-08 05:37:29,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:29,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 518 of 580 [2025-02-08 05:37:29,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:30,483 INFO L124 PetriNetUnfolderBase]: 318/3579 cut-off events. [2025-02-08 05:37:30,483 INFO L125 PetriNetUnfolderBase]: For 658/698 co-relation queries the response was YES. [2025-02-08 05:37:30,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5188 conditions, 3579 events. 318/3579 cut-off events. For 658/698 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 28764 event pairs, 104 based on Foata normal form. 0/3312 useless extension candidates. Maximal degree in co-relation 5099. Up to 370 conditions per place. [2025-02-08 05:37:30,523 INFO L140 encePairwiseOnDemand]: 564/580 looper letters, 65 selfloop transitions, 22 changer transitions 0/567 dead transitions. [2025-02-08 05:37:30,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 567 transitions, 1719 flow [2025-02-08 05:37:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:37:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:37:30,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6287 transitions. [2025-02-08 05:37:30,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033045977011495 [2025-02-08 05:37:30,526 INFO L175 Difference]: Start difference. First operand has 566 places, 544 transitions, 1457 flow. Second operand 12 states and 6287 transitions. [2025-02-08 05:37:30,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 567 transitions, 1719 flow [2025-02-08 05:37:30,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 567 transitions, 1719 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:30,536 INFO L231 Difference]: Finished difference. Result has 581 places, 551 transitions, 1568 flow [2025-02-08 05:37:30,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1457, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1568, PETRI_PLACES=581, PETRI_TRANSITIONS=551} [2025-02-08 05:37:30,537 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 40 predicate places. [2025-02-08 05:37:30,537 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 551 transitions, 1568 flow [2025-02-08 05:37:30,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 522.5) internal successors, (4180), 8 states have internal predecessors, (4180), 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) [2025-02-08 05:37:30,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:30,538 INFO L206 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] [2025-02-08 05:37:30,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 05:37:30,539 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:30,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash 801714258, now seen corresponding path program 1 times [2025-02-08 05:37:30,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:30,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812374561] [2025-02-08 05:37:30,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:30,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-02-08 05:37:30,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-02-08 05:37:30,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:30,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:30,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:30,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812374561] [2025-02-08 05:37:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812374561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:30,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:30,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:30,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610993967] [2025-02-08 05:37:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:30,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:30,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:30,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:30,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:31,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 580 [2025-02-08 05:37:31,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 551 transitions, 1568 flow. Second operand has 6 states, 6 states have (on average 531.8333333333334) internal successors, (3191), 6 states have internal predecessors, (3191), 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) [2025-02-08 05:37:31,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:31,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 580 [2025-02-08 05:37:31,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:31,852 INFO L124 PetriNetUnfolderBase]: 172/3172 cut-off events. [2025-02-08 05:37:31,852 INFO L125 PetriNetUnfolderBase]: For 623/647 co-relation queries the response was YES. [2025-02-08 05:37:31,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 3172 events. 172/3172 cut-off events. For 623/647 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 22491 event pairs, 23 based on Foata normal form. 4/3010 useless extension candidates. Maximal degree in co-relation 4621. Up to 177 conditions per place. [2025-02-08 05:37:31,882 INFO L140 encePairwiseOnDemand]: 573/580 looper letters, 38 selfloop transitions, 5 changer transitions 0/557 dead transitions. [2025-02-08 05:37:31,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 557 transitions, 1674 flow [2025-02-08 05:37:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3216 transitions. [2025-02-08 05:37:31,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241379310344827 [2025-02-08 05:37:31,884 INFO L175 Difference]: Start difference. First operand has 581 places, 551 transitions, 1568 flow. Second operand 6 states and 3216 transitions. [2025-02-08 05:37:31,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 557 transitions, 1674 flow [2025-02-08 05:37:31,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 557 transitions, 1657 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:31,893 INFO L231 Difference]: Finished difference. Result has 578 places, 549 transitions, 1557 flow [2025-02-08 05:37:31,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1547, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1557, PETRI_PLACES=578, PETRI_TRANSITIONS=549} [2025-02-08 05:37:31,894 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 37 predicate places. [2025-02-08 05:37:31,894 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 549 transitions, 1557 flow [2025-02-08 05:37:31,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 531.8333333333334) internal successors, (3191), 6 states have internal predecessors, (3191), 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) [2025-02-08 05:37:31,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:31,895 INFO L206 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] [2025-02-08 05:37:31,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 05:37:31,895 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:31,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 702874934, now seen corresponding path program 1 times [2025-02-08 05:37:31,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308600693] [2025-02-08 05:37:31,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:31,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-08 05:37:31,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-08 05:37:31,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:31,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:32,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:32,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:32,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308600693] [2025-02-08 05:37:32,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308600693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:32,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456221984] [2025-02-08 05:37:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:32,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:32,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:32,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:32,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:32,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 580 [2025-02-08 05:37:32,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 549 transitions, 1557 flow. Second operand has 6 states, 6 states have (on average 532.0) internal successors, (3192), 6 states have internal predecessors, (3192), 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) [2025-02-08 05:37:32,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:32,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 580 [2025-02-08 05:37:32,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:33,202 INFO L124 PetriNetUnfolderBase]: 157/3236 cut-off events. [2025-02-08 05:37:33,202 INFO L125 PetriNetUnfolderBase]: For 715/769 co-relation queries the response was YES. [2025-02-08 05:37:33,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4716 conditions, 3236 events. 157/3236 cut-off events. For 715/769 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 23406 event pairs, 25 based on Foata normal form. 4/3054 useless extension candidates. Maximal degree in co-relation 4619. Up to 181 conditions per place. [2025-02-08 05:37:33,242 INFO L140 encePairwiseOnDemand]: 573/580 looper letters, 38 selfloop transitions, 5 changer transitions 0/555 dead transitions. [2025-02-08 05:37:33,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 555 transitions, 1663 flow [2025-02-08 05:37:33,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3216 transitions. [2025-02-08 05:37:33,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241379310344827 [2025-02-08 05:37:33,244 INFO L175 Difference]: Start difference. First operand has 578 places, 549 transitions, 1557 flow. Second operand 6 states and 3216 transitions. [2025-02-08 05:37:33,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 555 transitions, 1663 flow [2025-02-08 05:37:33,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 555 transitions, 1653 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:33,254 INFO L231 Difference]: Finished difference. Result has 576 places, 547 transitions, 1553 flow [2025-02-08 05:37:33,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1543, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1553, PETRI_PLACES=576, PETRI_TRANSITIONS=547} [2025-02-08 05:37:33,256 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 35 predicate places. [2025-02-08 05:37:33,256 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 547 transitions, 1553 flow [2025-02-08 05:37:33,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.0) internal successors, (3192), 6 states have internal predecessors, (3192), 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) [2025-02-08 05:37:33,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:33,257 INFO L206 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] [2025-02-08 05:37:33,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 05:37:33,257 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:33,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1682000438, now seen corresponding path program 1 times [2025-02-08 05:37:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267224002] [2025-02-08 05:37:33,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:33,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:33,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:33,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:33,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:33,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:33,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267224002] [2025-02-08 05:37:33,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267224002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:33,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:33,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:33,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105119778] [2025-02-08 05:37:33,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:33,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:33,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:33,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:34,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 580 [2025-02-08 05:37:34,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 547 transitions, 1553 flow. Second operand has 6 states, 6 states have (on average 531.8333333333334) internal successors, (3191), 6 states have internal predecessors, (3191), 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) [2025-02-08 05:37:34,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:34,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 580 [2025-02-08 05:37:34,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:34,462 INFO L124 PetriNetUnfolderBase]: 152/3132 cut-off events. [2025-02-08 05:37:34,462 INFO L125 PetriNetUnfolderBase]: For 599/613 co-relation queries the response was YES. [2025-02-08 05:37:34,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4588 conditions, 3132 events. 152/3132 cut-off events. For 599/613 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 21977 event pairs, 23 based on Foata normal form. 0/2986 useless extension candidates. Maximal degree in co-relation 4491. Up to 179 conditions per place. [2025-02-08 05:37:34,502 INFO L140 encePairwiseOnDemand]: 573/580 looper letters, 38 selfloop transitions, 5 changer transitions 0/553 dead transitions. [2025-02-08 05:37:34,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 553 transitions, 1659 flow [2025-02-08 05:37:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3216 transitions. [2025-02-08 05:37:34,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241379310344827 [2025-02-08 05:37:34,505 INFO L175 Difference]: Start difference. First operand has 576 places, 547 transitions, 1553 flow. Second operand 6 states and 3216 transitions. [2025-02-08 05:37:34,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 553 transitions, 1659 flow [2025-02-08 05:37:34,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 553 transitions, 1649 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:34,516 INFO L231 Difference]: Finished difference. Result has 574 places, 545 transitions, 1549 flow [2025-02-08 05:37:34,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1549, PETRI_PLACES=574, PETRI_TRANSITIONS=545} [2025-02-08 05:37:34,517 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 33 predicate places. [2025-02-08 05:37:34,517 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 545 transitions, 1549 flow [2025-02-08 05:37:34,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 531.8333333333334) internal successors, (3191), 6 states have internal predecessors, (3191), 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) [2025-02-08 05:37:34,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:34,518 INFO L206 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] [2025-02-08 05:37:34,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 05:37:34,518 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:34,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:34,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1152987991, now seen corresponding path program 1 times [2025-02-08 05:37:34,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:34,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730411517] [2025-02-08 05:37:34,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:34,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:34,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-08 05:37:34,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-08 05:37:34,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:34,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730411517] [2025-02-08 05:37:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730411517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653182114] [2025-02-08 05:37:34,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:34,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:34,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:34,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:34,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 580 [2025-02-08 05:37:34,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 545 transitions, 1549 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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) [2025-02-08 05:37:34,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:34,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 580 [2025-02-08 05:37:34,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:35,341 INFO L124 PetriNetUnfolderBase]: 321/5280 cut-off events. [2025-02-08 05:37:35,342 INFO L125 PetriNetUnfolderBase]: For 629/654 co-relation queries the response was YES. [2025-02-08 05:37:35,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6987 conditions, 5280 events. 321/5280 cut-off events. For 629/654 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 44590 event pairs, 54 based on Foata normal form. 0/4911 useless extension candidates. Maximal degree in co-relation 6891. Up to 367 conditions per place. [2025-02-08 05:37:35,403 INFO L140 encePairwiseOnDemand]: 574/580 looper letters, 19 selfloop transitions, 2 changer transitions 0/547 dead transitions. [2025-02-08 05:37:35,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 547 transitions, 1599 flow [2025-02-08 05:37:35,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1657 transitions. [2025-02-08 05:37:35,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522988505747126 [2025-02-08 05:37:35,405 INFO L175 Difference]: Start difference. First operand has 574 places, 545 transitions, 1549 flow. Second operand 3 states and 1657 transitions. [2025-02-08 05:37:35,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 547 transitions, 1599 flow [2025-02-08 05:37:35,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 547 transitions, 1589 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:35,414 INFO L231 Difference]: Finished difference. Result has 568 places, 543 transitions, 1545 flow [2025-02-08 05:37:35,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1545, PETRI_PLACES=568, PETRI_TRANSITIONS=543} [2025-02-08 05:37:35,417 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 27 predicate places. [2025-02-08 05:37:35,418 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 543 transitions, 1545 flow [2025-02-08 05:37:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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) [2025-02-08 05:37:35,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:35,418 INFO L206 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] [2025-02-08 05:37:35,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 05:37:35,418 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:35,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash -757265844, now seen corresponding path program 1 times [2025-02-08 05:37:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743713291] [2025-02-08 05:37:35,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:35,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-08 05:37:35,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-08 05:37:35,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:35,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:35,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:35,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743713291] [2025-02-08 05:37:35,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743713291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:35,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:35,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:35,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736251015] [2025-02-08 05:37:35,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:35,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:35,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:35,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:35,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:36,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 580 [2025-02-08 05:37:36,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 543 transitions, 1545 flow. Second operand has 6 states, 6 states have (on average 532.1666666666666) internal successors, (3193), 6 states have internal predecessors, (3193), 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) [2025-02-08 05:37:36,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:36,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 580 [2025-02-08 05:37:36,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:36,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1509] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][474], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 419#L105true, 595#(= |#race~n3~0| 0), 624#(= |#race~a2~0| 0), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 430#L79-16true, 797#(= |#race~a3~0| 0), 589#(= |#race~n2~0| 0), Black: 795#true, 753#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 613#true, 727#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 622#true, 801#(= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0), Black: 686#(<= ~n1~0 0), Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:36,777 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-02-08 05:37:36,777 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-02-08 05:37:36,778 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-02-08 05:37:36,778 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-02-08 05:37:36,788 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1509] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][478], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 419#L105true, 595#(= |#race~n3~0| 0), 624#(= |#race~a2~0| 0), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 797#(= |#race~a3~0| 0), 589#(= |#race~n2~0| 0), 222#L79-15true, Black: 795#true, 753#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 613#true, 727#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 622#true, 802#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 686#(<= ~n1~0 0), Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:36,788 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-02-08 05:37:36,788 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-02-08 05:37:36,788 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-02-08 05:37:36,788 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2025-02-08 05:37:36,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1509] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][482], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 419#L105true, 595#(= |#race~n3~0| 0), 624#(= |#race~a2~0| 0), 803#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 797#(= |#race~a3~0| 0), 589#(= |#race~n2~0| 0), Black: 795#true, 753#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 613#true, 727#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 622#true, 135#L79-14true, Black: 686#(<= ~n1~0 0), Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:36,796 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-02-08 05:37:36,796 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-02-08 05:37:36,796 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-02-08 05:37:36,796 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-02-08 05:37:36,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1509] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][487], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 804#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), Black: 631#(<= ~n1~0 0), 419#L105true, 595#(= |#race~n3~0| 0), 624#(= |#race~a2~0| 0), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 797#(= |#race~a3~0| 0), 589#(= |#race~n2~0| 0), Black: 795#true, 753#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 613#true, 727#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 622#true, 471#L79-12true, Black: 686#(<= ~n1~0 0), Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:36,801 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2025-02-08 05:37:36,801 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-02-08 05:37:36,801 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-02-08 05:37:36,801 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-02-08 05:37:36,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1509] thread2EXIT-->L105: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][487], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 804#(and (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 2)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a1~0.base) (+ ~a1~0.offset (* |thread3Thread1of1ForFork0_~i~2#1| 4))) 0)), 419#L105true, 595#(= |#race~n3~0| 0), 624#(= |#race~a2~0| 0), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 797#(= |#race~a3~0| 0), 589#(= |#race~n2~0| 0), Black: 795#true, 753#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 613#true, 727#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 215#L79-13true, Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 622#true, Black: 686#(<= ~n1~0 0), Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:36,804 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-02-08 05:37:36,804 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-02-08 05:37:36,805 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-02-08 05:37:36,805 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-02-08 05:37:36,844 INFO L124 PetriNetUnfolderBase]: 311/3988 cut-off events. [2025-02-08 05:37:36,844 INFO L125 PetriNetUnfolderBase]: For 960/993 co-relation queries the response was YES. [2025-02-08 05:37:36,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 3988 events. 311/3988 cut-off events. For 960/993 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32750 event pairs, 38 based on Foata normal form. 4/3802 useless extension candidates. Maximal degree in co-relation 5825. Up to 226 conditions per place. [2025-02-08 05:37:36,894 INFO L140 encePairwiseOnDemand]: 573/580 looper letters, 38 selfloop transitions, 5 changer transitions 0/549 dead transitions. [2025-02-08 05:37:36,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 549 transitions, 1651 flow [2025-02-08 05:37:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3216 transitions. [2025-02-08 05:37:36,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241379310344827 [2025-02-08 05:37:36,897 INFO L175 Difference]: Start difference. First operand has 568 places, 543 transitions, 1545 flow. Second operand 6 states and 3216 transitions. [2025-02-08 05:37:36,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 549 transitions, 1651 flow [2025-02-08 05:37:36,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 549 transitions, 1651 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:36,910 INFO L231 Difference]: Finished difference. Result has 571 places, 541 transitions, 1551 flow [2025-02-08 05:37:36,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1551, PETRI_PLACES=571, PETRI_TRANSITIONS=541} [2025-02-08 05:37:36,912 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 30 predicate places. [2025-02-08 05:37:36,912 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 541 transitions, 1551 flow [2025-02-08 05:37:36,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.1666666666666) internal successors, (3193), 6 states have internal predecessors, (3193), 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) [2025-02-08 05:37:36,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:36,913 INFO L206 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] [2025-02-08 05:37:36,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 05:37:36,913 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:36,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash -141881830, now seen corresponding path program 1 times [2025-02-08 05:37:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087850412] [2025-02-08 05:37:36,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:36,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-08 05:37:36,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-08 05:37:36,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:36,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:37,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087850412] [2025-02-08 05:37:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087850412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:37,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667660561] [2025-02-08 05:37:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:37,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:37,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:37,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:37,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:37,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 580 [2025-02-08 05:37:37,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 541 transitions, 1551 flow. Second operand has 6 states, 6 states have (on average 532.0) internal successors, (3192), 6 states have internal predecessors, (3192), 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) [2025-02-08 05:37:37,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:37,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 580 [2025-02-08 05:37:37,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,335 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1508] thread3EXIT-->L107-17: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][330], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 595#(= |#race~n3~0| 0), 624#(= |#race~a2~0| 0), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 799#true, 228#L107-17true, 589#(= |#race~n2~0| 0), 797#(= |#race~a3~0| 0), 753#true, Black: 795#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), Black: 613#true, 727#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 805#true, Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 622#true, Black: 686#(<= ~n1~0 0), Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:38,336 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-02-08 05:37:38,336 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:38,336 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-02-08 05:37:38,336 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:38,343 INFO L124 PetriNetUnfolderBase]: 186/3701 cut-off events. [2025-02-08 05:37:38,343 INFO L125 PetriNetUnfolderBase]: For 748/798 co-relation queries the response was YES. [2025-02-08 05:37:38,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5371 conditions, 3701 events. 186/3701 cut-off events. For 748/798 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28233 event pairs, 30 based on Foata normal form. 4/3546 useless extension candidates. Maximal degree in co-relation 5273. Up to 189 conditions per place. [2025-02-08 05:37:38,383 INFO L140 encePairwiseOnDemand]: 573/580 looper letters, 38 selfloop transitions, 5 changer transitions 0/547 dead transitions. [2025-02-08 05:37:38,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 547 transitions, 1657 flow [2025-02-08 05:37:38,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3216 transitions. [2025-02-08 05:37:38,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241379310344827 [2025-02-08 05:37:38,387 INFO L175 Difference]: Start difference. First operand has 571 places, 541 transitions, 1551 flow. Second operand 6 states and 3216 transitions. [2025-02-08 05:37:38,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 547 transitions, 1657 flow [2025-02-08 05:37:38,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 547 transitions, 1647 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:38,396 INFO L231 Difference]: Finished difference. Result has 569 places, 539 transitions, 1547 flow [2025-02-08 05:37:38,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1547, PETRI_PLACES=569, PETRI_TRANSITIONS=539} [2025-02-08 05:37:38,397 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 28 predicate places. [2025-02-08 05:37:38,397 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 539 transitions, 1547 flow [2025-02-08 05:37:38,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.0) internal successors, (3192), 6 states have internal predecessors, (3192), 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) [2025-02-08 05:37:38,397 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,398 INFO L206 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] [2025-02-08 05:37:38,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 05:37:38,398 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:38,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,399 INFO L85 PathProgramCache]: Analyzing trace with hash -618078439, now seen corresponding path program 1 times [2025-02-08 05:37:38,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311521070] [2025-02-08 05:37:38,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-08 05:37:38,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-08 05:37:38,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:38,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311521070] [2025-02-08 05:37:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311521070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828010007] [2025-02-08 05:37:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:38,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:38,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:38,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:38,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:38,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 580 [2025-02-08 05:37:38,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 539 transitions, 1547 flow. Second operand has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 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) [2025-02-08 05:37:38,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:38,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 580 [2025-02-08 05:37:38,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:38,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1508] thread3EXIT-->L107-17: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][330], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 624#(= |#race~a2~0| 0), 595#(= |#race~n3~0| 0), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 228#L107-17true, 589#(= |#race~n2~0| 0), 797#(= |#race~a3~0| 0), 753#true, Black: 795#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), 727#true, Black: 613#true, 805#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), 811#true, Black: 622#true, Black: 686#(<= ~n1~0 0), Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:38,911 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-02-08 05:37:38,911 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-02-08 05:37:38,911 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:38,912 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:38,917 INFO L124 PetriNetUnfolderBase]: 118/3450 cut-off events. [2025-02-08 05:37:38,918 INFO L125 PetriNetUnfolderBase]: For 587/603 co-relation queries the response was YES. [2025-02-08 05:37:38,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 3450 events. 118/3450 cut-off events. For 587/603 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 25078 event pairs, 21 based on Foata normal form. 0/3331 useless extension candidates. Maximal degree in co-relation 4715. Up to 108 conditions per place. [2025-02-08 05:37:38,956 INFO L140 encePairwiseOnDemand]: 578/580 looper letters, 8 selfloop transitions, 1 changer transitions 0/538 dead transitions. [2025-02-08 05:37:38,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 538 transitions, 1563 flow [2025-02-08 05:37:38,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:38,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1669 transitions. [2025-02-08 05:37:38,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9591954022988506 [2025-02-08 05:37:38,957 INFO L175 Difference]: Start difference. First operand has 569 places, 539 transitions, 1547 flow. Second operand 3 states and 1669 transitions. [2025-02-08 05:37:38,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 538 transitions, 1563 flow [2025-02-08 05:37:38,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 538 transitions, 1553 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:38,966 INFO L231 Difference]: Finished difference. Result has 565 places, 538 transitions, 1537 flow [2025-02-08 05:37:38,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1535, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1537, PETRI_PLACES=565, PETRI_TRANSITIONS=538} [2025-02-08 05:37:38,967 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 24 predicate places. [2025-02-08 05:37:38,967 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 538 transitions, 1537 flow [2025-02-08 05:37:38,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 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) [2025-02-08 05:37:38,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:38,967 INFO L206 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] [2025-02-08 05:37:38,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 05:37:38,967 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:38,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1742647344, now seen corresponding path program 1 times [2025-02-08 05:37:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127200059] [2025-02-08 05:37:38,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:38,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-08 05:37:38,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-08 05:37:38,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:38,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:37:39,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:39,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127200059] [2025-02-08 05:37:39,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127200059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:39,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:39,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:39,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898735972] [2025-02-08 05:37:39,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:39,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:39,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:39,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:39,829 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 580 [2025-02-08 05:37:39,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 538 transitions, 1537 flow. Second operand has 6 states, 6 states have (on average 532.1666666666666) internal successors, (3193), 6 states have internal predecessors, (3193), 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) [2025-02-08 05:37:39,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:39,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 580 [2025-02-08 05:37:39,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:40,419 INFO L124 PetriNetUnfolderBase]: 261/3889 cut-off events. [2025-02-08 05:37:40,419 INFO L125 PetriNetUnfolderBase]: For 910/938 co-relation queries the response was YES. [2025-02-08 05:37:40,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5735 conditions, 3889 events. 261/3889 cut-off events. For 910/938 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 30839 event pairs, 38 based on Foata normal form. 0/3763 useless extension candidates. Maximal degree in co-relation 5637. Up to 214 conditions per place. [2025-02-08 05:37:40,471 INFO L140 encePairwiseOnDemand]: 573/580 looper letters, 38 selfloop transitions, 5 changer transitions 0/544 dead transitions. [2025-02-08 05:37:40,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 544 transitions, 1643 flow [2025-02-08 05:37:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3216 transitions. [2025-02-08 05:37:40,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241379310344827 [2025-02-08 05:37:40,473 INFO L175 Difference]: Start difference. First operand has 565 places, 538 transitions, 1537 flow. Second operand 6 states and 3216 transitions. [2025-02-08 05:37:40,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 544 transitions, 1643 flow [2025-02-08 05:37:40,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 544 transitions, 1642 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:40,483 INFO L231 Difference]: Finished difference. Result has 567 places, 536 transitions, 1542 flow [2025-02-08 05:37:40,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1542, PETRI_PLACES=567, PETRI_TRANSITIONS=536} [2025-02-08 05:37:40,484 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 26 predicate places. [2025-02-08 05:37:40,484 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 536 transitions, 1542 flow [2025-02-08 05:37:40,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.1666666666666) internal successors, (3193), 6 states have internal predecessors, (3193), 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) [2025-02-08 05:37:40,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:40,485 INFO L206 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] [2025-02-08 05:37:40,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 05:37:40,485 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:40,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2106056574, now seen corresponding path program 1 times [2025-02-08 05:37:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:40,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175940107] [2025-02-08 05:37:40,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:40,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:40,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-08 05:37:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-08 05:37:40,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:40,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:40,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:40,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175940107] [2025-02-08 05:37:40,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175940107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:40,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:40,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:40,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899276784] [2025-02-08 05:37:40,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:40,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:40,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:40,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:40,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 580 [2025-02-08 05:37:40,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 536 transitions, 1542 flow. Second operand has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 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) [2025-02-08 05:37:40,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:40,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 580 [2025-02-08 05:37:40,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1508] thread3EXIT-->L107-17: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][330], [Black: 758#(<= ~n3~0 0), Black: 759#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n3~0 0)), Black: 632#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n1~0 0)), Black: 772#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n3~0 0)), Black: 645#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n1~0 0)), Black: 637#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 639#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 631#(<= ~n1~0 0), 595#(= |#race~n3~0| 0), 624#(= |#race~a2~0| 0), Black: 723#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (not |thread1Thread1of1ForFork2_#t~short2#1|) (<= ~n2~0 0)), Black: 709#(<= ~n2~0 0), Black: 710#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~n2~0 0)), 615#(= |#race~a1~0| 0), 797#(= |#race~a3~0| 0), 589#(= |#race~n2~0| 0), 228#L107-17true, Black: 795#true, 753#true, Black: 657#(and (<= ~n2~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 662#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 607#(not |thread1Thread1of1ForFork2_#t~short2#1|), Black: 670#(and (<= ~n2~0 0) (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 656#(<= ~n2~0 0), Black: 664#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 577#(= |#race~n1~0| 0), Black: 678#(not |thread3Thread1of1ForFork0_#t~short20#1|), 727#true, Black: 613#true, Black: 738#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 732#(<= ~n3~0 0), Black: 619#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 740#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 746#(and (not |thread2Thread1of1ForFork1_#t~short11#1|) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 733#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~n3~0 0)), Black: 622#true, 820#true, Black: 686#(<= ~n1~0 0), 814#true, Black: 687#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (<= ~n1~0 0)), Black: 700#(and (= |thread3Thread1of1ForFork0_~i~2#1| 0) (not |thread3Thread1of1ForFork0_#t~short20#1|) (<= ~n1~0 0))]) [2025-02-08 05:37:41,007 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-02-08 05:37:41,007 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:41,007 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-02-08 05:37:41,007 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-02-08 05:37:41,016 INFO L124 PetriNetUnfolderBase]: 101/3188 cut-off events. [2025-02-08 05:37:41,016 INFO L125 PetriNetUnfolderBase]: For 502/557 co-relation queries the response was YES. [2025-02-08 05:37:41,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4454 conditions, 3188 events. 101/3188 cut-off events. For 502/557 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22450 event pairs, 25 based on Foata normal form. 0/3105 useless extension candidates. Maximal degree in co-relation 4357. Up to 112 conditions per place. [2025-02-08 05:37:41,053 INFO L140 encePairwiseOnDemand]: 578/580 looper letters, 8 selfloop transitions, 1 changer transitions 0/535 dead transitions. [2025-02-08 05:37:41,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 535 transitions, 1558 flow [2025-02-08 05:37:41,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1669 transitions. [2025-02-08 05:37:41,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9591954022988506 [2025-02-08 05:37:41,055 INFO L175 Difference]: Start difference. First operand has 567 places, 536 transitions, 1542 flow. Second operand 3 states and 1669 transitions. [2025-02-08 05:37:41,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 535 transitions, 1558 flow [2025-02-08 05:37:41,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 535 transitions, 1548 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:41,064 INFO L231 Difference]: Finished difference. Result has 563 places, 535 transitions, 1532 flow [2025-02-08 05:37:41,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1532, PETRI_PLACES=563, PETRI_TRANSITIONS=535} [2025-02-08 05:37:41,065 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 22 predicate places. [2025-02-08 05:37:41,065 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 535 transitions, 1532 flow [2025-02-08 05:37:41,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 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) [2025-02-08 05:37:41,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:41,066 INFO L206 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] [2025-02-08 05:37:41,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 05:37:41,066 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 92 more)] === [2025-02-08 05:37:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:41,068 INFO L85 PathProgramCache]: Analyzing trace with hash -297029058, now seen corresponding path program 1 times [2025-02-08 05:37:41,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:41,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969690245] [2025-02-08 05:37:41,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:41,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:41,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-08 05:37:41,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-08 05:37:41,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:41,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969690245] [2025-02-08 05:37:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969690245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925629445] [2025-02-08 05:37:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:41,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:41,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 553 out of 580 [2025-02-08 05:37:41,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 535 transitions, 1532 flow. Second operand has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 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) [2025-02-08 05:37:41,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:41,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 553 of 580 [2025-02-08 05:37:41,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:41,570 INFO L124 PetriNetUnfolderBase]: 104/3012 cut-off events. [2025-02-08 05:37:41,571 INFO L125 PetriNetUnfolderBase]: For 437/476 co-relation queries the response was YES. [2025-02-08 05:37:41,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4153 conditions, 3012 events. 104/3012 cut-off events. For 437/476 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 20158 event pairs, 30 based on Foata normal form. 30/2962 useless extension candidates. Maximal degree in co-relation 4056. Up to 125 conditions per place. [2025-02-08 05:37:41,599 INFO L140 encePairwiseOnDemand]: 578/580 looper letters, 0 selfloop transitions, 0 changer transitions 534/534 dead transitions. [2025-02-08 05:37:41,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 534 transitions, 1546 flow [2025-02-08 05:37:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1668 transitions. [2025-02-08 05:37:41,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9586206896551724 [2025-02-08 05:37:41,600 INFO L175 Difference]: Start difference. First operand has 563 places, 535 transitions, 1532 flow. Second operand 3 states and 1668 transitions. [2025-02-08 05:37:41,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 534 transitions, 1546 flow [2025-02-08 05:37:41,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 534 transitions, 1545 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:41,608 INFO L231 Difference]: Finished difference. Result has 563 places, 0 transitions, 0 flow [2025-02-08 05:37:41,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=580, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=563, PETRI_TRANSITIONS=0} [2025-02-08 05:37:41,609 INFO L279 CegarLoopForPetriNet]: 541 programPoint places, 22 predicate places. [2025-02-08 05:37:41,609 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 0 transitions, 0 flow [2025-02-08 05:37:41,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 556.0) internal successors, (1668), 3 states have internal predecessors, (1668), 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) [2025-02-08 05:37:41,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (95 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (94 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (93 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (92 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (91 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (90 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (89 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (88 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (87 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (86 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (85 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (84 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (83 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (82 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (81 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (80 of 96 remaining) [2025-02-08 05:37:41,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (79 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (78 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (77 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (76 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (75 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (74 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (73 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (72 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (71 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (70 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (69 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (68 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (67 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (66 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (65 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (64 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (63 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (62 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (61 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (60 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (59 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (57 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (55 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (54 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (53 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (52 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (51 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (50 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (47 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (46 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (45 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (42 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 96 remaining) [2025-02-08 05:37:41,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 96 remaining) [2025-02-08 05:37:41,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 96 remaining) [2025-02-08 05:37:41,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (38 of 96 remaining) [2025-02-08 05:37:41,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (37 of 96 remaining) [2025-02-08 05:37:41,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (35 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (34 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (33 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (32 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (31 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (24 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (23 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (12 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (11 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (10 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (9 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (7 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (4 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 96 remaining) [2025-02-08 05:37:41,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 96 remaining) [2025-02-08 05:37:41,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 05:37:41,616 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-08 05:37:41,621 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:41,621 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:41,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:41 BasicIcfg [2025-02-08 05:37:41,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:41,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:41,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:41,630 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:41,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:10" (3/4) ... [2025-02-08 05:37:41,632 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:41,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:41,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:41,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:41,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-08 05:37:41,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:41,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:41,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:41,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:41,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:41,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:41,702 INFO L158 Benchmark]: Toolchain (without parser) took 32079.74ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 103.5MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 893.1MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,703 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:41,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.65ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 90.3MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.71ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:41,703 INFO L158 Benchmark]: Boogie Preprocessor took 35.40ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 82.9MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,703 INFO L158 Benchmark]: IcfgBuilder took 760.26ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 38.1MB in the end (delta: 44.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,704 INFO L158 Benchmark]: TraceAbstraction took 30988.92ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 38.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-02-08 05:37:41,704 INFO L158 Benchmark]: Witness Printer took 72.17ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:41,705 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.16ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.65ms. Allocated memory is still 142.6MB. Free memory was 103.5MB in the beginning and 90.3MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.71ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 86.5MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.40ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 82.9MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 760.26ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 38.1MB in the end (delta: 44.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30988.92ms. Allocated memory was 142.6MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 38.1MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 72.17ms. Allocated memory is still 2.7GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: 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 7 procedures, 851 locations, 96 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.8s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6645 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4275 mSDsluCounter, 7162 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6380 mSDsCounter, 1296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10240 IncrementalHoareTripleChecker+Invalid, 11536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1296 mSolverCounterUnsat, 782 mSDtfsCounter, 10240 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1568occurred in iteration=24, InterpolantAutomatonStates: 173, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 5488 NumberOfCodeBlocks, 5488 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5454 ConstructedInterpolants, 0 QuantifiedInterpolants, 7772 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 17/17 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:41,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE