./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.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/popl20-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:16,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:16,525 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:40:16,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:16,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:16,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:16,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:16,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:16,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:16,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:16,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:16,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:16,558 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:16,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:16,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:16,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:16,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:16,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:16,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:16,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:16,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:16,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:16,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:16,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:16,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:16,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:16,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:16,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:16,562 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-02-08 05:40:16,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:16,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:16,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:16,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:16,853 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:16,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-08 05:40:18,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f146d14b/1662c1d4288d4408ba107166b9b62977/FLAG785a4ed42 [2025-02-08 05:40:18,400 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:18,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-02-08 05:40:18,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f146d14b/1662c1d4288d4408ba107166b9b62977/FLAG785a4ed42 [2025-02-08 05:40:18,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f146d14b/1662c1d4288d4408ba107166b9b62977 [2025-02-08 05:40:18,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:18,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:18,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:18,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:18,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:18,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:18" (1/1) ... [2025-02-08 05:40:18,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a292954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:18, skipping insertion in model container [2025-02-08 05:40:18,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:18" (1/1) ... [2025-02-08 05:40:18,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:18,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:18,944 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:18,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:19,014 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:19,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19 WrapperNode [2025-02-08 05:40:19,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:19,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:19,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:19,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:19,021 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:40:19" (1/1) ... [2025-02-08 05:40:19,037 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:40:19" (1/1) ... [2025-02-08 05:40:19,071 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 359 [2025-02-08 05:40:19,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:19,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:19,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:19,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:19,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:19,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:19,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:19,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:19,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (1/1) ... [2025-02-08 05:40:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:19,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:19,145 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:40:19,153 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:40:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:19,186 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:19,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:19,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:19,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:19,191 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:40:19,352 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:19,357 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: havoc #t~post6#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: ~i~0#1 := 1 + #t~post6#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: #t~post6#1 := ~i~0#1; [2025-02-08 05:40:19,506 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~nondet5#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: havoc #t~ret4#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: havoc #t~ret3#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: havoc #t~mem2#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: assume #race~res1~0 == #t~nondet5#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: assume !(#race~res1~0 == #t~nondet5#1); [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-5: havoc #t~mem1#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-6: #race~res1~0 := #t~nondet5#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-7: havoc #t~nondet5#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-8: ~res1~0 := #t~ret4#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-9: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-10: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-11: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-12: #t~ret4#1 := plus_#res#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-13: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-14: havoc plus_#res#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-15: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res1~0, #t~ret3#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-16: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-17: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-18: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-19: #t~ret3#1 := plus_#res#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:40:19,507 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,509 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,509 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:40:19,509 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,509 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,510 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,510 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:40:19,510 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,510 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:19,510 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 05:40:19,631 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:19,632 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 05:40:19,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~ret10#1; [2025-02-08 05:40:19,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: havoc #t~ret9#1; [2025-02-08 05:40:19,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: havoc #t~mem8#1; [2025-02-08 05:40:19,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: havoc #t~mem7#1; [2025-02-08 05:40:19,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: ~tmp~0#1 := #t~ret10#1; [2025-02-08 05:40:19,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 05:40:19,635 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-8: #t~ret10#1 := plus_#res#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-10: havoc plus_#res#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret9#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-15: #t~ret9#1 := plus_#res#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57: [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: ~res2~0 := ~tmp~0#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: havoc #t~post11#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: ~i~1#1 := 1 + #t~post11#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: #t~post11#1 := ~i~1#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: havoc ~tmp~0#1; [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:40:19,636 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:40:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:19,637 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 05:40:19,741 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-3: assume false; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: havoc #t~post16#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: ~i~2#1 := 1 + #t~post16#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: #t~post16#1 := ~i~2#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: havoc ~tmp~1#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L110-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~ret15#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~ret14#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: havoc #t~mem13#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: havoc #t~mem12#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: ~tmp~1#1 := #t~ret15#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret15#1 && #t~ret15#1 <= 2147483647; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-7: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-8: #t~ret15#1 := plus_#res#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-9: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-10: havoc plus_#res#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-11: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret14#1; [2025-02-08 05:40:19,742 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-12: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret14#1 && #t~ret14#1 <= 2147483647; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-13: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-14: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-15: #t~ret14#1 := plus_#res#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: ~res2~0 := ~tmp~1#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L108-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L34-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 <= 0 || plus_~a#1 <= 2147483647 - plus_~b#1 then 1 else 0); [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109-4: assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if plus_~b#1 >= 0 || plus_~a#1 >= -2147483648 - plus_~b#1 then 1 else 0); [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:19,743 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L35-1: assume false; [2025-02-08 05:40:19,955 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:19,955 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:19,971 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:19,971 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:19,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:19 BoogieIcfgContainer [2025-02-08 05:40:19,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:19,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:19,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:19,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:19,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:18" (1/3) ... [2025-02-08 05:40:19,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa8c451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:19, skipping insertion in model container [2025-02-08 05:40:19,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:19" (2/3) ... [2025-02-08 05:40:19,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa8c451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:19, skipping insertion in model container [2025-02-08 05:40:19,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:19" (3/3) ... [2025-02-08 05:40:19,979 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-02-08 05:40:19,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:19,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 360 locations, 1 initial locations, 5 loop locations, and 30 error locations. [2025-02-08 05:40:19,991 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:20,111 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:40:20,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 377 transitions, 775 flow [2025-02-08 05:40:20,278 INFO L124 PetriNetUnfolderBase]: 18/374 cut-off events. [2025-02-08 05:40:20,280 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:20,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 374 events. 18/374 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 728 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 297. Up to 2 conditions per place. [2025-02-08 05:40:20,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 377 transitions, 775 flow [2025-02-08 05:40:20,293 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 357 transitions, 732 flow [2025-02-08 05:40:20,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:20,313 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;@ed6add2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:20,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-02-08 05:40:20,318 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:20,319 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:40:20,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:20,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:20,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:20,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:20,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash 825291991, now seen corresponding path program 1 times [2025-02-08 05:40:20,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:20,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-02-08 05:40:20,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:40:20,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:40:20,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:20,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,470 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:40:20,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050239975] [2025-02-08 05:40:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050239975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924394248] [2025-02-08 05:40:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:20,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:20,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 377 [2025-02-08 05:40:20,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 357 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 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:40:20,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:20,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 377 [2025-02-08 05:40:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:20,731 INFO L124 PetriNetUnfolderBase]: 10/649 cut-off events. [2025-02-08 05:40:20,732 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 05:40:20,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 649 events. 10/649 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2588 event pairs, 7 based on Foata normal form. 35/587 useless extension candidates. Maximal degree in co-relation 442. Up to 27 conditions per place. [2025-02-08 05:40:20,739 INFO L140 encePairwiseOnDemand]: 360/377 looper letters, 13 selfloop transitions, 2 changer transitions 5/342 dead transitions. [2025-02-08 05:40:20,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 342 transitions, 732 flow [2025-02-08 05:40:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:20,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1062 transitions. [2025-02-08 05:40:20,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9389920424403183 [2025-02-08 05:40:20,759 INFO L175 Difference]: Start difference. First operand has 350 places, 357 transitions, 732 flow. Second operand 3 states and 1062 transitions. [2025-02-08 05:40:20,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 342 transitions, 732 flow [2025-02-08 05:40:20,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 342 transitions, 720 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:40:20,771 INFO L231 Difference]: Finished difference. Result has 345 places, 337 transitions, 684 flow [2025-02-08 05:40:20,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=345, PETRI_TRANSITIONS=337} [2025-02-08 05:40:20,777 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -5 predicate places. [2025-02-08 05:40:20,777 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 337 transitions, 684 flow [2025-02-08 05:40:20,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 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:40:20,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:20,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:20,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:20,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1832063800, now seen corresponding path program 1 times [2025-02-08 05:40:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:20,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627549839] [2025-02-08 05:40:20,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:20,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:40:20,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:40:20,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:20,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,839 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:40:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627549839] [2025-02-08 05:40:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627549839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725387449] [2025-02-08 05:40:20,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:20,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:20,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:20,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 377 [2025-02-08 05:40:20,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 337 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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:40:20,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:20,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 377 [2025-02-08 05:40:20,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:20,924 INFO L124 PetriNetUnfolderBase]: 8/496 cut-off events. [2025-02-08 05:40:20,924 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:40:20,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 496 events. 8/496 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1669 event pairs, 5 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 501. Up to 25 conditions per place. [2025-02-08 05:40:20,928 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 14 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2025-02-08 05:40:20,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 336 transitions, 714 flow [2025-02-08 05:40:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2025-02-08 05:40:20,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9248452696728559 [2025-02-08 05:40:20,930 INFO L175 Difference]: Start difference. First operand has 345 places, 337 transitions, 684 flow. Second operand 3 states and 1046 transitions. [2025-02-08 05:40:20,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 336 transitions, 714 flow [2025-02-08 05:40:20,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 336 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:20,936 INFO L231 Difference]: Finished difference. Result has 339 places, 336 transitions, 682 flow [2025-02-08 05:40:20,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=339, PETRI_TRANSITIONS=336} [2025-02-08 05:40:20,937 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -11 predicate places. [2025-02-08 05:40:20,937 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 336 transitions, 682 flow [2025-02-08 05:40:20,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 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:40:20,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:20,938 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] [2025-02-08 05:40:20,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:20,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:20,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:20,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1411686407, now seen corresponding path program 1 times [2025-02-08 05:40:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:20,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970626035] [2025-02-08 05:40:20,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:20,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:20,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:40:20,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 05:40:20,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:20,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,986 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:40:20,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970626035] [2025-02-08 05:40:20,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970626035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968121297] [2025-02-08 05:40:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:20,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:20,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 377 [2025-02-08 05:40:21,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 336 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 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:40:21,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 377 [2025-02-08 05:40:21,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,108 INFO L124 PetriNetUnfolderBase]: 15/634 cut-off events. [2025-02-08 05:40:21,109 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:40:21,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 634 events. 15/634 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2697 event pairs, 12 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 648. Up to 40 conditions per place. [2025-02-08 05:40:21,114 INFO L140 encePairwiseOnDemand]: 371/377 looper letters, 16 selfloop transitions, 1 changer transitions 0/331 dead transitions. [2025-02-08 05:40:21,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 706 flow [2025-02-08 05:40:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2025-02-08 05:40:21,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.918656056587091 [2025-02-08 05:40:21,117 INFO L175 Difference]: Start difference. First operand has 339 places, 336 transitions, 682 flow. Second operand 3 states and 1039 transitions. [2025-02-08 05:40:21,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 706 flow [2025-02-08 05:40:21,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 331 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:21,121 INFO L231 Difference]: Finished difference. Result has 334 places, 331 transitions, 670 flow [2025-02-08 05:40:21,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=334, PETRI_TRANSITIONS=331} [2025-02-08 05:40:21,122 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -16 predicate places. [2025-02-08 05:40:21,122 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 331 transitions, 670 flow [2025-02-08 05:40:21,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 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:40:21,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,123 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] [2025-02-08 05:40:21,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:21,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:21,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -845189548, now seen corresponding path program 1 times [2025-02-08 05:40:21,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176600428] [2025-02-08 05:40:21,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:40:21,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:40:21,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,711 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:40:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176600428] [2025-02-08 05:40:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176600428] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844225801] [2025-02-08 05:40:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:21,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:22,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 377 [2025-02-08 05:40:22,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 331 transitions, 670 flow. Second operand has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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:40:22,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 377 [2025-02-08 05:40:22,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,892 INFO L124 PetriNetUnfolderBase]: 1523/7322 cut-off events. [2025-02-08 05:40:22,892 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-02-08 05:40:22,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9873 conditions, 7322 events. 1523/7322 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 78668 event pairs, 1520 based on Foata normal form. 0/6423 useless extension candidates. Maximal degree in co-relation 9835. Up to 2447 conditions per place. [2025-02-08 05:40:22,933 INFO L140 encePairwiseOnDemand]: 365/377 looper letters, 46 selfloop transitions, 10 changer transitions 0/329 dead transitions. [2025-02-08 05:40:22,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 329 transitions, 778 flow [2025-02-08 05:40:22,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1876 transitions. [2025-02-08 05:40:22,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8293545534924845 [2025-02-08 05:40:22,938 INFO L175 Difference]: Start difference. First operand has 334 places, 331 transitions, 670 flow. Second operand 6 states and 1876 transitions. [2025-02-08 05:40:22,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 329 transitions, 778 flow [2025-02-08 05:40:22,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 329 transitions, 777 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:22,943 INFO L231 Difference]: Finished difference. Result has 336 places, 329 transitions, 685 flow [2025-02-08 05:40:22,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=336, PETRI_TRANSITIONS=329} [2025-02-08 05:40:22,944 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -14 predicate places. [2025-02-08 05:40:22,944 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 329 transitions, 685 flow [2025-02-08 05:40:22,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 304.5) internal successors, (1827), 6 states have internal predecessors, (1827), 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:40:22,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,945 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] [2025-02-08 05:40:22,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:22,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash 876209353, now seen corresponding path program 1 times [2025-02-08 05:40:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135552801] [2025-02-08 05:40:22,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:40:22,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:40:22,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,975 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:40:22,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135552801] [2025-02-08 05:40:22,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135552801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:22,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773717899] [2025-02-08 05:40:22,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:22,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:22,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:22,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 377 [2025-02-08 05:40:22,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 329 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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:40:22,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 377 [2025-02-08 05:40:22,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,070 INFO L124 PetriNetUnfolderBase]: 18/657 cut-off events. [2025-02-08 05:40:23,071 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:23,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 657 events. 18/657 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2937 event pairs, 15 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 686. Up to 40 conditions per place. [2025-02-08 05:40:23,074 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 12 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-02-08 05:40:23,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 328 transitions, 711 flow [2025-02-08 05:40:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2025-02-08 05:40:23,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283819628647215 [2025-02-08 05:40:23,077 INFO L175 Difference]: Start difference. First operand has 336 places, 329 transitions, 685 flow. Second operand 3 states and 1050 transitions. [2025-02-08 05:40:23,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 328 transitions, 711 flow [2025-02-08 05:40:23,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 328 transitions, 691 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:23,081 INFO L231 Difference]: Finished difference. Result has 332 places, 328 transitions, 667 flow [2025-02-08 05:40:23,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=332, PETRI_TRANSITIONS=328} [2025-02-08 05:40:23,082 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -18 predicate places. [2025-02-08 05:40:23,082 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 328 transitions, 667 flow [2025-02-08 05:40:23,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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:40:23,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,083 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] [2025-02-08 05:40:23,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:23,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:23,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 215394002, now seen corresponding path program 1 times [2025-02-08 05:40:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117634663] [2025-02-08 05:40:23,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:40:23,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:40:23,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,131 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:40:23,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117634663] [2025-02-08 05:40:23,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117634663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620845979] [2025-02-08 05:40:23,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 377 [2025-02-08 05:40:23,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 328 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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:40:23,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 377 [2025-02-08 05:40:23,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,355 INFO L124 PetriNetUnfolderBase]: 18/567 cut-off events. [2025-02-08 05:40:23,355 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:23,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 567 events. 18/567 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2121 event pairs, 15 based on Foata normal form. 0/500 useless extension candidates. Maximal degree in co-relation 582. Up to 40 conditions per place. [2025-02-08 05:40:23,364 INFO L140 encePairwiseOnDemand]: 374/377 looper letters, 12 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2025-02-08 05:40:23,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 327 transitions, 693 flow [2025-02-08 05:40:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1050 transitions. [2025-02-08 05:40:23,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283819628647215 [2025-02-08 05:40:23,366 INFO L175 Difference]: Start difference. First operand has 332 places, 328 transitions, 667 flow. Second operand 3 states and 1050 transitions. [2025-02-08 05:40:23,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 327 transitions, 693 flow [2025-02-08 05:40:23,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 327 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,371 INFO L231 Difference]: Finished difference. Result has 331 places, 327 transitions, 665 flow [2025-02-08 05:40:23,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=331, PETRI_TRANSITIONS=327} [2025-02-08 05:40:23,371 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -19 predicate places. [2025-02-08 05:40:23,371 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 327 transitions, 665 flow [2025-02-08 05:40:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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:40:23,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,372 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] [2025-02-08 05:40:23,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:23,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:23,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash -504311111, now seen corresponding path program 1 times [2025-02-08 05:40:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-02-08 05:40:23,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:40:23,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:40:23,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008650586] [2025-02-08 05:40:23,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008650586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867087677] [2025-02-08 05:40:23,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 377 [2025-02-08 05:40:23,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 327 transitions, 665 flow. Second operand has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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:40:23,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 377 [2025-02-08 05:40:23,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,602 INFO L124 PetriNetUnfolderBase]: 23/782 cut-off events. [2025-02-08 05:40:23,603 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:40:23,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 782 events. 23/782 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3865 event pairs, 20 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 805. Up to 50 conditions per place. [2025-02-08 05:40:23,607 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 14 selfloop transitions, 1 changer transitions 0/323 dead transitions. [2025-02-08 05:40:23,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 323 transitions, 687 flow [2025-02-08 05:40:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2025-02-08 05:40:23,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239610963748894 [2025-02-08 05:40:23,609 INFO L175 Difference]: Start difference. First operand has 331 places, 327 transitions, 665 flow. Second operand 3 states and 1045 transitions. [2025-02-08 05:40:23,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 323 transitions, 687 flow [2025-02-08 05:40:23,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 323 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,615 INFO L231 Difference]: Finished difference. Result has 327 places, 323 transitions, 655 flow [2025-02-08 05:40:23,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=327, PETRI_TRANSITIONS=323} [2025-02-08 05:40:23,617 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -23 predicate places. [2025-02-08 05:40:23,618 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 323 transitions, 655 flow [2025-02-08 05:40:23,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 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:40:23,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:23,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:23,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:23,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash 481468701, now seen corresponding path program 1 times [2025-02-08 05:40:23,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-02-08 05:40:23,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 05:40:23,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 05:40:23,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,667 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:40:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-02-08 05:40:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452617232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83290336] [2025-02-08 05:40:23,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 377 [2025-02-08 05:40:23,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 323 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 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:40:23,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 377 [2025-02-08 05:40:23,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,715 INFO L124 PetriNetUnfolderBase]: 7/409 cut-off events. [2025-02-08 05:40:23,715 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:40:23,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 409 events. 7/409 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1147 event pairs, 0 based on Foata normal form. 1/374 useless extension candidates. Maximal degree in co-relation 400. Up to 11 conditions per place. [2025-02-08 05:40:23,719 INFO L140 encePairwiseOnDemand]: 373/377 looper letters, 8 selfloop transitions, 1 changer transitions 2/323 dead transitions. [2025-02-08 05:40:23,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 323 transitions, 679 flow [2025-02-08 05:40:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2025-02-08 05:40:23,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9372236958443855 [2025-02-08 05:40:23,724 INFO L175 Difference]: Start difference. First operand has 327 places, 323 transitions, 655 flow. Second operand 3 states and 1060 transitions. [2025-02-08 05:40:23,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 323 transitions, 679 flow [2025-02-08 05:40:23,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 323 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:23,729 INFO L231 Difference]: Finished difference. Result has 326 places, 319 transitions, 647 flow [2025-02-08 05:40:23,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=326, PETRI_TRANSITIONS=319} [2025-02-08 05:40:23,731 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -24 predicate places. [2025-02-08 05:40:23,732 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 319 transitions, 647 flow [2025-02-08 05:40:23,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 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:40:23,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,732 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] [2025-02-08 05:40:23,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:23,733 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:23,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1165018690, now seen corresponding path program 1 times [2025-02-08 05:40:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348110543] [2025-02-08 05:40:23,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-08 05:40:23,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-08 05:40:23,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,782 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:40:23,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348110543] [2025-02-08 05:40:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348110543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303222912] [2025-02-08 05:40:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:23,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:23,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 377 [2025-02-08 05:40:23,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 319 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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:40:23,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 377 [2025-02-08 05:40:23,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,909 INFO L124 PetriNetUnfolderBase]: 59/1374 cut-off events. [2025-02-08 05:40:23,909 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:40:23,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1374 events. 59/1374 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9895 event pairs, 22 based on Foata normal form. 0/1221 useless extension candidates. Maximal degree in co-relation 1463. Up to 102 conditions per place. [2025-02-08 05:40:23,917 INFO L140 encePairwiseOnDemand]: 371/377 looper letters, 16 selfloop transitions, 3 changer transitions 0/323 dead transitions. [2025-02-08 05:40:23,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 697 flow [2025-02-08 05:40:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:23,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1057 transitions. [2025-02-08 05:40:23,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345711759504863 [2025-02-08 05:40:23,920 INFO L175 Difference]: Start difference. First operand has 326 places, 319 transitions, 647 flow. Second operand 3 states and 1057 transitions. [2025-02-08 05:40:23,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 697 flow [2025-02-08 05:40:23,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 323 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:23,926 INFO L231 Difference]: Finished difference. Result has 323 places, 319 transitions, 661 flow [2025-02-08 05:40:23,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=661, PETRI_PLACES=323, PETRI_TRANSITIONS=319} [2025-02-08 05:40:23,929 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -27 predicate places. [2025-02-08 05:40:23,929 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 319 transitions, 661 flow [2025-02-08 05:40:23,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 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:40:23,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,930 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] [2025-02-08 05:40:23,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:23,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:23,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash -797535231, now seen corresponding path program 1 times [2025-02-08 05:40:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251517913] [2025-02-08 05:40:23,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-08 05:40:23,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-08 05:40:23,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,152 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:40:24,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251517913] [2025-02-08 05:40:24,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251517913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:40:24,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839479153] [2025-02-08 05:40:24,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:40:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:40:24,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:40:24,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 377 [2025-02-08 05:40:24,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 319 transitions, 661 flow. Second operand has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 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:40:24,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 377 [2025-02-08 05:40:24,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,983 INFO L124 PetriNetUnfolderBase]: 24/928 cut-off events. [2025-02-08 05:40:24,983 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:40:24,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 928 events. 24/928 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4020 event pairs, 9 based on Foata normal form. 3/856 useless extension candidates. Maximal degree in co-relation 1014. Up to 24 conditions per place. [2025-02-08 05:40:24,989 INFO L140 encePairwiseOnDemand]: 356/377 looper letters, 28 selfloop transitions, 28 changer transitions 0/347 dead transitions. [2025-02-08 05:40:24,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 347 transitions, 836 flow [2025-02-08 05:40:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:40:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:40:24,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3377 transitions. [2025-02-08 05:40:24,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8957559681697612 [2025-02-08 05:40:24,994 INFO L175 Difference]: Start difference. First operand has 323 places, 319 transitions, 661 flow. Second operand 10 states and 3377 transitions. [2025-02-08 05:40:24,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 347 transitions, 836 flow [2025-02-08 05:40:24,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 347 transitions, 836 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:24,998 INFO L231 Difference]: Finished difference. Result has 336 places, 335 transitions, 790 flow [2025-02-08 05:40:24,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=790, PETRI_PLACES=336, PETRI_TRANSITIONS=335} [2025-02-08 05:40:25,000 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -14 predicate places. [2025-02-08 05:40:25,000 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 335 transitions, 790 flow [2025-02-08 05:40:25,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 335.0) internal successors, (2345), 7 states have internal predecessors, (2345), 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:40:25,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,001 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] [2025-02-08 05:40:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:25,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:25,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash -328778711, now seen corresponding path program 1 times [2025-02-08 05:40:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103065869] [2025-02-08 05:40:25,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-08 05:40:25,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-08 05:40:25,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,093 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:40:25,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103065869] [2025-02-08 05:40:25,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103065869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868463879] [2025-02-08 05:40:25,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:40:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:40:25,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:40:25,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 377 [2025-02-08 05:40:25,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 335 transitions, 790 flow. Second operand has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 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:40:25,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:25,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 377 [2025-02-08 05:40:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:25,279 INFO L124 PetriNetUnfolderBase]: 36/1518 cut-off events. [2025-02-08 05:40:25,279 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:40:25,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 1518 events. 36/1518 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9302 event pairs, 13 based on Foata normal form. 6/1391 useless extension candidates. Maximal degree in co-relation 1699. Up to 48 conditions per place. [2025-02-08 05:40:25,288 INFO L140 encePairwiseOnDemand]: 371/377 looper letters, 21 selfloop transitions, 5 changer transitions 0/345 dead transitions. [2025-02-08 05:40:25,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 345 transitions, 869 flow [2025-02-08 05:40:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:40:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:40:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1742 transitions. [2025-02-08 05:40:25,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9241379310344827 [2025-02-08 05:40:25,291 INFO L175 Difference]: Start difference. First operand has 336 places, 335 transitions, 790 flow. Second operand 5 states and 1742 transitions. [2025-02-08 05:40:25,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 345 transitions, 869 flow [2025-02-08 05:40:25,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 345 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:25,296 INFO L231 Difference]: Finished difference. Result has 342 places, 337 transitions, 815 flow [2025-02-08 05:40:25,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=815, PETRI_PLACES=342, PETRI_TRANSITIONS=337} [2025-02-08 05:40:25,301 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -8 predicate places. [2025-02-08 05:40:25,301 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 337 transitions, 815 flow [2025-02-08 05:40:25,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 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:40:25,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:25,306 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] [2025-02-08 05:40:25,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:25,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:25,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1534134332, now seen corresponding path program 1 times [2025-02-08 05:40:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-02-08 05:40:25,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:25,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:25,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-08 05:40:25,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-08 05:40:25,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:25,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:25,736 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:40:25,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:25,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523498197] [2025-02-08 05:40:25,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523498197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:25,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:25,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618755119] [2025-02-08 05:40:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:25,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:25,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:25,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:25,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:26,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-02-08 05:40:26,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 337 transitions, 815 flow. Second operand has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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:40:26,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-02-08 05:40:26,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,276 INFO L124 PetriNetUnfolderBase]: 51/1400 cut-off events. [2025-02-08 05:40:26,276 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 05:40:26,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 1400 events. 51/1400 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8329 event pairs, 17 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 1685. Up to 88 conditions per place. [2025-02-08 05:40:26,283 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 28 selfloop transitions, 4 changer transitions 0/344 dead transitions. [2025-02-08 05:40:26,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 344 transitions, 901 flow [2025-02-08 05:40:26,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2053 transitions. [2025-02-08 05:40:26,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076038903625111 [2025-02-08 05:40:26,289 INFO L175 Difference]: Start difference. First operand has 342 places, 337 transitions, 815 flow. Second operand 6 states and 2053 transitions. [2025-02-08 05:40:26,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 344 transitions, 901 flow [2025-02-08 05:40:26,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 344 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:26,295 INFO L231 Difference]: Finished difference. Result has 344 places, 336 transitions, 816 flow [2025-02-08 05:40:26,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=816, PETRI_PLACES=344, PETRI_TRANSITIONS=336} [2025-02-08 05:40:26,296 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -6 predicate places. [2025-02-08 05:40:26,296 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 336 transitions, 816 flow [2025-02-08 05:40:26,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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:40:26,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,297 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:40:26,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:26,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:26,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1129280891, now seen corresponding path program 1 times [2025-02-08 05:40:26,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161290009] [2025-02-08 05:40:26,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-08 05:40:26,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-08 05:40:26,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:26,340 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:40:26,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:26,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161290009] [2025-02-08 05:40:26,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161290009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:26,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621155666] [2025-02-08 05:40:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:26,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:26,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:26,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 377 [2025-02-08 05:40:26,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 336 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:26,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 377 [2025-02-08 05:40:26,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:26,648 INFO L124 PetriNetUnfolderBase]: 118/2560 cut-off events. [2025-02-08 05:40:26,649 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-08 05:40:26,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 2560 events. 118/2560 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 20422 event pairs, 33 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 2913. Up to 220 conditions per place. [2025-02-08 05:40:26,662 INFO L140 encePairwiseOnDemand]: 371/377 looper letters, 16 selfloop transitions, 3 changer transitions 0/340 dead transitions. [2025-02-08 05:40:26,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 340 transitions, 866 flow [2025-02-08 05:40:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1057 transitions. [2025-02-08 05:40:26,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345711759504863 [2025-02-08 05:40:26,665 INFO L175 Difference]: Start difference. First operand has 344 places, 336 transitions, 816 flow. Second operand 3 states and 1057 transitions. [2025-02-08 05:40:26,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 340 transitions, 866 flow [2025-02-08 05:40:26,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 340 transitions, 859 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:26,670 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 824 flow [2025-02-08 05:40:26,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-02-08 05:40:26,671 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -10 predicate places. [2025-02-08 05:40:26,671 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 824 flow [2025-02-08 05:40:26,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:26,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:26,672 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] [2025-02-08 05:40:26,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:26,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:26,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1033184926, now seen corresponding path program 1 times [2025-02-08 05:40:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413795514] [2025-02-08 05:40:26,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:26,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-08 05:40:26,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-08 05:40:26,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:26,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,032 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:40:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413795514] [2025-02-08 05:40:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413795514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861111008] [2025-02-08 05:40:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:27,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:27,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-02-08 05:40:27,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 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:40:27,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:27,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-02-08 05:40:27,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:27,485 INFO L124 PetriNetUnfolderBase]: 89/1735 cut-off events. [2025-02-08 05:40:27,485 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-02-08 05:40:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 1735 events. 89/1735 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 11698 event pairs, 18 based on Foata normal form. 0/1619 useless extension candidates. Maximal degree in co-relation 2107. Up to 88 conditions per place. [2025-02-08 05:40:27,493 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 26 selfloop transitions, 4 changer transitions 0/343 dead transitions. [2025-02-08 05:40:27,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 343 transitions, 906 flow [2025-02-08 05:40:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2053 transitions. [2025-02-08 05:40:27,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076038903625111 [2025-02-08 05:40:27,496 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 824 flow. Second operand 6 states and 2053 transitions. [2025-02-08 05:40:27,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 343 transitions, 906 flow [2025-02-08 05:40:27,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 343 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:27,500 INFO L231 Difference]: Finished difference. Result has 344 places, 335 transitions, 830 flow [2025-02-08 05:40:27,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=830, PETRI_PLACES=344, PETRI_TRANSITIONS=335} [2025-02-08 05:40:27,500 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -6 predicate places. [2025-02-08 05:40:27,500 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 335 transitions, 830 flow [2025-02-08 05:40:27,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 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:40:27,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:27,501 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] [2025-02-08 05:40:27,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:40:27,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:27,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1986700072, now seen corresponding path program 1 times [2025-02-08 05:40:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:27,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-02-08 05:40:27,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:27,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-08 05:40:27,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-08 05:40:27,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:27,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:27,735 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:40:27,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:27,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326080809] [2025-02-08 05:40:27,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326080809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:27,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244955112] [2025-02-08 05:40:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:27,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:27,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:27,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:28,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-02-08 05:40:28,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 335 transitions, 830 flow. Second operand has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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:40:28,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-02-08 05:40:28,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,211 INFO L124 PetriNetUnfolderBase]: 63/1696 cut-off events. [2025-02-08 05:40:28,212 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-02-08 05:40:28,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 1696 events. 63/1696 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10893 event pairs, 18 based on Foata normal form. 0/1585 useless extension candidates. Maximal degree in co-relation 2080. Up to 88 conditions per place. [2025-02-08 05:40:28,220 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 28 selfloop transitions, 4 changer transitions 0/342 dead transitions. [2025-02-08 05:40:28,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 342 transitions, 916 flow [2025-02-08 05:40:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2053 transitions. [2025-02-08 05:40:28,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076038903625111 [2025-02-08 05:40:28,223 INFO L175 Difference]: Start difference. First operand has 344 places, 335 transitions, 830 flow. Second operand 6 states and 2053 transitions. [2025-02-08 05:40:28,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 342 transitions, 916 flow [2025-02-08 05:40:28,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 342 transitions, 909 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:28,227 INFO L231 Difference]: Finished difference. Result has 344 places, 334 transitions, 829 flow [2025-02-08 05:40:28,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=829, PETRI_PLACES=344, PETRI_TRANSITIONS=334} [2025-02-08 05:40:28,228 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -6 predicate places. [2025-02-08 05:40:28,228 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 334 transitions, 829 flow [2025-02-08 05:40:28,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.6666666666667) internal successors, (2032), 6 states have internal predecessors, (2032), 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:40:28,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,229 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] [2025-02-08 05:40:28,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:40:28,230 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:28,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -435751934, now seen corresponding path program 1 times [2025-02-08 05:40:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132313502] [2025-02-08 05:40:28,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-08 05:40:28,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-08 05:40:28,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:28,493 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:40:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:28,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132313502] [2025-02-08 05:40:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132313502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:28,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424962985] [2025-02-08 05:40:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:28,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:28,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:28,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-02-08 05:40:28,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 334 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 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:40:28,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:28,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-02-08 05:40:28,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:28,950 INFO L124 PetriNetUnfolderBase]: 97/1634 cut-off events. [2025-02-08 05:40:28,950 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-08 05:40:28,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 1634 events. 97/1634 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10794 event pairs, 18 based on Foata normal form. 0/1535 useless extension candidates. Maximal degree in co-relation 2031. Up to 88 conditions per place. [2025-02-08 05:40:28,958 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 21 selfloop transitions, 4 changer transitions 19/341 dead transitions. [2025-02-08 05:40:28,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 341 transitions, 911 flow [2025-02-08 05:40:28,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2053 transitions. [2025-02-08 05:40:28,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9076038903625111 [2025-02-08 05:40:28,962 INFO L175 Difference]: Start difference. First operand has 344 places, 334 transitions, 829 flow. Second operand 6 states and 2053 transitions. [2025-02-08 05:40:28,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 341 transitions, 911 flow [2025-02-08 05:40:28,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 341 transitions, 904 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:28,966 INFO L231 Difference]: Finished difference. Result has 344 places, 318 transitions, 754 flow [2025-02-08 05:40:28,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=754, PETRI_PLACES=344, PETRI_TRANSITIONS=318} [2025-02-08 05:40:28,967 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -6 predicate places. [2025-02-08 05:40:28,967 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 318 transitions, 754 flow [2025-02-08 05:40:28,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.8333333333333) internal successors, (2033), 6 states have internal predecessors, (2033), 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:40:28,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:28,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:40:28,969 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash 682422583, now seen corresponding path program 1 times [2025-02-08 05:40:28,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-02-08 05:40:28,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:28,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:40:28,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:40:28,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:28,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:40:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248507507] [2025-02-08 05:40:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248507507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081161708] [2025-02-08 05:40:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:29,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:29,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:29,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-02-08 05:40:29,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 318 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 339.8333333333333) internal successors, (2039), 6 states have internal predecessors, (2039), 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:40:29,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:29,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-02-08 05:40:29,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:29,641 INFO L124 PetriNetUnfolderBase]: 46/1136 cut-off events. [2025-02-08 05:40:29,641 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:40:29,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 1136 events. 46/1136 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6442 event pairs, 10 based on Foata normal form. 0/1077 useless extension candidates. Maximal degree in co-relation 1422. Up to 47 conditions per place. [2025-02-08 05:40:29,648 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 25 selfloop transitions, 4 changer transitions 0/325 dead transitions. [2025-02-08 05:40:29,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 325 transitions, 834 flow [2025-02-08 05:40:29,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2052 transitions. [2025-02-08 05:40:29,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071618037135278 [2025-02-08 05:40:29,651 INFO L175 Difference]: Start difference. First operand has 344 places, 318 transitions, 754 flow. Second operand 6 states and 2052 transitions. [2025-02-08 05:40:29,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 325 transitions, 834 flow [2025-02-08 05:40:29,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 325 transitions, 789 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-02-08 05:40:29,656 INFO L231 Difference]: Finished difference. Result has 332 places, 317 transitions, 715 flow [2025-02-08 05:40:29,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=715, PETRI_PLACES=332, PETRI_TRANSITIONS=317} [2025-02-08 05:40:29,657 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -18 predicate places. [2025-02-08 05:40:29,657 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 317 transitions, 715 flow [2025-02-08 05:40:29,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 339.8333333333333) internal successors, (2039), 6 states have internal predecessors, (2039), 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:40:29,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:29,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:40:29,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -444575973, now seen corresponding path program 1 times [2025-02-08 05:40:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459685826] [2025-02-08 05:40:29,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 05:40:29,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 05:40:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:40:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459685826] [2025-02-08 05:40:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459685826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105338790] [2025-02-08 05:40:29,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:29,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:29,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:30,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 337 out of 377 [2025-02-08 05:40:30,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 317 transitions, 715 flow. Second operand has 6 states, 6 states have (on average 339.8333333333333) internal successors, (2039), 6 states have internal predecessors, (2039), 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:40:30,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:30,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 337 of 377 [2025-02-08 05:40:30,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:30,390 INFO L124 PetriNetUnfolderBase]: 46/1130 cut-off events. [2025-02-08 05:40:30,390 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:30,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 1130 events. 46/1130 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6385 event pairs, 10 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1376. Up to 47 conditions per place. [2025-02-08 05:40:30,395 INFO L140 encePairwiseOnDemand]: 372/377 looper letters, 0 selfloop transitions, 0 changer transitions 324/324 dead transitions. [2025-02-08 05:40:30,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 324 transitions, 795 flow [2025-02-08 05:40:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2052 transitions. [2025-02-08 05:40:30,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071618037135278 [2025-02-08 05:40:30,398 INFO L175 Difference]: Start difference. First operand has 332 places, 317 transitions, 715 flow. Second operand 6 states and 2052 transitions. [2025-02-08 05:40:30,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 324 transitions, 795 flow [2025-02-08 05:40:30,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 324 transitions, 788 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:30,401 INFO L231 Difference]: Finished difference. Result has 332 places, 0 transitions, 0 flow [2025-02-08 05:40:30,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=332, PETRI_TRANSITIONS=0} [2025-02-08 05:40:30,402 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -18 predicate places. [2025-02-08 05:40:30,402 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 0 transitions, 0 flow [2025-02-08 05:40:30,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 339.8333333333333) internal successors, (2039), 6 states have internal predecessors, (2039), 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:40:30,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2025-02-08 05:40:30,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-02-08 05:40:30,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-02-08 05:40:30,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-02-08 05:40:30,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-02-08 05:40:30,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-02-08 05:40:30,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-02-08 05:40:30,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-02-08 05:40:30,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-02-08 05:40:30,408 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-02-08 05:40:30,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:40:30,408 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:30,412 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:30,413 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:30,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:30 BasicIcfg [2025-02-08 05:40:30,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:30,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:30,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:30,419 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:30,419 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:19" (3/4) ... [2025-02-08 05:40:30,421 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:30,423 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:30,423 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:30,423 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:30,428 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 05:40:30,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:30,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:30,429 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:30,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:30,502 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:30,502 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:30,503 INFO L158 Benchmark]: Toolchain (without parser) took 11847.85ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 113.0MB in the beginning and 239.9MB in the end (delta: -126.9MB). Peak memory consumption was 518.1MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,503 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:30,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.06ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.89ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 96.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,505 INFO L158 Benchmark]: Boogie Preprocessor took 35.58ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:30,505 INFO L158 Benchmark]: IcfgBuilder took 864.68ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 58.7MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,505 INFO L158 Benchmark]: TraceAbstraction took 10444.39ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 58.2MB in the beginning and 248.3MB in the end (delta: -190.1MB). Peak memory consumption was 459.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,506 INFO L158 Benchmark]: Witness Printer took 83.57ms. Allocated memory is still 788.5MB. Free memory was 248.3MB in the beginning and 239.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:30,507 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.06ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 99.7MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.89ms. Allocated memory is still 142.6MB. Free memory was 99.7MB in the beginning and 96.6MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.58ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 864.68ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 58.7MB in the end (delta: 35.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10444.39ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 58.2MB in the beginning and 248.3MB in the end (delta: -190.1MB). Peak memory consumption was 459.4MB. Max. memory is 16.1GB. * Witness Printer took 83.57ms. Allocated memory is still 788.5MB. Free memory was 248.3MB in the beginning and 239.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 522 locations, 49 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2003 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1057 mSDsluCounter, 622 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 448 mSDsCounter, 591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3140 IncrementalHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 591 mSolverCounterUnsat, 174 mSDtfsCounter, 3140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=830occurred in iteration=14, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1989 NumberOfCodeBlocks, 1989 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1971 ConstructedInterpolants, 0 QuantifiedInterpolants, 3084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:30,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE