./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum2.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-sum2.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 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:16,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:16,103 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,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:16,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:16,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:16,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:16,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:16,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:16,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:16,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:16,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:16,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:16,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:16,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:16,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:16,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:16,126 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2025-02-08 05:40:16,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:16,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:16,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:16,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:16,388 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:16,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-08 05:40:17,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/903901112/e9c222ae21004dc7bdc4da8ad7b0ce94/FLAG87e5b7070 [2025-02-08 05:40:17,807 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:17,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2025-02-08 05:40:17,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/903901112/e9c222ae21004dc7bdc4da8ad7b0ce94/FLAG87e5b7070 [2025-02-08 05:40:18,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/903901112/e9c222ae21004dc7bdc4da8ad7b0ce94 [2025-02-08 05:40:18,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:18,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:18,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:18,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:18,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:18,143 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,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d389e3 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,144 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,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:18,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:18,312 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:18,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:18,360 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:18,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:18 WrapperNode [2025-02-08 05:40:18,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:18,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:18,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:18,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:18,370 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:18" (1/1) ... [2025-02-08 05:40:18,378 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:18" (1/1) ... [2025-02-08 05:40:18,409 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 373 [2025-02-08 05:40:18,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:18,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:18,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:18,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:18,420 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:18" (1/1) ... [2025-02-08 05:40:18,420 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:18" (1/1) ... [2025-02-08 05:40:18,428 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:18" (1/1) ... [2025-02-08 05:40:18,429 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:18" (1/1) ... [2025-02-08 05:40:18,450 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:18" (1/1) ... [2025-02-08 05:40:18,451 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:18" (1/1) ... [2025-02-08 05:40:18,457 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:18" (1/1) ... [2025-02-08 05:40:18,462 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:18" (1/1) ... [2025-02-08 05:40:18,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:18,466 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:18,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:18,468 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:18,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:18" (1/1) ... [2025-02-08 05:40:18,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:18,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:18,497 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:18,499 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:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:18,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:18,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:18,517 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:18,604 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:18,605 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:18,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:18,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume false; [2025-02-08 05:40:18,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume false; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: 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:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: havoc #t~post6#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-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:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: ~i~0#1 := 1 + #t~post6#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: #t~post6#1 := ~i~0#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50: havoc #t~nondet5#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-1: havoc #t~ret4#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-2: havoc #t~ret3#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-3: havoc #t~mem2#1; [2025-02-08 05:40:18,782 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-4: assume #race~res1~0 == #t~nondet5#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-4: assume !(#race~res1~0 == #t~nondet5#1); [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-5: havoc #t~mem1#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-6: #race~res1~0 := #t~nondet5#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-7: havoc #t~nondet5#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-8: ~res1~0 := #t~ret4#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-9: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret4#1 && #t~ret4#1 <= 2147483647; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-10: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-11: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-12: #t~ret4#1 := plus_#res#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-13: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-14: havoc plus_#res#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-15: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res1~0, #t~ret3#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-16: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret3#1 && #t~ret3#1 <= 2147483647; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-17: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-18: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L50-19: #t~ret3#1 := plus_#res#1; [2025-02-08 05:40:18,783 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L51: [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60: havoc #t~nondet11#1; [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-1: havoc #t~ret10#1; [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-2: havoc #t~ret9#1; [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-3: havoc #t~mem8#1; [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-4: assume #race~res2~0 == #t~nondet11#1; [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-4: assume !(#race~res2~0 == #t~nondet11#1); [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-5: havoc #t~mem7#1; [2025-02-08 05:40:18,871 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-6: #race~res2~0 := #t~nondet11#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-7: havoc #t~nondet11#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: ~res2~0 := #t~ret10#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-9: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret10#1 && #t~ret10#1 <= 2147483647; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: #t~ret10#1 := plus_#res#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-13: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-14: havoc plus_#res#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-15: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret9#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-16: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-17: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-18: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,872 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-19: #t~ret9#1 := plus_#res#1; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume false; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume false; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:40:18,873 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: 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:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-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:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-2: havoc #t~post12#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-3: ~i~1#1 := 1 + #t~post12#1; [2025-02-08 05:40:18,874 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L58-4: #t~post12#1 := ~i~1#1; [2025-02-08 05:40:18,955 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-3: ~i~2#1 := 1 + #t~post18#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-4: #t~post18#1 := ~i~2#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L36-1: assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70: havoc #t~nondet17#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-1: havoc #t~ret16#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-2: havoc #t~ret15#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-1: assume false; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-3: havoc #t~mem14#1; [2025-02-08 05:40:18,956 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume 0 == assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-2: assume !(0 == assume_abort_if_not_~cond#1); [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-4: assume #race~res2~0 == #t~nondet17#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-4: assume !(#race~res2~0 == #t~nondet17#1); [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L37-3: assume false; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-5: havoc #t~mem13#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-6: #race~res2~0 := #t~nondet17#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-7: havoc #t~nondet17#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-8: ~res2~0 := #t~ret16#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-9: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret16#1 && #t~ret16#1 <= 2147483647; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-10: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-11: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-12: #t~ret16#1 := plus_#res#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-13: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,957 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-14: havoc plus_#res#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-15: assume { :begin_inline_plus } true;plus_#in~a#1, plus_#in~b#1 := ~res2~0, #t~ret15#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-16: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret15#1 && #t~ret15#1 <= 2147483647; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-17: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-18: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L70-19: #t~ret15#1 := plus_#res#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L71: [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: plus_~b#1 := plus_#in~b#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L113-1: plus_~a#1 := plus_#in~a#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: 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:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L114-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:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115: assume { :end_inline_assume_abort_if_not } true;plus_#res#1 := plus_~a#1 + plus_~b#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-1: havoc assume_abort_if_not_#in~cond#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-2: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L115-3: havoc assume_abort_if_not_~cond#1; [2025-02-08 05:40:18,958 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L68-2: havoc #t~post18#1; [2025-02-08 05:40:19,114 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:19,115 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:19,315 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L116-1 is not an error location. [2025-02-08 05:40:19,315 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L116-1 is not an error location. [2025-02-08 05:40:19,316 WARN L149 AtomicBlockAnalyzer]: Unexpected successor node of atomic block begin: L116-1 is not an error location. [2025-02-08 05:40:19,319 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:19,319 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:19,319 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,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:19,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:19,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:19,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:19,327 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,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4537c5 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,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:18" (2/3) ... [2025-02-08 05:40:19,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4537c5 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,329 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,330 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-02-08 05:40:19,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:19,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 258 locations, 1 initial locations, 5 loop locations, and 35 error locations. [2025-02-08 05:40:19,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:19,409 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:40:19,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 267 places, 269 transitions, 559 flow [2025-02-08 05:40:19,512 INFO L124 PetriNetUnfolderBase]: 12/266 cut-off events. [2025-02-08 05:40:19,516 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:19,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 12/266 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 313 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2025-02-08 05:40:19,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 267 places, 269 transitions, 559 flow [2025-02-08 05:40:19,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 248 places, 249 transitions, 516 flow [2025-02-08 05:40:19,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:19,548 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;@255a9d6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:19,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-02-08 05:40:19,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:19,555 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-02-08 05:40:19,555 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:19,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:19,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:19,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1123882149, now seen corresponding path program 1 times [2025-02-08 05:40:19,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-02-08 05:40:19,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:40:19,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:40:19,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,693 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:19,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-02-08 05:40:19,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510784571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407292550] [2025-02-08 05:40:19,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 269 [2025-02-08 05:40:19,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 249 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:19,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 269 [2025-02-08 05:40:19,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,911 INFO L124 PetriNetUnfolderBase]: 41/384 cut-off events. [2025-02-08 05:40:19,912 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-02-08 05:40:19,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 384 events. 41/384 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1153 event pairs, 38 based on Foata normal form. 28/356 useless extension candidates. Maximal degree in co-relation 275. Up to 83 conditions per place. [2025-02-08 05:40:19,915 INFO L140 encePairwiseOnDemand]: 243/269 looper letters, 16 selfloop transitions, 2 changer transitions 5/225 dead transitions. [2025-02-08 05:40:19,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 225 transitions, 504 flow [2025-02-08 05:40:19,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-02-08 05:40:19,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8847583643122676 [2025-02-08 05:40:19,931 INFO L175 Difference]: Start difference. First operand has 248 places, 249 transitions, 516 flow. Second operand 3 states and 714 transitions. [2025-02-08 05:40:19,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 225 transitions, 504 flow [2025-02-08 05:40:19,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 225 transitions, 492 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:40:19,942 INFO L231 Difference]: Finished difference. Result has 228 places, 220 transitions, 450 flow [2025-02-08 05:40:19,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=228, PETRI_TRANSITIONS=220} [2025-02-08 05:40:19,947 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -20 predicate places. [2025-02-08 05:40:19,948 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 220 transitions, 450 flow [2025-02-08 05:40:19,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 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:19,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,948 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:19,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:19,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:19,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,950 INFO L85 PathProgramCache]: Analyzing trace with hash -878878558, now seen corresponding path program 1 times [2025-02-08 05:40:19,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264985505] [2025-02-08 05:40:19,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:40:19,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:40:19,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,010 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,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264985505] [2025-02-08 05:40:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264985505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154142859] [2025-02-08 05:40:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:20,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:20,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 269 [2025-02-08 05:40:20,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 220 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:20,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 269 [2025-02-08 05:40:20,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:20,122 INFO L124 PetriNetUnfolderBase]: 37/356 cut-off events. [2025-02-08 05:40:20,122 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:40:20,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 356 events. 37/356 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1024 event pairs, 34 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 419. Up to 78 conditions per place. [2025-02-08 05:40:20,124 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 17 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2025-02-08 05:40:20,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 486 flow [2025-02-08 05:40:20,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2025-02-08 05:40:20,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8537794299876085 [2025-02-08 05:40:20,127 INFO L175 Difference]: Start difference. First operand has 228 places, 220 transitions, 450 flow. Second operand 3 states and 689 transitions. [2025-02-08 05:40:20,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 486 flow [2025-02-08 05:40:20,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:20,130 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 448 flow [2025-02-08 05:40:20,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2025-02-08 05:40:20,131 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -26 predicate places. [2025-02-08 05:40:20,131 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 448 flow [2025-02-08 05:40:20,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:20,132 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,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:20,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:20,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash 141941961, now seen corresponding path program 1 times [2025-02-08 05:40:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:20,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-02-08 05:40:20,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:20,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:20,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 05:40:20,148 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,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:20,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,189 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,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174974952] [2025-02-08 05:40:20,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174974952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:20,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213765866] [2025-02-08 05:40:20,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:20,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:20,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:20,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 269 [2025-02-08 05:40:20,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:20,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:20,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 269 [2025-02-08 05:40:20,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:20,286 INFO L124 PetriNetUnfolderBase]: 62/405 cut-off events. [2025-02-08 05:40:20,286 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:40:20,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 405 events. 62/405 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1395 event pairs, 59 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 507. Up to 122 conditions per place. [2025-02-08 05:40:20,288 INFO L140 encePairwiseOnDemand]: 263/269 looper letters, 19 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2025-02-08 05:40:20,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 214 transitions, 478 flow [2025-02-08 05:40:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-02-08 05:40:20,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8451053283767038 [2025-02-08 05:40:20,290 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 448 flow. Second operand 3 states and 682 transitions. [2025-02-08 05:40:20,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 214 transitions, 478 flow [2025-02-08 05:40:20,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 214 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:20,293 INFO L231 Difference]: Finished difference. Result has 217 places, 214 transitions, 436 flow [2025-02-08 05:40:20,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=217, PETRI_TRANSITIONS=214} [2025-02-08 05:40:20,294 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -31 predicate places. [2025-02-08 05:40:20,294 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 214 transitions, 436 flow [2025-02-08 05:40:20,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:20,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:20,294 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:20,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:20,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash -367954172, now seen corresponding path program 1 times [2025-02-08 05:40:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249112083] [2025-02-08 05:40:20,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:20,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:40:20,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:40:20,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:20,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,826 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,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249112083] [2025-02-08 05:40:20,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249112083] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:20,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973810644] [2025-02-08 05:40:20,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:20,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:20,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:20,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 269 [2025-02-08 05:40:20,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 214 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 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,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:20,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 269 [2025-02-08 05:40:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,022 INFO L124 PetriNetUnfolderBase]: 18/267 cut-off events. [2025-02-08 05:40:21,022 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:21,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 267 events. 18/267 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 471 event pairs, 15 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 302. Up to 53 conditions per place. [2025-02-08 05:40:21,023 INFO L140 encePairwiseOnDemand]: 257/269 looper letters, 25 selfloop transitions, 10 changer transitions 0/212 dead transitions. [2025-02-08 05:40:21,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 212 transitions, 502 flow [2025-02-08 05:40:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-02-08 05:40:21,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7924411400247832 [2025-02-08 05:40:21,026 INFO L175 Difference]: Start difference. First operand has 217 places, 214 transitions, 436 flow. Second operand 6 states and 1279 transitions. [2025-02-08 05:40:21,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 212 transitions, 502 flow [2025-02-08 05:40:21,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:21,029 INFO L231 Difference]: Finished difference. Result has 219 places, 212 transitions, 451 flow [2025-02-08 05:40:21,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=451, PETRI_PLACES=219, PETRI_TRANSITIONS=212} [2025-02-08 05:40:21,030 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -29 predicate places. [2025-02-08 05:40:21,030 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 212 transitions, 451 flow [2025-02-08 05:40:21,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 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,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,031 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,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:21,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:21,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1639980895, now seen corresponding path program 1 times [2025-02-08 05:40:21,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300713414] [2025-02-08 05:40:21,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:40:21,042 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,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,071 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,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300713414] [2025-02-08 05:40:21,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300713414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501858025] [2025-02-08 05:40:21,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 269 [2025-02-08 05:40:21,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 212 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 269 [2025-02-08 05:40:21,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,140 INFO L124 PetriNetUnfolderBase]: 18/266 cut-off events. [2025-02-08 05:40:21,140 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:21,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 266 events. 18/266 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 467 event pairs, 15 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 295. Up to 40 conditions per place. [2025-02-08 05:40:21,141 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 12 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2025-02-08 05:40:21,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 211 transitions, 477 flow [2025-02-08 05:40:21,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2025-02-08 05:40:21,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661710037174721 [2025-02-08 05:40:21,145 INFO L175 Difference]: Start difference. First operand has 219 places, 212 transitions, 451 flow. Second operand 3 states and 699 transitions. [2025-02-08 05:40:21,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 211 transitions, 477 flow [2025-02-08 05:40:21,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 211 transitions, 457 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:21,149 INFO L231 Difference]: Finished difference. Result has 215 places, 211 transitions, 433 flow [2025-02-08 05:40:21,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=215, PETRI_TRANSITIONS=211} [2025-02-08 05:40:21,149 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -33 predicate places. [2025-02-08 05:40:21,149 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 211 transitions, 433 flow [2025-02-08 05:40:21,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:21,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:21,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1114140983, now seen corresponding path program 1 times [2025-02-08 05:40:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319012543] [2025-02-08 05:40:21,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-08 05:40:21,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-08 05:40:21,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:21,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319012543] [2025-02-08 05:40:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319012543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73425634] [2025-02-08 05:40:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 269 [2025-02-08 05:40:21,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 211 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 269 [2025-02-08 05:40:21,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,285 INFO L124 PetriNetUnfolderBase]: 18/265 cut-off events. [2025-02-08 05:40:21,285 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:21,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 265 events. 18/265 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 462 event pairs, 15 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 280. Up to 40 conditions per place. [2025-02-08 05:40:21,286 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 12 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-02-08 05:40:21,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 210 transitions, 459 flow [2025-02-08 05:40:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2025-02-08 05:40:21,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661710037174721 [2025-02-08 05:40:21,288 INFO L175 Difference]: Start difference. First operand has 215 places, 211 transitions, 433 flow. Second operand 3 states and 699 transitions. [2025-02-08 05:40:21,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 210 transitions, 459 flow [2025-02-08 05:40:21,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 210 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:21,291 INFO L231 Difference]: Finished difference. Result has 214 places, 210 transitions, 431 flow [2025-02-08 05:40:21,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=214, PETRI_TRANSITIONS=210} [2025-02-08 05:40:21,292 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -34 predicate places. [2025-02-08 05:40:21,292 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 210 transitions, 431 flow [2025-02-08 05:40:21,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,293 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:21,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:21,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:21,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 184656771, now seen corresponding path program 1 times [2025-02-08 05:40:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-02-08 05:40:21,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 05:40:21,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 05:40:21,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,331 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,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920125160] [2025-02-08 05:40:21,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920125160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141713258] [2025-02-08 05:40:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 269 [2025-02-08 05:40:21,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 210 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 269 [2025-02-08 05:40:21,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,447 INFO L124 PetriNetUnfolderBase]: 74/453 cut-off events. [2025-02-08 05:40:21,447 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-02-08 05:40:21,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 453 events. 74/453 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1809 event pairs, 71 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 570. Up to 138 conditions per place. [2025-02-08 05:40:21,449 INFO L140 encePairwiseOnDemand]: 264/269 looper letters, 14 selfloop transitions, 1 changer transitions 3/206 dead transitions. [2025-02-08 05:40:21,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 206 transitions, 459 flow [2025-02-08 05:40:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2025-02-08 05:40:21,451 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8525402726146221 [2025-02-08 05:40:21,451 INFO L175 Difference]: Start difference. First operand has 214 places, 210 transitions, 431 flow. Second operand 3 states and 688 transitions. [2025-02-08 05:40:21,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 206 transitions, 459 flow [2025-02-08 05:40:21,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 206 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:21,455 INFO L231 Difference]: Finished difference. Result has 210 places, 203 transitions, 415 flow [2025-02-08 05:40:21,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=210, PETRI_TRANSITIONS=203} [2025-02-08 05:40:21,457 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -38 predicate places. [2025-02-08 05:40:21,457 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 203 transitions, 415 flow [2025-02-08 05:40:21,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,458 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:21,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:21,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:21,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -49752825, now seen corresponding path program 1 times [2025-02-08 05:40:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645514666] [2025-02-08 05:40:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 05:40:21,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 05:40:21,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,546 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,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645514666] [2025-02-08 05:40:21,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645514666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326080809] [2025-02-08 05:40:21,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 269 [2025-02-08 05:40:21,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 203 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 269 [2025-02-08 05:40:21,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,588 INFO L124 PetriNetUnfolderBase]: 3/202 cut-off events. [2025-02-08 05:40:21,588 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:40:21,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 202 events. 3/202 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 126 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 180. Up to 7 conditions per place. [2025-02-08 05:40:21,589 INFO L140 encePairwiseOnDemand]: 267/269 looper letters, 7 selfloop transitions, 1 changer transitions 3/202 dead transitions. [2025-02-08 05:40:21,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 202 transitions, 429 flow [2025-02-08 05:40:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-02-08 05:40:21,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8736059479553904 [2025-02-08 05:40:21,592 INFO L175 Difference]: Start difference. First operand has 210 places, 203 transitions, 415 flow. Second operand 3 states and 705 transitions. [2025-02-08 05:40:21,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 202 transitions, 429 flow [2025-02-08 05:40:21,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 202 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:21,596 INFO L231 Difference]: Finished difference. Result has 207 places, 199 transitions, 408 flow [2025-02-08 05:40:21,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=207, PETRI_TRANSITIONS=199} [2025-02-08 05:40:21,597 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -41 predicate places. [2025-02-08 05:40:21,598 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 199 transitions, 408 flow [2025-02-08 05:40:21,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,599 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] [2025-02-08 05:40:21,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:21,599 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:40:21,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1417254688, now seen corresponding path program 1 times [2025-02-08 05:40:21,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025943130] [2025-02-08 05:40:21,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 05:40:21,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 05:40:21,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,664 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,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025943130] [2025-02-08 05:40:21,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025943130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997441163] [2025-02-08 05:40:21,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 269 [2025-02-08 05:40:21,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 199 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 269 [2025-02-08 05:40:21,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,692 INFO L124 PetriNetUnfolderBase]: 3/198 cut-off events. [2025-02-08 05:40:21,693 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:40:21,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 198 events. 3/198 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 117 event pairs, 0 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 206. Up to 7 conditions per place. [2025-02-08 05:40:21,693 INFO L140 encePairwiseOnDemand]: 267/269 looper letters, 0 selfloop transitions, 0 changer transitions 198/198 dead transitions. [2025-02-08 05:40:21,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 198 transitions, 420 flow [2025-02-08 05:40:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2025-02-08 05:40:21,695 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.872366790582404 [2025-02-08 05:40:21,695 INFO L175 Difference]: Start difference. First operand has 207 places, 199 transitions, 408 flow. Second operand 3 states and 704 transitions. [2025-02-08 05:40:21,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 198 transitions, 420 flow [2025-02-08 05:40:21,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 198 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:21,697 INFO L231 Difference]: Finished difference. Result has 204 places, 0 transitions, 0 flow [2025-02-08 05:40:21,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=204, PETRI_TRANSITIONS=0} [2025-02-08 05:40:21,699 INFO L279 CegarLoopForPetriNet]: 248 programPoint places, -44 predicate places. [2025-02-08 05:40:21,699 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 0 transitions, 0 flow [2025-02-08 05:40:21,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2025-02-08 05:40:21,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-02-08 05:40:21,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-02-08 05:40:21,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-02-08 05:40:21,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-02-08 05:40:21,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-02-08 05:40:21,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining) [2025-02-08 05:40:21,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-02-08 05:40:21,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-02-08 05:40:21,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-02-08 05:40:21,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-02-08 05:40:21,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-02-08 05:40:21,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-02-08 05:40:21,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-02-08 05:40:21,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-02-08 05:40:21,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-02-08 05:40:21,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-02-08 05:40:21,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-02-08 05:40:21,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-02-08 05:40:21,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-02-08 05:40:21,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-02-08 05:40:21,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:21,706 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:21,711 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:21,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:21,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:21 BasicIcfg [2025-02-08 05:40:21,718 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:21,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:21,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:21,719 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:21,719 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:21,721 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:21,723 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:21,724 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:21,724 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:21,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-02-08 05:40:21,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:21,729 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:21,729 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:21,799 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:21,800 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:21,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:21,801 INFO L158 Benchmark]: Toolchain (without parser) took 3661.90ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 105.3MB in the beginning and 96.2MB in the end (delta: 9.2MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:21,801 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:21,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.66ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:40:21,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.80ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:21,801 INFO L158 Benchmark]: Boogie Preprocessor took 55.31ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:21,801 INFO L158 Benchmark]: IcfgBuilder took 852.95ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 89.2MB in the end (delta: -2.0MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:21,802 INFO L158 Benchmark]: TraceAbstraction took 2396.14ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 88.5MB in the beginning and 103.3MB in the end (delta: -14.9MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. [2025-02-08 05:40:21,802 INFO L158 Benchmark]: Witness Printer took 81.46ms. Allocated memory is still 310.4MB. Free memory was 103.3MB in the beginning and 96.2MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:21,803 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.40ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.66ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 92.8MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.80ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 89.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.31ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 852.95ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 89.2MB in the end (delta: -2.0MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2396.14ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 88.5MB in the beginning and 103.3MB in the end (delta: -14.9MB). Peak memory consumption was 159.3MB. Max. memory is 16.1GB. * Witness Printer took 81.46ms. Allocated memory is still 310.4MB. Free memory was 103.3MB in the beginning and 96.2MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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, 315 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 336 IncrementalHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 41 mSDtfsCounter, 336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=516occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 736 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:21,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE