./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/fibonacci.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/fibonacci.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 115f061be4541a19227bc1624a8b38d08b679b43ee58fd41d4a05fa6a8fd007e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:38:41,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:38:41,154 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:38:41,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:38:41,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:38:41,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:38:41,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:38:41,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:38:41,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:38:41,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:38:41,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:38:41,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:38:41,185 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:38:41,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:38:41,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:38:41,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:38:41,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:38:41,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:38:41,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:38:41,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:38:41,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:38:41,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:38:41,187 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:38:41,187 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:38:41,187 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:38:41,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:41,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:38:41,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:38:41,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:38:41,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:38:41,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:38:41,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:38:41,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:38:41,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:38:41,189 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 -> 115f061be4541a19227bc1624a8b38d08b679b43ee58fd41d4a05fa6a8fd007e [2025-02-08 05:38:41,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:38:41,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:38:41,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:38:41,525 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:38:41,525 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:38:41,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/fibonacci.wvr.c [2025-02-08 05:38:42,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ecc805ea/5f049d65d2a7416fa418201067227fa0/FLAGfb5db173c [2025-02-08 05:38:43,276 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:38:43,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/fibonacci.wvr.c [2025-02-08 05:38:43,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ecc805ea/5f049d65d2a7416fa418201067227fa0/FLAGfb5db173c [2025-02-08 05:38:43,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ecc805ea/5f049d65d2a7416fa418201067227fa0 [2025-02-08 05:38:43,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:38:43,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:38:43,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:43,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:38:43,332 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:38:43,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@788099dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43, skipping insertion in model container [2025-02-08 05:38:43,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:38:43,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:43,540 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:38:43,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:38:43,581 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:38:43,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43 WrapperNode [2025-02-08 05:38:43,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:38:43,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:43,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:38:43,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:38:43,589 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:38:43" (1/1) ... [2025-02-08 05:38:43,596 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:38:43" (1/1) ... [2025-02-08 05:38:43,631 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 252 [2025-02-08 05:38:43,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:38:43,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:38:43,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:38:43,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:38:43,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:38:43,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:38:43,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:38:43,665 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:38:43,666 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (1/1) ... [2025-02-08 05:38:43,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:38:43,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:38:43,705 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:38:43,711 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:38:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:38:43,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:38:43,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:38:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:38:43,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:38:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:38:43,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:38:43,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:38:43,733 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:38:43,836 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:38:43,838 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:38:43,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:38:43,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:38:43,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 05:38:43,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-2: havoc #t~post5#1; [2025-02-08 05:38:43,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-3: ~i~0#1 := 1 + #t~post5#1; [2025-02-08 05:38:43,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44-4: #t~post5#1 := ~i~0#1; [2025-02-08 05:38:43,990 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45: havoc #t~nondet2#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-1: assume #race~f1_2~0 == #t~nondet2#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-1: assume !(#race~f1_2~0 == #t~nondet2#1); [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-2: havoc #t~ret1#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-3: #race~f1_2~0 := #t~nondet2#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-4: havoc #t~nondet2#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-5: ~f1_2~0 := #t~ret1#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret1#1 && #t~ret1#1 <= 2147483647; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-9: #t~ret1#1 := plus_#res#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46: havoc #t~nondet4#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-1: assume #race~f2_3~0 == #t~nondet4#1; [2025-02-08 05:38:43,991 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-1: assume !(#race~f2_3~0 == #t~nondet4#1); [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-2: havoc #t~ret3#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-3: #race~f2_3~0 := #t~nondet4#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: havoc #t~nondet4#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-5: ~f2_3~0 := #t~ret3#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-9: #t~ret3#1 := minus_#res#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-11: havoc minus_#res#1; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-12: assume 0 == #race~f2_3~0; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-12: assume !(0 == #race~f2_3~0); [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-13: assume { :begin_inline_minus } true;minus_#in~a#1, minus_#in~b#1 := ~f1_2~0, ~f2_3~0; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-14: assume 0 == #race~f1_2~0; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-14: assume !(0 == #race~f1_2~0); [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-15: #race~f2_3~0 := 0; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-16: #race~f1_2~0 := 0; [2025-02-08 05:38:43,992 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: minus_~b#1 := minus_#in~b#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-1: minus_~a#1 := minus_#in~a#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_~b#1 >= 0 || minus_~a#1 <= 2147483647 + minus_~b#1 then 1 else 0); [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_~b#1 <= 0 || minus_~a#1 >= minus_~b#1 - 2147483648 then 1 else 0); [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: assume { :end_inline_assume_abort_if_not } true;minus_#res#1 := minus_~a#1 - minus_~b#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:38:43,993 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 05:38:44,102 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:38:44,102 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:38:44,102 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 05:38:44,102 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-2: havoc #t~post11#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-3: ~i~1#1 := 1 + #t~post11#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54-4: #t~post11#1 := ~i~1#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55: havoc #t~nondet8#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume #race~f1_6~0 == #t~nondet8#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-1: assume !(#race~f1_6~0 == #t~nondet8#1); [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: havoc #t~ret7#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: #race~f1_6~0 := #t~nondet8#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: havoc #t~nondet8#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: ~f1_6~0 := #t~ret7#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-6: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret7#1 && #t~ret7#1 <= 2147483647; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-7: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-8: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-9: #t~ret7#1 := plus_#res#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: minus_~b#1 := minus_#in~b#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~nondet10#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L89-1: minus_~a#1 := minus_#in~a#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: assume #race~f2_7~0 == #t~nondet10#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: assume !(#race~f2_7~0 == #t~nondet10#1); [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: havoc #t~ret9#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: #race~f2_7~0 := #t~nondet10#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: havoc #t~nondet10#1; [2025-02-08 05:38:44,103 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: ~f2_7~0 := #t~ret9#1; [2025-02-08 05:38:44,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:38:44,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:38:44,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:44,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: #t~ret9#1 := minus_#res#1; [2025-02-08 05:38:44,104 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: havoc minus_#res#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-12: assume 0 == #race~f2_7~0; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-12: assume !(0 == #race~f2_7~0); [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-13: assume { :begin_inline_minus } true;minus_#in~a#1, minus_#in~b#1 := ~f1_6~0, ~f2_7~0; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-14: assume 0 == #race~f1_6~0; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-14: assume !(0 == #race~f1_6~0); [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-15: #race~f2_7~0 := 0; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-16: #race~f1_6~0 := 0; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_~b#1 >= 0 || minus_~a#1 <= 2147483647 + minus_~b#1 then 1 else 0); [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L90-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if minus_~b#1 <= 0 || minus_~a#1 >= minus_~b#1 - 2147483648 then 1 else 0); [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91: assume { :end_inline_assume_abort_if_not } true;minus_#res#1 := minus_~a#1 - minus_~b#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L91-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:38:44,105 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:38:44,106 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 05:38:44,236 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:38:44,237 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:38:44,257 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:38:44,257 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:38:44,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:44 BoogieIcfgContainer [2025-02-08 05:38:44,258 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:38:44,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:38:44,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:38:44,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:38:44,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:38:43" (1/3) ... [2025-02-08 05:38:44,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bec8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:44, skipping insertion in model container [2025-02-08 05:38:44,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:38:43" (2/3) ... [2025-02-08 05:38:44,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bec8df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:38:44, skipping insertion in model container [2025-02-08 05:38:44,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:44" (3/3) ... [2025-02-08 05:38:44,268 INFO L128 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2025-02-08 05:38:44,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:38:44,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibonacci.wvr.c that has 3 procedures, 231 locations, 1 initial locations, 2 loop locations, and 31 error locations. [2025-02-08 05:38:44,284 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:38:44,399 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:38:44,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 239 transitions, 492 flow [2025-02-08 05:38:44,535 INFO L124 PetriNetUnfolderBase]: 9/237 cut-off events. [2025-02-08 05:38:44,539 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:38:44,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 237 events. 9/237 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 340 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2025-02-08 05:38:44,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 239 transitions, 492 flow [2025-02-08 05:38:44,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 219 places, 220 transitions, 452 flow [2025-02-08 05:38:44,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:38:44,575 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;@1e35b7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:38:44,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 05:38:44,587 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:38:44,587 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:38:44,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:38:44,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:44,588 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] [2025-02-08 05:38:44,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1285624596, now seen corresponding path program 1 times [2025-02-08 05:38:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942360696] [2025-02-08 05:38:44,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:44,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:38:44,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:38:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:44,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:44,774 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:38:44,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:44,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942360696] [2025-02-08 05:38:44,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942360696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:44,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:44,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:44,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758860404] [2025-02-08 05:38:44,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:44,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:44,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:44,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:44,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 239 [2025-02-08 05:38:44,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 220 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:44,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:44,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 239 [2025-02-08 05:38:44,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:44,985 INFO L124 PetriNetUnfolderBase]: 4/302 cut-off events. [2025-02-08 05:38:44,985 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-02-08 05:38:44,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 302 events. 4/302 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 882 event pairs, 3 based on Foata normal form. 10/266 useless extension candidates. Maximal degree in co-relation 197. Up to 16 conditions per place. [2025-02-08 05:38:44,989 INFO L140 encePairwiseOnDemand]: 229/239 looper letters, 9 selfloop transitions, 2 changer transitions 1/212 dead transitions. [2025-02-08 05:38:44,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 212 transitions, 458 flow [2025-02-08 05:38:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-02-08 05:38:45,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344490934449093 [2025-02-08 05:38:45,011 INFO L175 Difference]: Start difference. First operand has 219 places, 220 transitions, 452 flow. Second operand 3 states and 670 transitions. [2025-02-08 05:38:45,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 212 transitions, 458 flow [2025-02-08 05:38:45,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 212 transitions, 450 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:38:45,024 INFO L231 Difference]: Finished difference. Result has 216 places, 211 transitions, 430 flow [2025-02-08 05:38:45,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=216, PETRI_TRANSITIONS=211} [2025-02-08 05:38:45,031 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -3 predicate places. [2025-02-08 05:38:45,031 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 211 transitions, 430 flow [2025-02-08 05:38:45,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,032 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] [2025-02-08 05:38:45,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:38:45,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:45,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash 572176031, now seen corresponding path program 1 times [2025-02-08 05:38:45,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831327369] [2025-02-08 05:38:45,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:38:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:38:45,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,095 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:38:45,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831327369] [2025-02-08 05:38:45,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831327369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4485315] [2025-02-08 05:38:45,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 239 [2025-02-08 05:38:45,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 211 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 239 [2025-02-08 05:38:45,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,178 INFO L124 PetriNetUnfolderBase]: 3/286 cut-off events. [2025-02-08 05:38:45,178 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:45,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 286 events. 3/286 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 749 event pairs, 2 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 280. Up to 15 conditions per place. [2025-02-08 05:38:45,180 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 10 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-02-08 05:38:45,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 210 transitions, 452 flow [2025-02-08 05:38:45,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2025-02-08 05:38:45,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218967921896792 [2025-02-08 05:38:45,183 INFO L175 Difference]: Start difference. First operand has 216 places, 211 transitions, 430 flow. Second operand 3 states and 661 transitions. [2025-02-08 05:38:45,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 210 transitions, 452 flow [2025-02-08 05:38:45,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 210 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,188 INFO L231 Difference]: Finished difference. Result has 214 places, 210 transitions, 428 flow [2025-02-08 05:38:45,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=214, PETRI_TRANSITIONS=210} [2025-02-08 05:38:45,192 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -5 predicate places. [2025-02-08 05:38:45,192 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 210 transitions, 428 flow [2025-02-08 05:38:45,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,193 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] [2025-02-08 05:38:45,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:38:45,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:45,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2051215150, now seen corresponding path program 1 times [2025-02-08 05:38:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150761529] [2025-02-08 05:38:45,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 05:38:45,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:38:45,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,244 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:38:45,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150761529] [2025-02-08 05:38:45,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150761529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299692117] [2025-02-08 05:38:45,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 239 [2025-02-08 05:38:45,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 210 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 239 [2025-02-08 05:38:45,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,327 INFO L124 PetriNetUnfolderBase]: 2/258 cut-off events. [2025-02-08 05:38:45,327 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-02-08 05:38:45,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 258 events. 2/258 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 566 event pairs, 1 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 240. Up to 12 conditions per place. [2025-02-08 05:38:45,330 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 9 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2025-02-08 05:38:45,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 209 transitions, 448 flow [2025-02-08 05:38:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-08 05:38:45,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9246861924686193 [2025-02-08 05:38:45,332 INFO L175 Difference]: Start difference. First operand has 214 places, 210 transitions, 428 flow. Second operand 3 states and 663 transitions. [2025-02-08 05:38:45,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 209 transitions, 448 flow [2025-02-08 05:38:45,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 209 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,341 INFO L231 Difference]: Finished difference. Result has 213 places, 209 transitions, 426 flow [2025-02-08 05:38:45,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=213, PETRI_TRANSITIONS=209} [2025-02-08 05:38:45,342 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -6 predicate places. [2025-02-08 05:38:45,342 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 209 transitions, 426 flow [2025-02-08 05:38:45,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,343 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] [2025-02-08 05:38:45,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:45,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:45,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1837892738, now seen corresponding path program 1 times [2025-02-08 05:38:45,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385801797] [2025-02-08 05:38:45,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 05:38:45,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:38:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,421 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:38:45,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385801797] [2025-02-08 05:38:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385801797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569761416] [2025-02-08 05:38:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 239 [2025-02-08 05:38:45,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 209 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 239 [2025-02-08 05:38:45,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,527 INFO L124 PetriNetUnfolderBase]: 2/257 cut-off events. [2025-02-08 05:38:45,527 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:38:45,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 257 events. 2/257 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 509 event pairs, 1 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 231. Up to 12 conditions per place. [2025-02-08 05:38:45,530 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 9 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2025-02-08 05:38:45,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 208 transitions, 446 flow [2025-02-08 05:38:45,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-08 05:38:45,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9246861924686193 [2025-02-08 05:38:45,533 INFO L175 Difference]: Start difference. First operand has 213 places, 209 transitions, 426 flow. Second operand 3 states and 663 transitions. [2025-02-08 05:38:45,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 208 transitions, 446 flow [2025-02-08 05:38:45,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 208 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,539 INFO L231 Difference]: Finished difference. Result has 212 places, 208 transitions, 424 flow [2025-02-08 05:38:45,539 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=212, PETRI_TRANSITIONS=208} [2025-02-08 05:38:45,540 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -7 predicate places. [2025-02-08 05:38:45,540 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 208 transitions, 424 flow [2025-02-08 05:38:45,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,542 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] [2025-02-08 05:38:45,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:45,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:45,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1061086143, now seen corresponding path program 1 times [2025-02-08 05:38:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505173165] [2025-02-08 05:38:45,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:38:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:38:45,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,623 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:38:45,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505173165] [2025-02-08 05:38:45,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505173165] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076585305] [2025-02-08 05:38:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 239 [2025-02-08 05:38:45,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 208 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 239 [2025-02-08 05:38:45,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,694 INFO L124 PetriNetUnfolderBase]: 3/246 cut-off events. [2025-02-08 05:38:45,694 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-08 05:38:45,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 246 events. 3/246 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 422 event pairs, 2 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 214. Up to 15 conditions per place. [2025-02-08 05:38:45,696 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 10 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2025-02-08 05:38:45,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 207 transitions, 446 flow [2025-02-08 05:38:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2025-02-08 05:38:45,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218967921896792 [2025-02-08 05:38:45,699 INFO L175 Difference]: Start difference. First operand has 212 places, 208 transitions, 424 flow. Second operand 3 states and 661 transitions. [2025-02-08 05:38:45,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 207 transitions, 446 flow [2025-02-08 05:38:45,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 207 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,703 INFO L231 Difference]: Finished difference. Result has 211 places, 207 transitions, 422 flow [2025-02-08 05:38:45,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=211, PETRI_TRANSITIONS=207} [2025-02-08 05:38:45,704 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -8 predicate places. [2025-02-08 05:38:45,704 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 207 transitions, 422 flow [2025-02-08 05:38:45,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,705 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] [2025-02-08 05:38:45,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:45,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1383276147, now seen corresponding path program 1 times [2025-02-08 05:38:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627006396] [2025-02-08 05:38:45,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:38:45,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:38:45,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,790 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:38:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627006396] [2025-02-08 05:38:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627006396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216845287] [2025-02-08 05:38:45,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 239 [2025-02-08 05:38:45,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 207 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 239 [2025-02-08 05:38:45,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,861 INFO L124 PetriNetUnfolderBase]: 2/230 cut-off events. [2025-02-08 05:38:45,861 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:38:45,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 230 events. 2/230 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 385 event pairs, 1 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 187. Up to 12 conditions per place. [2025-02-08 05:38:45,863 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 9 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2025-02-08 05:38:45,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 206 transitions, 442 flow [2025-02-08 05:38:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-08 05:38:45,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9246861924686193 [2025-02-08 05:38:45,865 INFO L175 Difference]: Start difference. First operand has 211 places, 207 transitions, 422 flow. Second operand 3 states and 663 transitions. [2025-02-08 05:38:45,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 206 transitions, 442 flow [2025-02-08 05:38:45,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,869 INFO L231 Difference]: Finished difference. Result has 210 places, 206 transitions, 420 flow [2025-02-08 05:38:45,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=210, PETRI_TRANSITIONS=206} [2025-02-08 05:38:45,870 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -9 predicate places. [2025-02-08 05:38:45,870 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 206 transitions, 420 flow [2025-02-08 05:38:45,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,870 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] [2025-02-08 05:38:45,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:45,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:45,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash -255604463, now seen corresponding path program 1 times [2025-02-08 05:38:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646242410] [2025-02-08 05:38:45,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 05:38:45,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 05:38:45,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:45,924 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:38:45,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646242410] [2025-02-08 05:38:45,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646242410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:45,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:45,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:45,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648661428] [2025-02-08 05:38:45,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:45,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:45,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:45,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:45,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 239 [2025-02-08 05:38:45,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 206 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:45,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 239 [2025-02-08 05:38:45,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:45,984 INFO L124 PetriNetUnfolderBase]: 2/207 cut-off events. [2025-02-08 05:38:45,985 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-02-08 05:38:45,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 207 events. 2/207 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 324 event pairs, 1 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 156. Up to 12 conditions per place. [2025-02-08 05:38:45,986 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 9 selfloop transitions, 2 changer transitions 0/205 dead transitions. [2025-02-08 05:38:45,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 205 transitions, 440 flow [2025-02-08 05:38:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-08 05:38:45,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9246861924686193 [2025-02-08 05:38:45,989 INFO L175 Difference]: Start difference. First operand has 210 places, 206 transitions, 420 flow. Second operand 3 states and 663 transitions. [2025-02-08 05:38:45,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 205 transitions, 440 flow [2025-02-08 05:38:45,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 205 transitions, 436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:45,993 INFO L231 Difference]: Finished difference. Result has 209 places, 205 transitions, 418 flow [2025-02-08 05:38:45,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=209, PETRI_TRANSITIONS=205} [2025-02-08 05:38:45,994 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -10 predicate places. [2025-02-08 05:38:45,994 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 205 transitions, 418 flow [2025-02-08 05:38:45,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:45,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:45,995 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] [2025-02-08 05:38:45,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:45,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:45,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:45,996 INFO L85 PathProgramCache]: Analyzing trace with hash -381074878, now seen corresponding path program 1 times [2025-02-08 05:38:45,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:45,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-02-08 05:38:45,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:45,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-08 05:38:46,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 05:38:46,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,072 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:38:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176457910] [2025-02-08 05:38:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176457910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105660501] [2025-02-08 05:38:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 239 [2025-02-08 05:38:46,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 205 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:38:46,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 239 [2025-02-08 05:38:46,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,126 INFO L124 PetriNetUnfolderBase]: 5/288 cut-off events. [2025-02-08 05:38:46,127 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:46,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 288 events. 5/288 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 796 event pairs, 4 based on Foata normal form. 0/256 useless extension candidates. Maximal degree in co-relation 239. Up to 18 conditions per place. [2025-02-08 05:38:46,128 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 10 selfloop transitions, 1 changer transitions 0/202 dead transitions. [2025-02-08 05:38:46,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 202 transitions, 434 flow [2025-02-08 05:38:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-02-08 05:38:46,136 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9232914923291492 [2025-02-08 05:38:46,137 INFO L175 Difference]: Start difference. First operand has 209 places, 205 transitions, 418 flow. Second operand 3 states and 662 transitions. [2025-02-08 05:38:46,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 202 transitions, 434 flow [2025-02-08 05:38:46,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 202 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:46,140 INFO L231 Difference]: Finished difference. Result has 206 places, 202 transitions, 410 flow [2025-02-08 05:38:46,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=206, PETRI_TRANSITIONS=202} [2025-02-08 05:38:46,142 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2025-02-08 05:38:46,142 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 202 transitions, 410 flow [2025-02-08 05:38:46,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:38:46,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,144 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] [2025-02-08 05:38:46,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:46,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:46,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1140723817, now seen corresponding path program 1 times [2025-02-08 05:38:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814147454] [2025-02-08 05:38:46,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-02-08 05:38:46,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-02-08 05:38:46,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,206 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:38:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814147454] [2025-02-08 05:38:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814147454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242048151] [2025-02-08 05:38:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 239 [2025-02-08 05:38:46,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 202 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:38:46,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 239 [2025-02-08 05:38:46,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,257 INFO L124 PetriNetUnfolderBase]: 5/238 cut-off events. [2025-02-08 05:38:46,257 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:38:46,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 238 events. 5/238 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 452 event pairs, 4 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 184. Up to 18 conditions per place. [2025-02-08 05:38:46,258 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 10 selfloop transitions, 1 changer transitions 0/199 dead transitions. [2025-02-08 05:38:46,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 199 transitions, 426 flow [2025-02-08 05:38:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-02-08 05:38:46,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9232914923291492 [2025-02-08 05:38:46,261 INFO L175 Difference]: Start difference. First operand has 206 places, 202 transitions, 410 flow. Second operand 3 states and 662 transitions. [2025-02-08 05:38:46,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 199 transitions, 426 flow [2025-02-08 05:38:46,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 199 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:46,264 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 405 flow [2025-02-08 05:38:46,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2025-02-08 05:38:46,265 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -15 predicate places. [2025-02-08 05:38:46,266 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 405 flow [2025-02-08 05:38:46,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:38:46,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,266 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] [2025-02-08 05:38:46,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:46,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 76085904, now seen corresponding path program 1 times [2025-02-08 05:38:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779818725] [2025-02-08 05:38:46,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-08 05:38:46,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-08 05:38:46,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,334 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:38:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779818725] [2025-02-08 05:38:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779818725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070261318] [2025-02-08 05:38:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 239 [2025-02-08 05:38:46,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 199 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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:38:46,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 239 [2025-02-08 05:38:46,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,390 INFO L124 PetriNetUnfolderBase]: 4/312 cut-off events. [2025-02-08 05:38:46,391 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:46,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 312 events. 4/312 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 950 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 263. Up to 14 conditions per place. [2025-02-08 05:38:46,394 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 12 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-02-08 05:38:46,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 443 flow [2025-02-08 05:38:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-02-08 05:38:46,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386331938633193 [2025-02-08 05:38:46,396 INFO L175 Difference]: Start difference. First operand has 204 places, 199 transitions, 405 flow. Second operand 3 states and 673 transitions. [2025-02-08 05:38:46,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 443 flow [2025-02-08 05:38:46,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 202 transitions, 442 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:46,402 INFO L231 Difference]: Finished difference. Result has 204 places, 198 transitions, 410 flow [2025-02-08 05:38:46,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=204, PETRI_TRANSITIONS=198} [2025-02-08 05:38:46,403 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -15 predicate places. [2025-02-08 05:38:46,403 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 198 transitions, 410 flow [2025-02-08 05:38:46,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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:38:46,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,404 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] [2025-02-08 05:38:46,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:46,404 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:46,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash 104121503, now seen corresponding path program 1 times [2025-02-08 05:38:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-02-08 05:38:46,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:38:46,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:38:46,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,457 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:38:46,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453992658] [2025-02-08 05:38:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453992658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396493627] [2025-02-08 05:38:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 239 [2025-02-08 05:38:46,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 198 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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:38:46,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 239 [2025-02-08 05:38:46,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,546 INFO L124 PetriNetUnfolderBase]: 4/353 cut-off events. [2025-02-08 05:38:46,546 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-02-08 05:38:46,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 353 events. 4/353 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1182 event pairs, 2 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 311. Up to 18 conditions per place. [2025-02-08 05:38:46,547 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 12 selfloop transitions, 2 changer transitions 0/201 dead transitions. [2025-02-08 05:38:46,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 201 transitions, 448 flow [2025-02-08 05:38:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-02-08 05:38:46,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386331938633193 [2025-02-08 05:38:46,549 INFO L175 Difference]: Start difference. First operand has 204 places, 198 transitions, 410 flow. Second operand 3 states and 673 transitions. [2025-02-08 05:38:46,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 201 transitions, 448 flow [2025-02-08 05:38:46,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 201 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:46,552 INFO L231 Difference]: Finished difference. Result has 205 places, 197 transitions, 416 flow [2025-02-08 05:38:46,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=205, PETRI_TRANSITIONS=197} [2025-02-08 05:38:46,555 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -14 predicate places. [2025-02-08 05:38:46,555 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 197 transitions, 416 flow [2025-02-08 05:38:46,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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:38:46,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,556 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] [2025-02-08 05:38:46,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:46,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:46,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,557 INFO L85 PathProgramCache]: Analyzing trace with hash -205404037, now seen corresponding path program 1 times [2025-02-08 05:38:46,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-02-08 05:38:46,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:38:46,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:38:46,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,622 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:38:46,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-02-08 05:38:46,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366318073] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830912713] [2025-02-08 05:38:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 239 [2025-02-08 05:38:46,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 197 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 239 [2025-02-08 05:38:46,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,717 INFO L124 PetriNetUnfolderBase]: 16/711 cut-off events. [2025-02-08 05:38:46,717 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:38:46,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 711 events. 16/711 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4104 event pairs, 10 based on Foata normal form. 0/646 useless extension candidates. Maximal degree in co-relation 719. Up to 44 conditions per place. [2025-02-08 05:38:46,720 INFO L140 encePairwiseOnDemand]: 235/239 looper letters, 10 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2025-02-08 05:38:46,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 198 transitions, 443 flow [2025-02-08 05:38:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2025-02-08 05:38:46,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358437935843794 [2025-02-08 05:38:46,722 INFO L175 Difference]: Start difference. First operand has 205 places, 197 transitions, 416 flow. Second operand 3 states and 671 transitions. [2025-02-08 05:38:46,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 198 transitions, 443 flow [2025-02-08 05:38:46,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 198 transitions, 443 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:46,726 INFO L231 Difference]: Finished difference. Result has 206 places, 197 transitions, 426 flow [2025-02-08 05:38:46,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=206, PETRI_TRANSITIONS=197} [2025-02-08 05:38:46,728 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2025-02-08 05:38:46,729 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 197 transitions, 426 flow [2025-02-08 05:38:46,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:46,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,730 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] [2025-02-08 05:38:46,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:46,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:46,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash -80817921, now seen corresponding path program 1 times [2025-02-08 05:38:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951685394] [2025-02-08 05:38:46,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:38:46,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:38:46,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,772 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:38:46,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951685394] [2025-02-08 05:38:46,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951685394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062574041] [2025-02-08 05:38:46,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 239 [2025-02-08 05:38:46,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 197 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:38:46,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 239 [2025-02-08 05:38:46,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:46,858 INFO L124 PetriNetUnfolderBase]: 10/485 cut-off events. [2025-02-08 05:38:46,858 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-02-08 05:38:46,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 485 events. 10/485 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2240 event pairs, 4 based on Foata normal form. 2/452 useless extension candidates. Maximal degree in co-relation 488. Up to 24 conditions per place. [2025-02-08 05:38:46,860 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 9 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-02-08 05:38:46,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 197 transitions, 449 flow [2025-02-08 05:38:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-02-08 05:38:46,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9330543933054394 [2025-02-08 05:38:46,862 INFO L175 Difference]: Start difference. First operand has 206 places, 197 transitions, 426 flow. Second operand 3 states and 669 transitions. [2025-02-08 05:38:46,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 197 transitions, 449 flow [2025-02-08 05:38:46,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 197 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:38:46,866 INFO L231 Difference]: Finished difference. Result has 207 places, 196 transitions, 428 flow [2025-02-08 05:38:46,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=207, PETRI_TRANSITIONS=196} [2025-02-08 05:38:46,867 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -12 predicate places. [2025-02-08 05:38:46,867 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 196 transitions, 428 flow [2025-02-08 05:38:46,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 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:38:46,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:46,868 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] [2025-02-08 05:38:46,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:46,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:46,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash -291620615, now seen corresponding path program 1 times [2025-02-08 05:38:46,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:46,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-02-08 05:38:46,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:46,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:38:46,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:38:46,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:46,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:46,931 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:38:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:46,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145780069] [2025-02-08 05:38:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145780069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:46,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:46,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546684507] [2025-02-08 05:38:46,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:46,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:46,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:46,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:46,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 239 [2025-02-08 05:38:46,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 196 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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:38:46,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:46,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 239 [2025-02-08 05:38:46,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,022 INFO L124 PetriNetUnfolderBase]: 10/395 cut-off events. [2025-02-08 05:38:47,023 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2025-02-08 05:38:47,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 395 events. 10/395 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1630 event pairs, 4 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 403. Up to 28 conditions per place. [2025-02-08 05:38:47,025 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 9 selfloop transitions, 2 changer transitions 26/196 dead transitions. [2025-02-08 05:38:47,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 196 transitions, 451 flow [2025-02-08 05:38:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2025-02-08 05:38:47,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9330543933054394 [2025-02-08 05:38:47,027 INFO L175 Difference]: Start difference. First operand has 207 places, 196 transitions, 428 flow. Second operand 3 states and 669 transitions. [2025-02-08 05:38:47,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 196 transitions, 451 flow [2025-02-08 05:38:47,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 196 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:47,032 INFO L231 Difference]: Finished difference. Result has 206 places, 169 transitions, 369 flow [2025-02-08 05:38:47,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=206, PETRI_TRANSITIONS=169} [2025-02-08 05:38:47,034 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -13 predicate places. [2025-02-08 05:38:47,034 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 169 transitions, 369 flow [2025-02-08 05:38:47,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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:38:47,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,035 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] [2025-02-08 05:38:47,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:47,035 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:47,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1110200486, now seen corresponding path program 1 times [2025-02-08 05:38:47,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419546589] [2025-02-08 05:38:47,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:38:47,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:38:47,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,106 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:38:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419546589] [2025-02-08 05:38:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419546589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896707351] [2025-02-08 05:38:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 239 [2025-02-08 05:38:47,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 169 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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:38:47,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 239 [2025-02-08 05:38:47,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,170 INFO L124 PetriNetUnfolderBase]: 4/411 cut-off events. [2025-02-08 05:38:47,170 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:47,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 411 events. 4/411 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1568 event pairs, 2 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 419. Up to 16 conditions per place. [2025-02-08 05:38:47,172 INFO L140 encePairwiseOnDemand]: 237/239 looper letters, 7 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2025-02-08 05:38:47,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 168 transitions, 383 flow [2025-02-08 05:38:47,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2025-02-08 05:38:47,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372384937238494 [2025-02-08 05:38:47,174 INFO L175 Difference]: Start difference. First operand has 206 places, 169 transitions, 369 flow. Second operand 3 states and 672 transitions. [2025-02-08 05:38:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 168 transitions, 383 flow [2025-02-08 05:38:47,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 168 transitions, 378 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:38:47,178 INFO L231 Difference]: Finished difference. Result has 179 places, 168 transitions, 364 flow [2025-02-08 05:38:47,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=179, PETRI_TRANSITIONS=168} [2025-02-08 05:38:47,180 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -40 predicate places. [2025-02-08 05:38:47,180 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 168 transitions, 364 flow [2025-02-08 05:38:47,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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:38:47,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:47,181 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] [2025-02-08 05:38:47,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:47,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 31 more)] === [2025-02-08 05:38:47,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1229224372, now seen corresponding path program 1 times [2025-02-08 05:38:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:47,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78618881] [2025-02-08 05:38:47,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:47,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:38:47,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:38:47,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:47,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:47,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:38:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78618881] [2025-02-08 05:38:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78618881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912784123] [2025-02-08 05:38:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:47,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:47,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:47,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:47,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 239 [2025-02-08 05:38:47,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 168 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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:38:47,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:47,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 239 [2025-02-08 05:38:47,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:47,308 INFO L124 PetriNetUnfolderBase]: 4/325 cut-off events. [2025-02-08 05:38:47,309 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:47,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 325 events. 4/325 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1031 event pairs, 2 based on Foata normal form. 2/314 useless extension candidates. Maximal degree in co-relation 364. Up to 18 conditions per place. [2025-02-08 05:38:47,310 INFO L140 encePairwiseOnDemand]: 237/239 looper letters, 0 selfloop transitions, 0 changer transitions 167/167 dead transitions. [2025-02-08 05:38:47,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 167 transitions, 376 flow [2025-02-08 05:38:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2025-02-08 05:38:47,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358437935843794 [2025-02-08 05:38:47,312 INFO L175 Difference]: Start difference. First operand has 179 places, 168 transitions, 364 flow. Second operand 3 states and 671 transitions. [2025-02-08 05:38:47,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 167 transitions, 376 flow [2025-02-08 05:38:47,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 167 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:38:47,314 INFO L231 Difference]: Finished difference. Result has 179 places, 0 transitions, 0 flow [2025-02-08 05:38:47,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=179, PETRI_TRANSITIONS=0} [2025-02-08 05:38:47,315 INFO L279 CegarLoopForPetriNet]: 219 programPoint places, -40 predicate places. [2025-02-08 05:38:47,315 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 0 transitions, 0 flow [2025-02-08 05:38:47,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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:38:47,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (34 of 35 remaining) [2025-02-08 05:38:47,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (33 of 35 remaining) [2025-02-08 05:38:47,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (32 of 35 remaining) [2025-02-08 05:38:47,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (31 of 35 remaining) [2025-02-08 05:38:47,318 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (30 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (29 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (27 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (26 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (24 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (21 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (19 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 35 remaining) [2025-02-08 05:38:47,319 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (9 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (8 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (7 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (6 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (5 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 35 remaining) [2025-02-08 05:38:47,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 35 remaining) [2025-02-08 05:38:47,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:38:47,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:47,327 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:38:47,327 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:38:47,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:38:47 BasicIcfg [2025-02-08 05:38:47,335 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:38:47,336 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:38:47,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:38:47,336 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:38:47,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:38:44" (3/4) ... [2025-02-08 05:38:47,338 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:38:47,341 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:38:47,341 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:38:47,346 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 05:38:47,346 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:38:47,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:38:47,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:38:47,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:38:47,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:38:47,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:38:47,430 INFO L158 Benchmark]: Toolchain (without parser) took 4104.96ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.9MB in the beginning and 125.0MB in the end (delta: -12.2MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2025-02-08 05:38:47,431 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:47,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.92ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:47,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.94ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:38:47,431 INFO L158 Benchmark]: Boogie Preprocessor took 28.17ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.4MB in the end (delta: 994.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:47,432 INFO L158 Benchmark]: IcfgBuilder took 593.30ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 73.3MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:38:47,432 INFO L158 Benchmark]: TraceAbstraction took 3075.12ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.7MB in the beginning and 131.7MB in the end (delta: -59.0MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. [2025-02-08 05:38:47,433 INFO L158 Benchmark]: Witness Printer took 93.15ms. Allocated memory is still 176.2MB. Free memory was 131.7MB in the beginning and 125.0MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:38:47,434 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.32ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.92ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 100.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.94ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.17ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 97.4MB in the end (delta: 994.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 593.30ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 73.3MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3075.12ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 72.7MB in the beginning and 131.7MB in the end (delta: -59.0MB). Peak memory consumption was 52.7MB. Max. memory is 16.1GB. * Witness Printer took 93.15ms. Allocated memory is still 176.2MB. Free memory was 131.7MB in the beginning and 125.0MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 325 locations, 35 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 329 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 368 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 72 mSDtfsCounter, 368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1215 NumberOfCodeBlocks, 1215 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:38:47,453 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