./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-subst.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 e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:23,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:23,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:23,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:23,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:23,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:23,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:23,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:23,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:23,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:23,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:23,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:23,144 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:23,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:23,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:23,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:23,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:23,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:23,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:23,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:23,147 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 -> e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 [2025-02-08 05:37:23,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:23,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:23,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:23,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:23,364 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:23,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-02-08 05:37:24,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71930aea4/60ed5a32b19e404883d25fb69d86d7de/FLAG5099ac7bb [2025-02-08 05:37:24,777 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:24,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-02-08 05:37:24,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71930aea4/60ed5a32b19e404883d25fb69d86d7de/FLAG5099ac7bb [2025-02-08 05:37:24,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71930aea4/60ed5a32b19e404883d25fb69d86d7de [2025-02-08 05:37:24,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:24,801 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:24,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:24,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:24,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:24,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:24" (1/1) ... [2025-02-08 05:37:24,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355e76a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:24, skipping insertion in model container [2025-02-08 05:37:24,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:24" (1/1) ... [2025-02-08 05:37:24,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:24,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:24,980 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:25,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:25,030 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:25,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25 WrapperNode [2025-02-08 05:37:25,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:25,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:25,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:25,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:25,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,088 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 19, calls inlined = 41, statements flattened = 545 [2025-02-08 05:37:25,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:25,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:25,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:25,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:25,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,112 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:25,118 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:25,118 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:25,118 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:25,119 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (1/1) ... [2025-02-08 05:37:25,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:25,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:25,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:37:25,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:37:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:25,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:25,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:25,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:37:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:37:25,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:25,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:25,189 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:25,279 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:25,280 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-7: #t~ite4#1 := #t~ret3#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L45-11: #t~ret3#1 := minus_#res#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-7: #t~ite7#1 := #t~ret6#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-11: #t~ret6#1 := minus_#res#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-7: #t~ite10#1 := #t~ret9#1; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:37:25,455 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,456 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-11: #t~ret9#1 := minus_#res#1; [2025-02-08 05:37:25,621 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: #t~ite15#1 := #t~ret14#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: #t~ret14#1 := minus_#res#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-7: #t~ite18#1 := #t~ret17#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-11: #t~ret17#1 := minus_#res#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-7: #t~ite21#1 := #t~ret20#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret20#1 && #t~ret20#1 <= 2147483647; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,622 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-11: #t~ret20#1 := minus_#res#1; [2025-02-08 05:37:25,763 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-7: #t~ite29#1 := #t~ret28#1; [2025-02-08 05:37:25,763 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret28#1 && #t~ret28#1 <= 2147483647; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-11: #t~ret28#1 := minus_#res#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-7: #t~ite32#1 := #t~ret31#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret31#1 && #t~ret31#1 <= 2147483647; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-11: #t~ret31#1 := minus_#res#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-7: #t~ite26#1 := #t~ret25#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret25#1 && #t~ret25#1 <= 2147483647; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:25,764 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L67-11: #t~ret25#1 := minus_#res#1; [2025-02-08 05:37:25,893 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:25,893 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:26,231 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-2 is not an error location. [2025-02-08 05:37:26,232 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-1 is not an error location. [2025-02-08 05:37:26,232 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 05:37:26,232 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-2 is not an error location. [2025-02-08 05:37:26,232 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-1 is not an error location. [2025-02-08 05:37:26,232 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 05:37:26,232 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-2 is not an error location. [2025-02-08 05:37:26,233 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109-1 is not an error location. [2025-02-08 05:37:26,233 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L109 is not an error location. [2025-02-08 05:37:26,236 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:26,236 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:26,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:26 BoogieIcfgContainer [2025-02-08 05:37:26,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:26,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:26,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:26,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:26,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:24" (1/3) ... [2025-02-08 05:37:26,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ece82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:26, skipping insertion in model container [2025-02-08 05:37:26,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:25" (2/3) ... [2025-02-08 05:37:26,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244ece82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:26, skipping insertion in model container [2025-02-08 05:37:26,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:26" (3/3) ... [2025-02-08 05:37:26,246 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2025-02-08 05:37:26,283 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:26,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-subst.wvr.c that has 4 procedures, 275 locations, 1 initial locations, 0 loop locations, and 71 error locations. [2025-02-08 05:37:26,284 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:26,356 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:26,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 284 places, 277 transitions, 575 flow [2025-02-08 05:37:26,437 INFO L124 PetriNetUnfolderBase]: 3/274 cut-off events. [2025-02-08 05:37:26,438 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:26,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 274 events. 3/274 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 491 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2025-02-08 05:37:26,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 284 places, 277 transitions, 575 flow [2025-02-08 05:37:26,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 254 transitions, 526 flow [2025-02-08 05:37:26,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:26,458 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;@440239a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:26,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 128 error locations. [2025-02-08 05:37:26,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:26,463 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-02-08 05:37:26,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:26,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,463 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] [2025-02-08 05:37:26,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:26,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash -563874861, now seen corresponding path program 1 times [2025-02-08 05:37:26,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990027622] [2025-02-08 05:37:26,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 05:37:26,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 05:37:26,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:26,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990027622] [2025-02-08 05:37:26,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990027622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138024479] [2025-02-08 05:37:26,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:26,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:26,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:26,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:26,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 254 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:26,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,732 INFO L124 PetriNetUnfolderBase]: 56/324 cut-off events. [2025-02-08 05:37:26,732 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 05:37:26,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 324 events. 56/324 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 734 event pairs, 56 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 269. Up to 112 conditions per place. [2025-02-08 05:37:26,735 INFO L140 encePairwiseOnDemand]: 213/277 looper letters, 12 selfloop transitions, 2 changer transitions 4/192 dead transitions. [2025-02-08 05:37:26,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 192 transitions, 436 flow [2025-02-08 05:37:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:26,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2025-02-08 05:37:26,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7990373044524669 [2025-02-08 05:37:26,745 INFO L175 Difference]: Start difference. First operand has 263 places, 254 transitions, 526 flow. Second operand 3 states and 664 transitions. [2025-02-08 05:37:26,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 192 transitions, 436 flow [2025-02-08 05:37:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 192 transitions, 424 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:26,756 INFO L231 Difference]: Finished difference. Result has 198 places, 188 transitions, 386 flow [2025-02-08 05:37:26,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=198, PETRI_TRANSITIONS=188} [2025-02-08 05:37:26,760 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -65 predicate places. [2025-02-08 05:37:26,760 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 188 transitions, 386 flow [2025-02-08 05:37:26,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,760 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] [2025-02-08 05:37:26,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:26,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:26,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1463587214, now seen corresponding path program 1 times [2025-02-08 05:37:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734191630] [2025-02-08 05:37:26,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:37:26,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:37:26,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:26,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:26,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734191630] [2025-02-08 05:37:26,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734191630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:26,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114025997] [2025-02-08 05:37:26,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:26,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:26,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:26,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 188 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:26,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,863 INFO L124 PetriNetUnfolderBase]: 15/234 cut-off events. [2025-02-08 05:37:26,863 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:26,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 234 events. 15/234 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 223 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 247. Up to 40 conditions per place. [2025-02-08 05:37:26,864 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-02-08 05:37:26,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 187 transitions, 412 flow [2025-02-08 05:37:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:26,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:26,865 INFO L175 Difference]: Start difference. First operand has 198 places, 188 transitions, 386 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:26,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 187 transitions, 412 flow [2025-02-08 05:37:26,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 187 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:26,872 INFO L231 Difference]: Finished difference. Result has 193 places, 187 transitions, 384 flow [2025-02-08 05:37:26,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=193, PETRI_TRANSITIONS=187} [2025-02-08 05:37:26,873 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -70 predicate places. [2025-02-08 05:37:26,873 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 187 transitions, 384 flow [2025-02-08 05:37:26,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,873 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] [2025-02-08 05:37:26,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:26,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:26,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1477801865, now seen corresponding path program 1 times [2025-02-08 05:37:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147275498] [2025-02-08 05:37:26,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:26,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 05:37:26,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 05:37:26,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:26,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147275498] [2025-02-08 05:37:26,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147275498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:26,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:26,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572453062] [2025-02-08 05:37:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:26,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:26,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:26,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:26,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:26,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 187 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:26,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:26,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:26,985 INFO L124 PetriNetUnfolderBase]: 15/233 cut-off events. [2025-02-08 05:37:26,985 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:26,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 233 events. 15/233 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 221 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 238. Up to 40 conditions per place. [2025-02-08 05:37:26,986 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-02-08 05:37:26,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 186 transitions, 410 flow [2025-02-08 05:37:26,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:26,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:26,988 INFO L175 Difference]: Start difference. First operand has 193 places, 187 transitions, 384 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:26,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 186 transitions, 410 flow [2025-02-08 05:37:26,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 186 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:26,990 INFO L231 Difference]: Finished difference. Result has 192 places, 186 transitions, 382 flow [2025-02-08 05:37:26,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=192, PETRI_TRANSITIONS=186} [2025-02-08 05:37:26,991 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -71 predicate places. [2025-02-08 05:37:26,991 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 186 transitions, 382 flow [2025-02-08 05:37:26,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:26,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:26,992 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] [2025-02-08 05:37:26,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:26,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:26,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash 178729379, now seen corresponding path program 1 times [2025-02-08 05:37:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308512766] [2025-02-08 05:37:26,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:26,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:37:27,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:37:27,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308512766] [2025-02-08 05:37:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308512766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947171995] [2025-02-08 05:37:27,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 186 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,085 INFO L124 PetriNetUnfolderBase]: 15/232 cut-off events. [2025-02-08 05:37:27,085 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 232 events. 15/232 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 229. Up to 40 conditions per place. [2025-02-08 05:37:27,086 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-02-08 05:37:27,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 185 transitions, 408 flow [2025-02-08 05:37:27,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,087 INFO L175 Difference]: Start difference. First operand has 192 places, 186 transitions, 382 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 185 transitions, 408 flow [2025-02-08 05:37:27,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 185 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,090 INFO L231 Difference]: Finished difference. Result has 191 places, 185 transitions, 380 flow [2025-02-08 05:37:27,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=191, PETRI_TRANSITIONS=185} [2025-02-08 05:37:27,090 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -72 predicate places. [2025-02-08 05:37:27,090 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 185 transitions, 380 flow [2025-02-08 05:37:27,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,091 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] [2025-02-08 05:37:27,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:27,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash 851212954, now seen corresponding path program 1 times [2025-02-08 05:37:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493828608] [2025-02-08 05:37:27,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:37:27,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:37:27,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493828608] [2025-02-08 05:37:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493828608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898247331] [2025-02-08 05:37:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 185 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,162 INFO L124 PetriNetUnfolderBase]: 15/231 cut-off events. [2025-02-08 05:37:27,162 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 231 events. 15/231 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 216 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 220. Up to 40 conditions per place. [2025-02-08 05:37:27,163 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2025-02-08 05:37:27,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 184 transitions, 406 flow [2025-02-08 05:37:27,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,164 INFO L175 Difference]: Start difference. First operand has 191 places, 185 transitions, 380 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 184 transitions, 406 flow [2025-02-08 05:37:27,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 184 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,167 INFO L231 Difference]: Finished difference. Result has 190 places, 184 transitions, 378 flow [2025-02-08 05:37:27,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=190, PETRI_TRANSITIONS=184} [2025-02-08 05:37:27,167 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -73 predicate places. [2025-02-08 05:37:27,167 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 184 transitions, 378 flow [2025-02-08 05:37:27,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,168 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] [2025-02-08 05:37:27,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:27,168 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1582348636, now seen corresponding path program 1 times [2025-02-08 05:37:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281864494] [2025-02-08 05:37:27,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 05:37:27,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 05:37:27,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281864494] [2025-02-08 05:37:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281864494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19599222] [2025-02-08 05:37:27,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 184 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,288 INFO L124 PetriNetUnfolderBase]: 15/230 cut-off events. [2025-02-08 05:37:27,288 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 230 events. 15/230 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 215 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 211. Up to 40 conditions per place. [2025-02-08 05:37:27,289 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2025-02-08 05:37:27,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 183 transitions, 404 flow [2025-02-08 05:37:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,292 INFO L175 Difference]: Start difference. First operand has 190 places, 184 transitions, 378 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 183 transitions, 404 flow [2025-02-08 05:37:27,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 183 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,296 INFO L231 Difference]: Finished difference. Result has 189 places, 183 transitions, 376 flow [2025-02-08 05:37:27,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2025-02-08 05:37:27,297 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -74 predicate places. [2025-02-08 05:37:27,297 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 376 flow [2025-02-08 05:37:27,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:27,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:27,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1606479867, now seen corresponding path program 1 times [2025-02-08 05:37:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285820615] [2025-02-08 05:37:27,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:37:27,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:37:27,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285820615] [2025-02-08 05:37:27,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285820615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076844367] [2025-02-08 05:37:27,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,378 INFO L124 PetriNetUnfolderBase]: 15/229 cut-off events. [2025-02-08 05:37:27,379 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 229 events. 15/229 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 202. Up to 40 conditions per place. [2025-02-08 05:37:27,379 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-02-08 05:37:27,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 182 transitions, 402 flow [2025-02-08 05:37:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,382 INFO L175 Difference]: Start difference. First operand has 189 places, 183 transitions, 376 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 182 transitions, 402 flow [2025-02-08 05:37:27,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 182 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,384 INFO L231 Difference]: Finished difference. Result has 188 places, 182 transitions, 374 flow [2025-02-08 05:37:27,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=188, PETRI_TRANSITIONS=182} [2025-02-08 05:37:27,386 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -75 predicate places. [2025-02-08 05:37:27,386 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 182 transitions, 374 flow [2025-02-08 05:37:27,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,387 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] [2025-02-08 05:37:27,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:27,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1015073298, now seen corresponding path program 1 times [2025-02-08 05:37:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671888055] [2025-02-08 05:37:27,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:37:27,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:37:27,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671888055] [2025-02-08 05:37:27,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671888055] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256575360] [2025-02-08 05:37:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 182 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,496 INFO L124 PetriNetUnfolderBase]: 15/228 cut-off events. [2025-02-08 05:37:27,496 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 228 events. 15/228 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 211 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 193. Up to 40 conditions per place. [2025-02-08 05:37:27,497 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2025-02-08 05:37:27,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 181 transitions, 400 flow [2025-02-08 05:37:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,499 INFO L175 Difference]: Start difference. First operand has 188 places, 182 transitions, 374 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 181 transitions, 400 flow [2025-02-08 05:37:27,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 181 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,501 INFO L231 Difference]: Finished difference. Result has 187 places, 181 transitions, 372 flow [2025-02-08 05:37:27,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=187, PETRI_TRANSITIONS=181} [2025-02-08 05:37:27,504 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -76 predicate places. [2025-02-08 05:37:27,504 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 181 transitions, 372 flow [2025-02-08 05:37:27,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,505 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] [2025-02-08 05:37:27,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:27,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1065822346, now seen corresponding path program 1 times [2025-02-08 05:37:27,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040092156] [2025-02-08 05:37:27,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:37:27,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:37:27,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040092156] [2025-02-08 05:37:27,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040092156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361595655] [2025-02-08 05:37:27,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 181 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,612 INFO L124 PetriNetUnfolderBase]: 15/227 cut-off events. [2025-02-08 05:37:27,612 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 227 events. 15/227 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 209 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 184. Up to 40 conditions per place. [2025-02-08 05:37:27,613 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2025-02-08 05:37:27,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 180 transitions, 398 flow [2025-02-08 05:37:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,615 INFO L175 Difference]: Start difference. First operand has 187 places, 181 transitions, 372 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 180 transitions, 398 flow [2025-02-08 05:37:27,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 180 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,617 INFO L231 Difference]: Finished difference. Result has 186 places, 180 transitions, 370 flow [2025-02-08 05:37:27,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=186, PETRI_TRANSITIONS=180} [2025-02-08 05:37:27,619 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -77 predicate places. [2025-02-08 05:37:27,619 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 180 transitions, 370 flow [2025-02-08 05:37:27,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,619 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] [2025-02-08 05:37:27,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:27,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2033211739, now seen corresponding path program 1 times [2025-02-08 05:37:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815297465] [2025-02-08 05:37:27,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 05:37:27,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 05:37:27,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815297465] [2025-02-08 05:37:27,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815297465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679380353] [2025-02-08 05:37:27,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 180 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,738 INFO L124 PetriNetUnfolderBase]: 15/226 cut-off events. [2025-02-08 05:37:27,738 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 226 events. 15/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 208 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 175. Up to 40 conditions per place. [2025-02-08 05:37:27,739 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2025-02-08 05:37:27,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 179 transitions, 396 flow [2025-02-08 05:37:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,742 INFO L175 Difference]: Start difference. First operand has 186 places, 180 transitions, 370 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 179 transitions, 396 flow [2025-02-08 05:37:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 179 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,744 INFO L231 Difference]: Finished difference. Result has 185 places, 179 transitions, 368 flow [2025-02-08 05:37:27,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=185, PETRI_TRANSITIONS=179} [2025-02-08 05:37:27,745 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -78 predicate places. [2025-02-08 05:37:27,745 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 179 transitions, 368 flow [2025-02-08 05:37:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,745 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] [2025-02-08 05:37:27,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:37:27,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1383371102, now seen corresponding path program 1 times [2025-02-08 05:37:27,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733542686] [2025-02-08 05:37:27,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-08 05:37:27,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-08 05:37:27,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,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:37:27,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733542686] [2025-02-08 05:37:27,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733542686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812999426] [2025-02-08 05:37:27,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 179 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,836 INFO L124 PetriNetUnfolderBase]: 15/225 cut-off events. [2025-02-08 05:37:27,836 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 225 events. 15/225 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 166. Up to 40 conditions per place. [2025-02-08 05:37:27,837 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-02-08 05:37:27,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 178 transitions, 394 flow [2025-02-08 05:37:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,838 INFO L175 Difference]: Start difference. First operand has 185 places, 179 transitions, 368 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 178 transitions, 394 flow [2025-02-08 05:37:27,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,840 INFO L231 Difference]: Finished difference. Result has 184 places, 178 transitions, 366 flow [2025-02-08 05:37:27,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=184, PETRI_TRANSITIONS=178} [2025-02-08 05:37:27,841 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -79 predicate places. [2025-02-08 05:37:27,841 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 178 transitions, 366 flow [2025-02-08 05:37:27,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,841 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] [2025-02-08 05:37:27,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:27,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash -936406946, now seen corresponding path program 1 times [2025-02-08 05:37:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947991266] [2025-02-08 05:37:27,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-08 05:37:27,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 05:37:27,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947991266] [2025-02-08 05:37:27,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947991266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460983348] [2025-02-08 05:37:27,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 277 [2025-02-08 05:37:27,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 178 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 277 [2025-02-08 05:37:27,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:27,903 INFO L124 PetriNetUnfolderBase]: 15/224 cut-off events. [2025-02-08 05:37:27,903 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:27,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 224 events. 15/224 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 157. Up to 40 conditions per place. [2025-02-08 05:37:27,904 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2025-02-08 05:37:27,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 177 transitions, 392 flow [2025-02-08 05:37:27,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 600 transitions. [2025-02-08 05:37:27,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7220216606498195 [2025-02-08 05:37:27,905 INFO L175 Difference]: Start difference. First operand has 184 places, 178 transitions, 366 flow. Second operand 3 states and 600 transitions. [2025-02-08 05:37:27,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 177 transitions, 392 flow [2025-02-08 05:37:27,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 177 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:27,907 INFO L231 Difference]: Finished difference. Result has 183 places, 177 transitions, 364 flow [2025-02-08 05:37:27,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=183, PETRI_TRANSITIONS=177} [2025-02-08 05:37:27,908 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -80 predicate places. [2025-02-08 05:37:27,908 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 177 transitions, 364 flow [2025-02-08 05:37:27,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:27,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:27,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:27,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:27,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1658417997, now seen corresponding path program 1 times [2025-02-08 05:37:27,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:27,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061660549] [2025-02-08 05:37:27,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:27,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:27,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 05:37:27,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 05:37:27,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:27,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061660549] [2025-02-08 05:37:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061660549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:27,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:27,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67408712] [2025-02-08 05:37:27,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:27,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:27,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:27,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:27,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 277 [2025-02-08 05:37:27,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 177 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:27,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:27,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 277 [2025-02-08 05:37:27,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,030 INFO L124 PetriNetUnfolderBase]: 15/223 cut-off events. [2025-02-08 05:37:28,030 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:28,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 223 events. 15/223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 146. Up to 37 conditions per place. [2025-02-08 05:37:28,032 INFO L140 encePairwiseOnDemand]: 275/277 looper letters, 10 selfloop transitions, 1 changer transitions 0/176 dead transitions. [2025-02-08 05:37:28,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 176 transitions, 384 flow [2025-02-08 05:37:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2025-02-08 05:37:28,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7328519855595668 [2025-02-08 05:37:28,033 INFO L175 Difference]: Start difference. First operand has 183 places, 177 transitions, 364 flow. Second operand 3 states and 609 transitions. [2025-02-08 05:37:28,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 176 transitions, 384 flow [2025-02-08 05:37:28,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 176 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:28,035 INFO L231 Difference]: Finished difference. Result has 182 places, 176 transitions, 360 flow [2025-02-08 05:37:28,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=182, PETRI_TRANSITIONS=176} [2025-02-08 05:37:28,037 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -81 predicate places. [2025-02-08 05:37:28,037 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 176 transitions, 360 flow [2025-02-08 05:37:28,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:37:28,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:28,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1058134675, now seen corresponding path program 1 times [2025-02-08 05:37:28,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983355040] [2025-02-08 05:37:28,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 05:37:28,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 05:37:28,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983355040] [2025-02-08 05:37:28,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983355040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139301623] [2025-02-08 05:37:28,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 277 [2025-02-08 05:37:28,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 176 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 277 [2025-02-08 05:37:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,146 INFO L124 PetriNetUnfolderBase]: 15/221 cut-off events. [2025-02-08 05:37:28,146 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:28,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 221 events. 15/221 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 15 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 245. Up to 37 conditions per place. [2025-02-08 05:37:28,147 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 12 selfloop transitions, 1 changer transitions 0/174 dead transitions. [2025-02-08 05:37:28,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 174 transitions, 382 flow [2025-02-08 05:37:28,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 603 transitions. [2025-02-08 05:37:28,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7256317689530686 [2025-02-08 05:37:28,148 INFO L175 Difference]: Start difference. First operand has 182 places, 176 transitions, 360 flow. Second operand 3 states and 603 transitions. [2025-02-08 05:37:28,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 174 transitions, 382 flow [2025-02-08 05:37:28,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 174 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:28,150 INFO L231 Difference]: Finished difference. Result has 181 places, 174 transitions, 357 flow [2025-02-08 05:37:28,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=181, PETRI_TRANSITIONS=174} [2025-02-08 05:37:28,151 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -82 predicate places. [2025-02-08 05:37:28,151 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 174 transitions, 357 flow [2025-02-08 05:37:28,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:28,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:28,151 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err15ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 124 more)] === [2025-02-08 05:37:28,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1906311604, now seen corresponding path program 1 times [2025-02-08 05:37:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:28,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182185291] [2025-02-08 05:37:28,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:28,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:28,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 05:37:28,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 05:37:28,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:28,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:37:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182185291] [2025-02-08 05:37:28,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182185291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:28,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:28,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684370775] [2025-02-08 05:37:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:28,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:28,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:28,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:28,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 277 [2025-02-08 05:37:28,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 174 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:28,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 277 [2025-02-08 05:37:28,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:28,236 INFO L124 PetriNetUnfolderBase]: 15/219 cut-off events. [2025-02-08 05:37:28,236 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:37:28,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 219 events. 15/219 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 198 event pairs, 15 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 254. Up to 37 conditions per place. [2025-02-08 05:37:28,237 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 0 selfloop transitions, 0 changer transitions 172/172 dead transitions. [2025-02-08 05:37:28,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 172 transitions, 377 flow [2025-02-08 05:37:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 602 transitions. [2025-02-08 05:37:28,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7244283995186522 [2025-02-08 05:37:28,238 INFO L175 Difference]: Start difference. First operand has 181 places, 174 transitions, 357 flow. Second operand 3 states and 602 transitions. [2025-02-08 05:37:28,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 172 transitions, 377 flow [2025-02-08 05:37:28,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 172 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:28,240 INFO L231 Difference]: Finished difference. Result has 180 places, 0 transitions, 0 flow [2025-02-08 05:37:28,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=180, PETRI_TRANSITIONS=0} [2025-02-08 05:37:28,241 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, -83 predicate places. [2025-02-08 05:37:28,241 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 0 transitions, 0 flow [2025-02-08 05:37:28,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (127 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (126 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (125 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (124 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (123 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (122 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (121 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (120 of 128 remaining) [2025-02-08 05:37:28,243 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (119 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (118 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (117 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (116 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (114 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (112 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (111 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (110 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (109 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (108 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (107 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (106 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (105 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (104 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (103 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (102 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (101 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (100 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (99 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (98 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (97 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (96 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (95 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (94 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (93 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (92 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (91 of 128 remaining) [2025-02-08 05:37:28,244 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (90 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (89 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (88 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (87 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (86 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (85 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (84 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (82 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (81 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (80 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (79 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (78 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (77 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (76 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (75 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (74 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (73 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (72 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (71 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (70 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (69 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (68 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (67 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (66 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (65 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (64 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (62 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (61 of 128 remaining) [2025-02-08 05:37:28,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (60 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (59 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (58 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (57 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (53 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (52 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (51 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (50 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (49 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (48 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (47 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (45 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (44 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (41 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (40 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (39 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (37 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (36 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (35 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (34 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (32 of 128 remaining) [2025-02-08 05:37:28,246 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (31 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (30 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (29 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (27 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (26 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (25 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (24 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (23 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (18 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (15 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (14 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (6 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 128 remaining) [2025-02-08 05:37:28,247 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 128 remaining) [2025-02-08 05:37:28,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 128 remaining) [2025-02-08 05:37:28,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 128 remaining) [2025-02-08 05:37:28,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:28,248 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:28,252 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:28,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:28,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:28 BasicIcfg [2025-02-08 05:37:28,256 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:28,257 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:28,257 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:28,257 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:28,257 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:26" (3/4) ... [2025-02-08 05:37:28,259 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:28,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:28,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:28,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:37:28,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-02-08 05:37:28,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:28,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:28,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:28,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:28,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:28,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:28,325 INFO L158 Benchmark]: Toolchain (without parser) took 3524.58ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 132.5MB in the beginning and 124.2MB in the end (delta: 8.2MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,325 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:28,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.80ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 119.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.24ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 116.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,326 INFO L158 Benchmark]: Boogie Preprocessor took 28.77ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 114.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:28,326 INFO L158 Benchmark]: IcfgBuilder took 1118.47ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 53.7MB in the end (delta: 60.7MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,326 INFO L158 Benchmark]: TraceAbstraction took 2016.21ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 53.7MB in the beginning and 131.0MB in the end (delta: -77.3MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,327 INFO L158 Benchmark]: Witness Printer took 67.60ms. Allocated memory is still 243.3MB. Free memory was 131.0MB in the beginning and 124.2MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:28,327 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.31ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.80ms. Allocated memory is still 167.8MB. Free memory was 132.3MB in the beginning and 119.5MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.24ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 116.2MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.77ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 114.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1118.47ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 53.7MB in the end (delta: 60.7MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2016.21ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 53.7MB in the beginning and 131.0MB in the end (delta: -77.3MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Witness Printer took 67.60ms. Allocated memory is still 243.3MB. Free memory was 131.0MB in the beginning and 124.2MB in the end (delta: 6.8MB). 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: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: 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: 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: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 58]: 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: 58]: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 67]: 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: 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: 68]: 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: 68]: 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: 69]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 356 locations, 128 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: 1.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 25 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=526occurred in iteration=0, InterpolantAutomatonStates: 45, 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.5s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1401 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 1416 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:28,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE