./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:47,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:47,746 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:47,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:47,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:47,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:47,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:47,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:47,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:47,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:47,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:47,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:47,787 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:47,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:47,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:47,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:47,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:47,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:47,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:47,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:47,789 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:47,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:47,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:47,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:47,790 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 -> 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b [2025-02-08 05:37:48,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:48,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:48,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:48,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:48,128 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:48,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-02-08 05:37:49,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7446f0915/eec0193efe8849fcba5ab969519ef1eb/FLAG2a800b41c [2025-02-08 05:37:49,757 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:49,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-02-08 05:37:49,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7446f0915/eec0193efe8849fcba5ab969519ef1eb/FLAG2a800b41c [2025-02-08 05:37:49,786 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7446f0915/eec0193efe8849fcba5ab969519ef1eb [2025-02-08 05:37:49,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:49,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:49,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:49,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:49,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:49,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:49" (1/1) ... [2025-02-08 05:37:49,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:49, skipping insertion in model container [2025-02-08 05:37:49,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:49" (1/1) ... [2025-02-08 05:37:49,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:50,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:50,095 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:50,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:50,204 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:50,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:50 WrapperNode [2025-02-08 05:37:50,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:50,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:50,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:50,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:50,211 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:50" (1/1) ... [2025-02-08 05:37:50,228 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:50" (1/1) ... [2025-02-08 05:37:50,294 INFO L138 Inliner]: procedures = 25, calls = 62, calls flagged for inlining = 29, calls inlined = 43, statements flattened = 1309 [2025-02-08 05:37:50,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:50,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:50,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:50,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:50,304 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:50" (1/1) ... [2025-02-08 05:37:50,305 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:50" (1/1) ... [2025-02-08 05:37:50,313 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:50" (1/1) ... [2025-02-08 05:37:50,314 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:50" (1/1) ... [2025-02-08 05:37:50,343 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:50" (1/1) ... [2025-02-08 05:37:50,346 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:50" (1/1) ... [2025-02-08 05:37:50,354 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:50" (1/1) ... [2025-02-08 05:37:50,358 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:50" (1/1) ... [2025-02-08 05:37:50,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:50,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:50,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:50,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:50,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:50" (1/1) ... [2025-02-08 05:37:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:50,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:50,422 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:50,429 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:50,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:50,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:50,450 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:50,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:37:50,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:37:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:50,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:50,453 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:50,643 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:50,647 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:51,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-11: #t~ite43#1 := #t~ret42#1; [2025-02-08 05:37:51,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret42#1 && #t~ret42#1 <= 2147483647; [2025-02-08 05:37:51,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:51,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:51,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L69-15: #t~ret42#1 := minus_#res#1; [2025-02-08 05:37:51,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: #t~ite37#1 := #t~ret36#1; [2025-02-08 05:37:51,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret36#1 && #t~ret36#1 <= 2147483647; [2025-02-08 05:37:51,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:51,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:51,227 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-11: #t~ret36#1 := minus_#res#1; [2025-02-08 05:37:51,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-7: #t~ite82#1 := #t~ret81#1; [2025-02-08 05:37:51,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret81#1 && #t~ret81#1 <= 2147483647; [2025-02-08 05:37:51,606 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:51,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:51,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L92-11: #t~ret81#1 := minus_#res#1; [2025-02-08 05:37:51,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-11: #t~ite88#1 := #t~ret87#1; [2025-02-08 05:37:51,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret87#1 && #t~ret87#1 <= 2147483647; [2025-02-08 05:37:51,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:51,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:51,607 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L96-15: #t~ret87#1 := minus_#res#1; [2025-02-08 05:37:51,922 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-7: #t~ite127#1 := #t~ret126#1; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-8: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret126#1 && #t~ret126#1 <= 2147483647; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-9: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-10: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119-11: #t~ret126#1 := minus_#res#1; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-11: #t~ite133#1 := #t~ret132#1; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-12: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret132#1 && #t~ret132#1 <= 2147483647; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-13: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-14: havoc minus_~a#1, minus_~b#1; [2025-02-08 05:37:51,923 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L123-15: #t~ret132#1 := minus_#res#1; [2025-02-08 05:37:52,179 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:52,179 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:52,242 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:52,242 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:52,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:52 BoogieIcfgContainer [2025-02-08 05:37:52,243 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:52,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:52,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:52,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:52,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:49" (1/3) ... [2025-02-08 05:37:52,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a8f598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:52, skipping insertion in model container [2025-02-08 05:37:52,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:50" (2/3) ... [2025-02-08 05:37:52,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a8f598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:52, skipping insertion in model container [2025-02-08 05:37:52,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:52" (3/3) ... [2025-02-08 05:37:52,255 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-02-08 05:37:52,269 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:52,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 1640 locations, 1 initial locations, 6 loop locations, and 225 error locations. [2025-02-08 05:37:52,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:52,578 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:37:52,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1649 places, 1741 transitions, 3503 flow [2025-02-08 05:37:53,883 INFO L124 PetriNetUnfolderBase]: 102/1738 cut-off events. [2025-02-08 05:37:53,888 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:37:53,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 1738 events. 102/1738 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7485 event pairs, 0 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 1356. Up to 2 conditions per place. [2025-02-08 05:37:53,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 1649 places, 1741 transitions, 3503 flow [2025-02-08 05:37:54,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1627 places, 1717 transitions, 3452 flow [2025-02-08 05:37:54,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:54,146 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;@4f5bb93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:54,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 426 error locations. [2025-02-08 05:37:54,154 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:54,154 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2025-02-08 05:37:54,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:54,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:54,155 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] [2025-02-08 05:37:54,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:37:54,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash -789570846, now seen corresponding path program 1 times [2025-02-08 05:37:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:54,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438417931] [2025-02-08 05:37:54,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:54,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 05:37:54,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 05:37:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:54,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:54,349 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:54,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438417931] [2025-02-08 05:37:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438417931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:54,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:54,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650147690] [2025-02-08 05:37:54,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:54,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:54,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:54,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:54,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:54,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1741 [2025-02-08 05:37:54,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1627 places, 1717 transitions, 3452 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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:54,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:54,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1741 [2025-02-08 05:37:54,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:56,242 INFO L124 PetriNetUnfolderBase]: 114/2573 cut-off events. [2025-02-08 05:37:56,243 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-02-08 05:37:56,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2616 conditions, 2573 events. 114/2573 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 14030 event pairs, 5 based on Foata normal form. 103/2153 useless extension candidates. Maximal degree in co-relation 2229. Up to 22 conditions per place. [2025-02-08 05:37:56,391 INFO L140 encePairwiseOnDemand]: 1705/1741 looper letters, 11 selfloop transitions, 2 changer transitions 6/1683 dead transitions. [2025-02-08 05:37:56,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1628 places, 1683 transitions, 3410 flow [2025-02-08 05:37:56,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5120 transitions. [2025-02-08 05:37:56,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9802795328355352 [2025-02-08 05:37:56,541 INFO L175 Difference]: Start difference. First operand has 1627 places, 1717 transitions, 3452 flow. Second operand 3 states and 5120 transitions. [2025-02-08 05:37:56,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1628 places, 1683 transitions, 3410 flow [2025-02-08 05:37:56,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1622 places, 1683 transitions, 3398 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:37:56,589 INFO L231 Difference]: Finished difference. Result has 1622 places, 1677 transitions, 3364 flow [2025-02-08 05:37:56,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3372, PETRI_DIFFERENCE_MINUEND_PLACES=1620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3364, PETRI_PLACES=1622, PETRI_TRANSITIONS=1677} [2025-02-08 05:37:56,601 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -5 predicate places. [2025-02-08 05:37:56,601 INFO L471 AbstractCegarLoop]: Abstraction has has 1622 places, 1677 transitions, 3364 flow [2025-02-08 05:37:56,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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:56,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:56,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:56,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:37:56,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:56,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2052160206, now seen corresponding path program 1 times [2025-02-08 05:37:56,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:56,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444541148] [2025-02-08 05:37:56,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:56,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:56,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:56,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:56,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:56,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:56,706 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:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:56,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444541148] [2025-02-08 05:37:56,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444541148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:56,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054513766] [2025-02-08 05:37:56,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:56,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:56,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:56,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:56,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1741 [2025-02-08 05:37:56,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1622 places, 1677 transitions, 3364 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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:56,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:56,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1741 [2025-02-08 05:37:56,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:57,992 INFO L124 PetriNetUnfolderBase]: 114/2566 cut-off events. [2025-02-08 05:37:57,992 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:37:58,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 2566 events. 114/2566 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14468 event pairs, 5 based on Foata normal form. 0/2051 useless extension candidates. Maximal degree in co-relation 2553. Up to 22 conditions per place. [2025-02-08 05:37:58,103 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 11 selfloop transitions, 2 changer transitions 0/1676 dead transitions. [2025-02-08 05:37:58,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1617 places, 1676 transitions, 3388 flow [2025-02-08 05:37:58,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5087 transitions. [2025-02-08 05:37:58,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9739613249090561 [2025-02-08 05:37:58,121 INFO L175 Difference]: Start difference. First operand has 1622 places, 1677 transitions, 3364 flow. Second operand 3 states and 5087 transitions. [2025-02-08 05:37:58,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1617 places, 1676 transitions, 3388 flow [2025-02-08 05:37:58,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1615 places, 1676 transitions, 3384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:58,152 INFO L231 Difference]: Finished difference. Result has 1615 places, 1676 transitions, 3362 flow [2025-02-08 05:37:58,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3358, PETRI_DIFFERENCE_MINUEND_PLACES=1613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3362, PETRI_PLACES=1615, PETRI_TRANSITIONS=1676} [2025-02-08 05:37:58,156 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -12 predicate places. [2025-02-08 05:37:58,156 INFO L471 AbstractCegarLoop]: Abstraction has has 1615 places, 1676 transitions, 3362 flow [2025-02-08 05:37:58,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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:58,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:58,160 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] [2025-02-08 05:37:58,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:58,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:37:58,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:58,161 INFO L85 PathProgramCache]: Analyzing trace with hash 525603501, now seen corresponding path program 1 times [2025-02-08 05:37:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475896406] [2025-02-08 05:37:58,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:58,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 05:37:58,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 05:37:58,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:58,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:58,258 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:58,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:58,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475896406] [2025-02-08 05:37:58,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475896406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:58,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:58,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:58,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884925786] [2025-02-08 05:37:58,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:58,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:58,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:58,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:58,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:58,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1741 [2025-02-08 05:37:58,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1615 places, 1676 transitions, 3362 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 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:58,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:58,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1741 [2025-02-08 05:37:58,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:00,336 INFO L124 PetriNetUnfolderBase]: 158/3446 cut-off events. [2025-02-08 05:38:00,336 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:00,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3484 conditions, 3446 events. 158/3446 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 20963 event pairs, 7 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 3430. Up to 25 conditions per place. [2025-02-08 05:38:00,465 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 11 selfloop transitions, 2 changer transitions 0/1675 dead transitions. [2025-02-08 05:38:00,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1616 places, 1675 transitions, 3386 flow [2025-02-08 05:38:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5087 transitions. [2025-02-08 05:38:00,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9739613249090561 [2025-02-08 05:38:00,475 INFO L175 Difference]: Start difference. First operand has 1615 places, 1676 transitions, 3362 flow. Second operand 3 states and 5087 transitions. [2025-02-08 05:38:00,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1616 places, 1675 transitions, 3386 flow [2025-02-08 05:38:00,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1614 places, 1675 transitions, 3382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:00,502 INFO L231 Difference]: Finished difference. Result has 1614 places, 1675 transitions, 3360 flow [2025-02-08 05:38:00,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3356, PETRI_DIFFERENCE_MINUEND_PLACES=1612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3360, PETRI_PLACES=1614, PETRI_TRANSITIONS=1675} [2025-02-08 05:38:00,506 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -13 predicate places. [2025-02-08 05:38:00,506 INFO L471 AbstractCegarLoop]: Abstraction has has 1614 places, 1675 transitions, 3360 flow [2025-02-08 05:38:00,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:00,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:00,510 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] [2025-02-08 05:38:00,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:38:00,510 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:00,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 481976178, now seen corresponding path program 1 times [2025-02-08 05:38:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:00,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001927480] [2025-02-08 05:38:00,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:00,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:38:00,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:38:00,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:00,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:00,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001927480] [2025-02-08 05:38:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001927480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:00,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990927907] [2025-02-08 05:38:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:00,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:00,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:00,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:00,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1741 [2025-02-08 05:38:00,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1614 places, 1675 transitions, 3360 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:00,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:00,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1741 [2025-02-08 05:38:00,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:01,875 INFO L124 PetriNetUnfolderBase]: 158/3445 cut-off events. [2025-02-08 05:38:01,876 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-08 05:38:01,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3483 conditions, 3445 events. 158/3445 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 22021 event pairs, 7 based on Foata normal form. 0/2736 useless extension candidates. Maximal degree in co-relation 3421. Up to 25 conditions per place. [2025-02-08 05:38:01,989 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 11 selfloop transitions, 2 changer transitions 0/1674 dead transitions. [2025-02-08 05:38:01,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1615 places, 1674 transitions, 3384 flow [2025-02-08 05:38:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5087 transitions. [2025-02-08 05:38:01,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9739613249090561 [2025-02-08 05:38:01,997 INFO L175 Difference]: Start difference. First operand has 1614 places, 1675 transitions, 3360 flow. Second operand 3 states and 5087 transitions. [2025-02-08 05:38:01,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1615 places, 1674 transitions, 3384 flow [2025-02-08 05:38:02,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1613 places, 1674 transitions, 3380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:02,017 INFO L231 Difference]: Finished difference. Result has 1613 places, 1674 transitions, 3358 flow [2025-02-08 05:38:02,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=1611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3358, PETRI_PLACES=1613, PETRI_TRANSITIONS=1674} [2025-02-08 05:38:02,020 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -14 predicate places. [2025-02-08 05:38:02,020 INFO L471 AbstractCegarLoop]: Abstraction has has 1613 places, 1674 transitions, 3358 flow [2025-02-08 05:38:02,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:02,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:02,022 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] [2025-02-08 05:38:02,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:38:02,022 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:02,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash -896540489, now seen corresponding path program 1 times [2025-02-08 05:38:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060120838] [2025-02-08 05:38:02,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:02,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:02,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:38:02,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:38:02,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:02,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:02,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:02,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:02,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060120838] [2025-02-08 05:38:02,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060120838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:02,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:02,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:02,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780713945] [2025-02-08 05:38:02,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:02,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:02,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:02,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:02,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1741 [2025-02-08 05:38:02,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1613 places, 1674 transitions, 3358 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:02,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:02,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1741 [2025-02-08 05:38:02,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:02,879 INFO L124 PetriNetUnfolderBase]: 95/2124 cut-off events. [2025-02-08 05:38:02,880 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:02,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 2124 events. 95/2124 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10571 event pairs, 7 based on Foata normal form. 0/1707 useless extension candidates. Maximal degree in co-relation 2089. Up to 25 conditions per place. [2025-02-08 05:38:02,968 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 11 selfloop transitions, 2 changer transitions 0/1673 dead transitions. [2025-02-08 05:38:02,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1614 places, 1673 transitions, 3382 flow [2025-02-08 05:38:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5087 transitions. [2025-02-08 05:38:02,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9739613249090561 [2025-02-08 05:38:02,974 INFO L175 Difference]: Start difference. First operand has 1613 places, 1674 transitions, 3358 flow. Second operand 3 states and 5087 transitions. [2025-02-08 05:38:02,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1614 places, 1673 transitions, 3382 flow [2025-02-08 05:38:02,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1612 places, 1673 transitions, 3378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:02,999 INFO L231 Difference]: Finished difference. Result has 1612 places, 1673 transitions, 3356 flow [2025-02-08 05:38:03,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3352, PETRI_DIFFERENCE_MINUEND_PLACES=1610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3356, PETRI_PLACES=1612, PETRI_TRANSITIONS=1673} [2025-02-08 05:38:03,003 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -15 predicate places. [2025-02-08 05:38:03,003 INFO L471 AbstractCegarLoop]: Abstraction has has 1612 places, 1673 transitions, 3356 flow [2025-02-08 05:38:03,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:03,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:03,007 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] [2025-02-08 05:38:03,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:38:03,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:03,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1858125108, now seen corresponding path program 1 times [2025-02-08 05:38:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597318559] [2025-02-08 05:38:03,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:03,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:38:03,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:38:03,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:03,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:03,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:03,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597318559] [2025-02-08 05:38:03,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597318559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:03,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:03,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041500462] [2025-02-08 05:38:03,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:03,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:03,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:03,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:03,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1691 out of 1741 [2025-02-08 05:38:03,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1612 places, 1673 transitions, 3356 flow. Second operand has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:03,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:03,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1691 of 1741 [2025-02-08 05:38:03,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:03,904 INFO L124 PetriNetUnfolderBase]: 95/2123 cut-off events. [2025-02-08 05:38:03,904 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:38:03,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 2123 events. 95/2123 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 10879 event pairs, 7 based on Foata normal form. 0/1710 useless extension candidates. Maximal degree in co-relation 2080. Up to 25 conditions per place. [2025-02-08 05:38:04,001 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 11 selfloop transitions, 2 changer transitions 0/1672 dead transitions. [2025-02-08 05:38:04,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1613 places, 1672 transitions, 3380 flow [2025-02-08 05:38:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5087 transitions. [2025-02-08 05:38:04,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9739613249090561 [2025-02-08 05:38:04,008 INFO L175 Difference]: Start difference. First operand has 1612 places, 1673 transitions, 3356 flow. Second operand 3 states and 5087 transitions. [2025-02-08 05:38:04,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1613 places, 1672 transitions, 3380 flow [2025-02-08 05:38:04,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1611 places, 1672 transitions, 3376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:04,037 INFO L231 Difference]: Finished difference. Result has 1611 places, 1672 transitions, 3354 flow [2025-02-08 05:38:04,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3350, PETRI_DIFFERENCE_MINUEND_PLACES=1609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3354, PETRI_PLACES=1611, PETRI_TRANSITIONS=1672} [2025-02-08 05:38:04,040 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -16 predicate places. [2025-02-08 05:38:04,040 INFO L471 AbstractCegarLoop]: Abstraction has has 1611 places, 1672 transitions, 3354 flow [2025-02-08 05:38:04,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1692.3333333333333) internal successors, (5077), 3 states have internal predecessors, (5077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:04,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:04,044 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] [2025-02-08 05:38:04,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:38:04,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:04,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:04,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1410261911, now seen corresponding path program 1 times [2025-02-08 05:38:04,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:04,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038152497] [2025-02-08 05:38:04,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:04,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:38:04,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:38:04,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:04,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:04,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038152497] [2025-02-08 05:38:04,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038152497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:04,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:04,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243931978] [2025-02-08 05:38:04,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:04,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:04,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:04,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:04,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:04,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1683 out of 1741 [2025-02-08 05:38:04,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1611 places, 1672 transitions, 3354 flow. Second operand has 3 states, 3 states have (on average 1684.3333333333333) internal successors, (5053), 3 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:04,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:04,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1683 of 1741 [2025-02-08 05:38:04,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:07,856 INFO L124 PetriNetUnfolderBase]: 463/9636 cut-off events. [2025-02-08 05:38:07,857 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-08 05:38:08,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9719 conditions, 9636 events. 463/9636 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 86519 event pairs, 18 based on Foata normal form. 0/7564 useless extension candidates. Maximal degree in co-relation 9633. Up to 56 conditions per place. [2025-02-08 05:38:08,132 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 19 selfloop transitions, 2 changer transitions 0/1671 dead transitions. [2025-02-08 05:38:08,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1612 places, 1671 transitions, 3394 flow [2025-02-08 05:38:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5071 transitions. [2025-02-08 05:38:08,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708979513689451 [2025-02-08 05:38:08,137 INFO L175 Difference]: Start difference. First operand has 1611 places, 1672 transitions, 3354 flow. Second operand 3 states and 5071 transitions. [2025-02-08 05:38:08,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1612 places, 1671 transitions, 3394 flow [2025-02-08 05:38:08,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1610 places, 1671 transitions, 3390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:08,153 INFO L231 Difference]: Finished difference. Result has 1610 places, 1671 transitions, 3352 flow [2025-02-08 05:38:08,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3348, PETRI_DIFFERENCE_MINUEND_PLACES=1608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3352, PETRI_PLACES=1610, PETRI_TRANSITIONS=1671} [2025-02-08 05:38:08,156 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -17 predicate places. [2025-02-08 05:38:08,156 INFO L471 AbstractCegarLoop]: Abstraction has has 1610 places, 1671 transitions, 3352 flow [2025-02-08 05:38:08,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1684.3333333333333) internal successors, (5053), 3 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:08,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:08,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:08,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:38:08,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:08,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1703048800, now seen corresponding path program 1 times [2025-02-08 05:38:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698483085] [2025-02-08 05:38:08,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:08,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:08,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:38:08,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:38:08,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:08,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698483085] [2025-02-08 05:38:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698483085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031165032] [2025-02-08 05:38:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:08,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:08,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:08,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1678 out of 1741 [2025-02-08 05:38:08,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1610 places, 1671 transitions, 3352 flow. Second operand has 3 states, 3 states have (on average 1679.3333333333333) internal successors, (5038), 3 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:08,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:08,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1678 of 1741 [2025-02-08 05:38:08,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:13,984 INFO L124 PetriNetUnfolderBase]: 727/14945 cut-off events. [2025-02-08 05:38:13,984 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-02-08 05:38:14,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15069 conditions, 14945 events. 727/14945 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 150367 event pairs, 30 based on Foata normal form. 0/11698 useless extension candidates. Maximal degree in co-relation 14975. Up to 85 conditions per place. [2025-02-08 05:38:14,535 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 24 selfloop transitions, 2 changer transitions 0/1670 dead transitions. [2025-02-08 05:38:14,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1611 places, 1670 transitions, 3402 flow [2025-02-08 05:38:14,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5061 transitions. [2025-02-08 05:38:14,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689833429063757 [2025-02-08 05:38:14,541 INFO L175 Difference]: Start difference. First operand has 1610 places, 1671 transitions, 3352 flow. Second operand 3 states and 5061 transitions. [2025-02-08 05:38:14,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1611 places, 1670 transitions, 3402 flow [2025-02-08 05:38:14,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1609 places, 1670 transitions, 3398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:14,557 INFO L231 Difference]: Finished difference. Result has 1609 places, 1670 transitions, 3350 flow [2025-02-08 05:38:14,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3346, PETRI_DIFFERENCE_MINUEND_PLACES=1607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3350, PETRI_PLACES=1609, PETRI_TRANSITIONS=1670} [2025-02-08 05:38:14,559 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -18 predicate places. [2025-02-08 05:38:14,559 INFO L471 AbstractCegarLoop]: Abstraction has has 1609 places, 1670 transitions, 3350 flow [2025-02-08 05:38:14,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1679.3333333333333) internal successors, (5038), 3 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:14,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:14,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:14,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:38:14,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:14,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2029538535, now seen corresponding path program 1 times [2025-02-08 05:38:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:14,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344855440] [2025-02-08 05:38:14,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:14,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:38:14,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:38:14,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:14,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:14,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344855440] [2025-02-08 05:38:14,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344855440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:14,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:14,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506733052] [2025-02-08 05:38:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:14,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:14,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:14,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:14,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1683 out of 1741 [2025-02-08 05:38:14,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1609 places, 1670 transitions, 3350 flow. Second operand has 3 states, 3 states have (on average 1684.3333333333333) internal successors, (5053), 3 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:14,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:14,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1683 of 1741 [2025-02-08 05:38:14,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:17,753 INFO L124 PetriNetUnfolderBase]: 274/5656 cut-off events. [2025-02-08 05:38:17,754 INFO L125 PetriNetUnfolderBase]: For 10/13 co-relation queries the response was YES. [2025-02-08 05:38:17,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5730 conditions, 5656 events. 274/5656 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41502 event pairs, 18 based on Foata normal form. 0/4462 useless extension candidates. Maximal degree in co-relation 5628. Up to 56 conditions per place. [2025-02-08 05:38:17,975 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 19 selfloop transitions, 2 changer transitions 0/1669 dead transitions. [2025-02-08 05:38:17,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1610 places, 1669 transitions, 3390 flow [2025-02-08 05:38:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5071 transitions. [2025-02-08 05:38:18,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708979513689451 [2025-02-08 05:38:18,130 INFO L175 Difference]: Start difference. First operand has 1609 places, 1670 transitions, 3350 flow. Second operand 3 states and 5071 transitions. [2025-02-08 05:38:18,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1610 places, 1669 transitions, 3390 flow [2025-02-08 05:38:18,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1608 places, 1669 transitions, 3386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:18,146 INFO L231 Difference]: Finished difference. Result has 1608 places, 1669 transitions, 3348 flow [2025-02-08 05:38:18,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=1606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3348, PETRI_PLACES=1608, PETRI_TRANSITIONS=1669} [2025-02-08 05:38:18,149 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -19 predicate places. [2025-02-08 05:38:18,149 INFO L471 AbstractCegarLoop]: Abstraction has has 1608 places, 1669 transitions, 3348 flow [2025-02-08 05:38:18,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1684.3333333333333) internal successors, (5053), 3 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:18,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:18,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:18,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:38:18,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:18,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash 613598110, now seen corresponding path program 1 times [2025-02-08 05:38:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:18,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361944719] [2025-02-08 05:38:18,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:18,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:38:18,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:38:18,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:18,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361944719] [2025-02-08 05:38:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361944719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:18,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:18,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:18,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745659350] [2025-02-08 05:38:18,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:18,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:18,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:18,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:18,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1678 out of 1741 [2025-02-08 05:38:18,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1608 places, 1669 transitions, 3348 flow. Second operand has 3 states, 3 states have (on average 1679.3333333333333) internal successors, (5038), 3 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:18,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:18,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1678 of 1741 [2025-02-08 05:38:18,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:22,173 INFO L124 PetriNetUnfolderBase]: 412/8313 cut-off events. [2025-02-08 05:38:22,174 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-02-08 05:38:22,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8422 conditions, 8313 events. 412/8313 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 69620 event pairs, 30 based on Foata normal form. 0/6528 useless extension candidates. Maximal degree in co-relation 8312. Up to 85 conditions per place. [2025-02-08 05:38:22,508 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 24 selfloop transitions, 2 changer transitions 0/1668 dead transitions. [2025-02-08 05:38:22,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1609 places, 1668 transitions, 3398 flow [2025-02-08 05:38:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:22,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5061 transitions. [2025-02-08 05:38:22,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689833429063757 [2025-02-08 05:38:22,514 INFO L175 Difference]: Start difference. First operand has 1608 places, 1669 transitions, 3348 flow. Second operand 3 states and 5061 transitions. [2025-02-08 05:38:22,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1609 places, 1668 transitions, 3398 flow [2025-02-08 05:38:22,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1607 places, 1668 transitions, 3394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:22,530 INFO L231 Difference]: Finished difference. Result has 1607 places, 1668 transitions, 3346 flow [2025-02-08 05:38:22,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3342, PETRI_DIFFERENCE_MINUEND_PLACES=1605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3346, PETRI_PLACES=1607, PETRI_TRANSITIONS=1668} [2025-02-08 05:38:22,533 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -20 predicate places. [2025-02-08 05:38:22,533 INFO L471 AbstractCegarLoop]: Abstraction has has 1607 places, 1668 transitions, 3346 flow [2025-02-08 05:38:22,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1679.3333333333333) internal successors, (5038), 3 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:22,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:22,534 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] [2025-02-08 05:38:22,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:38:22,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:22,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:22,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1117222946, now seen corresponding path program 1 times [2025-02-08 05:38:22,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:22,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186821312] [2025-02-08 05:38:22,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:22,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:22,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:38:22,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:38:22,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:22,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:22,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186821312] [2025-02-08 05:38:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186821312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961543633] [2025-02-08 05:38:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:22,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:22,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:22,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:22,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:22,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1683 out of 1741 [2025-02-08 05:38:22,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1607 places, 1668 transitions, 3346 flow. Second operand has 3 states, 3 states have (on average 1684.3333333333333) internal successors, (5053), 3 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:22,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:22,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1683 of 1741 [2025-02-08 05:38:22,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:23,265 INFO L124 PetriNetUnfolderBase]: 85/1703 cut-off events. [2025-02-08 05:38:23,265 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-02-08 05:38:23,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 1703 events. 85/1703 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8367 event pairs, 18 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 1650. Up to 56 conditions per place. [2025-02-08 05:38:23,338 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 19 selfloop transitions, 2 changer transitions 0/1667 dead transitions. [2025-02-08 05:38:23,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1608 places, 1667 transitions, 3386 flow [2025-02-08 05:38:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5071 transitions. [2025-02-08 05:38:23,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708979513689451 [2025-02-08 05:38:23,344 INFO L175 Difference]: Start difference. First operand has 1607 places, 1668 transitions, 3346 flow. Second operand 3 states and 5071 transitions. [2025-02-08 05:38:23,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1608 places, 1667 transitions, 3386 flow [2025-02-08 05:38:23,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1606 places, 1667 transitions, 3382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:23,359 INFO L231 Difference]: Finished difference. Result has 1606 places, 1667 transitions, 3344 flow [2025-02-08 05:38:23,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3340, PETRI_DIFFERENCE_MINUEND_PLACES=1604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3344, PETRI_PLACES=1606, PETRI_TRANSITIONS=1667} [2025-02-08 05:38:23,362 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -21 predicate places. [2025-02-08 05:38:23,362 INFO L471 AbstractCegarLoop]: Abstraction has has 1606 places, 1667 transitions, 3344 flow [2025-02-08 05:38:23,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1684.3333333333333) internal successors, (5053), 3 states have internal predecessors, (5053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:23,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:23,364 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] [2025-02-08 05:38:23,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:38:23,364 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:23,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1498468514, now seen corresponding path program 1 times [2025-02-08 05:38:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353465038] [2025-02-08 05:38:23,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:23,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-08 05:38:23,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-08 05:38:23,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:23,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353465038] [2025-02-08 05:38:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353465038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:23,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142038895] [2025-02-08 05:38:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:23,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:23,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:23,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:23,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1678 out of 1741 [2025-02-08 05:38:23,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1606 places, 1667 transitions, 3344 flow. Second operand has 3 states, 3 states have (on average 1679.3333333333333) internal successors, (5038), 3 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:23,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:23,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1678 of 1741 [2025-02-08 05:38:23,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:24,300 INFO L124 PetriNetUnfolderBase]: 128/2353 cut-off events. [2025-02-08 05:38:24,300 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-08 05:38:24,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 2353 events. 128/2353 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 13599 event pairs, 30 based on Foata normal form. 0/1893 useless extension candidates. Maximal degree in co-relation 2322. Up to 86 conditions per place. [2025-02-08 05:38:24,406 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 24 selfloop transitions, 2 changer transitions 0/1666 dead transitions. [2025-02-08 05:38:24,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1607 places, 1666 transitions, 3394 flow [2025-02-08 05:38:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5061 transitions. [2025-02-08 05:38:24,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689833429063757 [2025-02-08 05:38:24,416 INFO L175 Difference]: Start difference. First operand has 1606 places, 1667 transitions, 3344 flow. Second operand 3 states and 5061 transitions. [2025-02-08 05:38:24,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1607 places, 1666 transitions, 3394 flow [2025-02-08 05:38:24,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1605 places, 1666 transitions, 3390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:24,438 INFO L231 Difference]: Finished difference. Result has 1605 places, 1666 transitions, 3342 flow [2025-02-08 05:38:24,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3338, PETRI_DIFFERENCE_MINUEND_PLACES=1603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3342, PETRI_PLACES=1605, PETRI_TRANSITIONS=1666} [2025-02-08 05:38:24,440 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -22 predicate places. [2025-02-08 05:38:24,440 INFO L471 AbstractCegarLoop]: Abstraction has has 1605 places, 1666 transitions, 3342 flow [2025-02-08 05:38:24,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1679.3333333333333) internal successors, (5038), 3 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:24,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:24,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:38:24,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:38:24,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:24,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:24,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1756070049, now seen corresponding path program 1 times [2025-02-08 05:38:24,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:24,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209966230] [2025-02-08 05:38:24,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:24,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:24,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-08 05:38:24,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-08 05:38:24,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:24,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:24,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:24,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209966230] [2025-02-08 05:38:24,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209966230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:24,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:24,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:24,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648529449] [2025-02-08 05:38:24,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:24,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:24,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:24,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:24,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1685 out of 1741 [2025-02-08 05:38:24,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1605 places, 1666 transitions, 3342 flow. Second operand has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:24,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:24,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1685 of 1741 [2025-02-08 05:38:24,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:27,287 INFO L124 PetriNetUnfolderBase]: 309/6089 cut-off events. [2025-02-08 05:38:27,287 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-02-08 05:38:27,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6188 conditions, 6089 events. 309/6089 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 50765 event pairs, 32 based on Foata normal form. 0/4810 useless extension candidates. Maximal degree in co-relation 6054. Up to 82 conditions per place. [2025-02-08 05:38:27,588 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 17 selfloop transitions, 2 changer transitions 0/1665 dead transitions. [2025-02-08 05:38:27,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1606 places, 1665 transitions, 3378 flow [2025-02-08 05:38:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5075 transitions. [2025-02-08 05:38:27,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716637947539728 [2025-02-08 05:38:27,594 INFO L175 Difference]: Start difference. First operand has 1605 places, 1666 transitions, 3342 flow. Second operand 3 states and 5075 transitions. [2025-02-08 05:38:27,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1606 places, 1665 transitions, 3378 flow [2025-02-08 05:38:27,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1604 places, 1665 transitions, 3374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:27,614 INFO L231 Difference]: Finished difference. Result has 1604 places, 1665 transitions, 3340 flow [2025-02-08 05:38:27,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3336, PETRI_DIFFERENCE_MINUEND_PLACES=1602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3340, PETRI_PLACES=1604, PETRI_TRANSITIONS=1665} [2025-02-08 05:38:27,616 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -23 predicate places. [2025-02-08 05:38:27,616 INFO L471 AbstractCegarLoop]: Abstraction has has 1604 places, 1665 transitions, 3340 flow [2025-02-08 05:38:27,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:27,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:27,618 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] [2025-02-08 05:38:27,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:38:27,618 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash -615147661, now seen corresponding path program 1 times [2025-02-08 05:38:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:27,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951974629] [2025-02-08 05:38:27,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:27,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 05:38:27,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 05:38:27,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:27,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:27,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:27,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951974629] [2025-02-08 05:38:27,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951974629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:27,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:27,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:27,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92415144] [2025-02-08 05:38:27,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:27,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:27,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:27,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:27,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:27,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1685 out of 1741 [2025-02-08 05:38:27,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1604 places, 1665 transitions, 3340 flow. Second operand has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:27,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:27,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1685 of 1741 [2025-02-08 05:38:27,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:29,959 INFO L124 PetriNetUnfolderBase]: 425/7840 cut-off events. [2025-02-08 05:38:29,959 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2025-02-08 05:38:30,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8007 conditions, 7840 events. 425/7840 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 73594 event pairs, 64 based on Foata normal form. 0/6163 useless extension candidates. Maximal degree in co-relation 7865. Up to 130 conditions per place. [2025-02-08 05:38:30,281 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 17 selfloop transitions, 2 changer transitions 0/1664 dead transitions. [2025-02-08 05:38:30,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1605 places, 1664 transitions, 3376 flow [2025-02-08 05:38:30,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5075 transitions. [2025-02-08 05:38:30,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716637947539728 [2025-02-08 05:38:30,284 INFO L175 Difference]: Start difference. First operand has 1604 places, 1665 transitions, 3340 flow. Second operand 3 states and 5075 transitions. [2025-02-08 05:38:30,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1605 places, 1664 transitions, 3376 flow [2025-02-08 05:38:30,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1603 places, 1664 transitions, 3372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:30,298 INFO L231 Difference]: Finished difference. Result has 1603 places, 1664 transitions, 3338 flow [2025-02-08 05:38:30,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3334, PETRI_DIFFERENCE_MINUEND_PLACES=1601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3338, PETRI_PLACES=1603, PETRI_TRANSITIONS=1664} [2025-02-08 05:38:30,300 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -24 predicate places. [2025-02-08 05:38:30,300 INFO L471 AbstractCegarLoop]: Abstraction has has 1603 places, 1664 transitions, 3338 flow [2025-02-08 05:38:30,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:30,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:30,302 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] [2025-02-08 05:38:30,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:38:30,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1378037515, now seen corresponding path program 1 times [2025-02-08 05:38:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536924029] [2025-02-08 05:38:30,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:30,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:38:30,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:38:30,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:30,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536924029] [2025-02-08 05:38:30,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536924029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:30,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:30,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239093295] [2025-02-08 05:38:30,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:30,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:30,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:30,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:30,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1685 out of 1741 [2025-02-08 05:38:30,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1603 places, 1664 transitions, 3338 flow. Second operand has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:30,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:30,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1685 of 1741 [2025-02-08 05:38:30,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:38:32,167 INFO L124 PetriNetUnfolderBase]: 294/5162 cut-off events. [2025-02-08 05:38:32,167 INFO L125 PetriNetUnfolderBase]: For 29/70 co-relation queries the response was YES. [2025-02-08 05:38:32,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5314 conditions, 5162 events. 294/5162 cut-off events. For 29/70 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 40560 event pairs, 64 based on Foata normal form. 0/4089 useless extension candidates. Maximal degree in co-relation 5164. Up to 139 conditions per place. [2025-02-08 05:38:32,425 INFO L140 encePairwiseOnDemand]: 1738/1741 looper letters, 17 selfloop transitions, 2 changer transitions 0/1663 dead transitions. [2025-02-08 05:38:32,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1604 places, 1663 transitions, 3374 flow [2025-02-08 05:38:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:38:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:38:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5075 transitions. [2025-02-08 05:38:32,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9716637947539728 [2025-02-08 05:38:32,429 INFO L175 Difference]: Start difference. First operand has 1603 places, 1664 transitions, 3338 flow. Second operand 3 states and 5075 transitions. [2025-02-08 05:38:32,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1604 places, 1663 transitions, 3374 flow [2025-02-08 05:38:32,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1602 places, 1663 transitions, 3370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:38:32,450 INFO L231 Difference]: Finished difference. Result has 1602 places, 1663 transitions, 3336 flow [2025-02-08 05:38:32,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1741, PETRI_DIFFERENCE_MINUEND_FLOW=3332, PETRI_DIFFERENCE_MINUEND_PLACES=1600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3336, PETRI_PLACES=1602, PETRI_TRANSITIONS=1663} [2025-02-08 05:38:32,452 INFO L279 CegarLoopForPetriNet]: 1627 programPoint places, -25 predicate places. [2025-02-08 05:38:32,452 INFO L471 AbstractCegarLoop]: Abstraction has has 1602 places, 1663 transitions, 3336 flow [2025-02-08 05:38:32,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1686.3333333333333) internal successors, (5059), 3 states have internal predecessors, (5059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:32,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:38:32,453 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] [2025-02-08 05:38:32,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:38:32,454 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-08 05:38:32,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:38:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1191086369, now seen corresponding path program 1 times [2025-02-08 05:38:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:38:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481920679] [2025-02-08 05:38:32,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:38:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:38:32,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 05:38:32,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 05:38:32,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:38:32,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:38:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:38:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:38:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481920679] [2025-02-08 05:38:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481920679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:38:32,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:38:32,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:38:32,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158705295] [2025-02-08 05:38:32,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:38:32,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:38:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:38:32,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:38:32,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:38:32,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1679 out of 1741 [2025-02-08 05:38:32,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1602 places, 1663 transitions, 3336 flow. Second operand has 3 states, 3 states have (on average 1680.3333333333333) internal successors, (5041), 3 states have internal predecessors, (5041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:38:32,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:38:32,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1679 of 1741 [2025-02-08 05:38:32,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand