./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.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 cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:15,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:15,186 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:15,190 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:15,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:15,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:15,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:15,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:15,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:15,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:15,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:15,210 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:15,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:15,211 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:15,211 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:15,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:15,213 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:15,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:15,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:15,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:15,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:15,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:15,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:15,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:15,214 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 -> cd36b7f18dbd530fce94e0943ff58c16da276fcc41b96fdafde87c3c69036175 [2025-02-08 05:40:15,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:15,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:15,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:15,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:15,490 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:15,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-02-08 05:40:16,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21b9c7cc4/0347864e0c4e40939cec3150f5d958bf/FLAG694c8d92e [2025-02-08 05:40:17,085 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:17,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2025-02-08 05:40:17,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21b9c7cc4/0347864e0c4e40939cec3150f5d958bf/FLAG694c8d92e [2025-02-08 05:40:17,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21b9c7cc4/0347864e0c4e40939cec3150f5d958bf [2025-02-08 05:40:17,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:17,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:17,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:17,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:17,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:17,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65abf7d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17, skipping insertion in model container [2025-02-08 05:40:17,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:17,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:17,635 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:17,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:17,686 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:17,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17 WrapperNode [2025-02-08 05:40:17,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:17,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:17,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:17,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:17,695 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:17" (1/1) ... [2025-02-08 05:40:17,701 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:17" (1/1) ... [2025-02-08 05:40:17,733 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 248 [2025-02-08 05:40:17,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:17,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:17,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:17,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:17,749 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:17" (1/1) ... [2025-02-08 05:40:17,750 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:17" (1/1) ... [2025-02-08 05:40:17,756 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:17" (1/1) ... [2025-02-08 05:40:17,756 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:17" (1/1) ... [2025-02-08 05:40:17,772 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:17" (1/1) ... [2025-02-08 05:40:17,777 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:17" (1/1) ... [2025-02-08 05:40:17,779 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:17" (1/1) ... [2025-02-08 05:40:17,780 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:17" (1/1) ... [2025-02-08 05:40:17,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:17,788 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:17,791 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:17,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:17,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (1/1) ... [2025-02-08 05:40:17,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:17,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:17,838 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:17,841 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:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:17,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:17,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:17,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:17,871 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:17,984 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:17,986 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:18,127 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48: havoc #t~nondet3#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: assume #race~res1~0 == #t~nondet3#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-1: assume !(#race~res1~0 == #t~nondet3#1); [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-2: #race~res1~0 := #t~nondet3#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-3: havoc #t~nondet3#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L48-4: ~res1~0 := ~tmp~0#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-2: havoc #t~post4#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-3: ~i~0#1 := 1 + #t~post4#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-4: #t~post4#1 := ~i~0#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L46-5: havoc ~tmp~0#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47: havoc #t~ret2#1; [2025-02-08 05:40:18,128 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-1: havoc #t~mem1#1; [2025-02-08 05:40:18,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-2: ~tmp~0#1 := #t~ret2#1; [2025-02-08 05:40:18,129 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret2#1 && #t~ret2#1 <= 2147483647; [2025-02-08 05:40:18,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,130 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L47-6: #t~ret2#1 := plus_#res#1; [2025-02-08 05:40:18,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc #t~ret6#1; [2025-02-08 05:40:18,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-1: havoc #t~mem5#1; [2025-02-08 05:40:18,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-2: ~tmp~1#1 := #t~ret6#1; [2025-02-08 05:40:18,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret6#1 && #t~ret6#1 <= 2147483647; [2025-02-08 05:40:18,208 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56-6: #t~ret6#1 := plus_#res#1; [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57: [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L57-1: ~res2~0 := ~tmp~1#1; [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-2: havoc #t~post7#1; [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-3: ~i~1#1 := 1 + #t~post7#1; [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-4: #t~post7#1 := ~i~1#1; [2025-02-08 05:40:18,209 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L55-5: havoc ~tmp~1#1; [2025-02-08 05:40:18,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-2: havoc #t~post10#1; [2025-02-08 05:40:18,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-3: ~i~2#1 := 1 + #t~post10#1; [2025-02-08 05:40:18,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-4: #t~post10#1 := ~i~2#1; [2025-02-08 05:40:18,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L64-5: havoc ~tmp~2#1; [2025-02-08 05:40:18,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65: havoc #t~ret9#1; [2025-02-08 05:40:18,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-1: havoc #t~mem8#1; [2025-02-08 05:40:18,298 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-2: ~tmp~2#1 := #t~ret9#1; [2025-02-08 05:40:18,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-3: assume { :end_inline_plus } true;assume -2147483648 <= #t~ret9#1 && #t~ret9#1 <= 2147483647; [2025-02-08 05:40:18,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-4: havoc plus_#in~a#1, plus_#in~b#1; [2025-02-08 05:40:18,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-5: havoc plus_~a#1, plus_~b#1; [2025-02-08 05:40:18,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L65-6: #t~ret9#1 := plus_#res#1; [2025-02-08 05:40:18,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66: [2025-02-08 05:40:18,299 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L66-1: ~res2~0 := ~tmp~2#1; [2025-02-08 05:40:18,456 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:18,456 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:18,479 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:18,480 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:18,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:18 BoogieIcfgContainer [2025-02-08 05:40:18,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:18,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:18,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:18,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:18,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:17" (1/3) ... [2025-02-08 05:40:18,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e53267a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:18, skipping insertion in model container [2025-02-08 05:40:18,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:17" (2/3) ... [2025-02-08 05:40:18,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e53267a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:18, skipping insertion in model container [2025-02-08 05:40:18,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:18" (3/3) ... [2025-02-08 05:40:18,491 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2025-02-08 05:40:18,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:18,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt.wvr.c that has 4 procedures, 276 locations, 1 initial locations, 4 loop locations, and 21 error locations. [2025-02-08 05:40:18,508 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:18,631 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:40:18,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 290 transitions, 601 flow [2025-02-08 05:40:18,836 INFO L124 PetriNetUnfolderBase]: 15/287 cut-off events. [2025-02-08 05:40:18,838 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:18,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 287 events. 15/287 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 536 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 220. Up to 2 conditions per place. [2025-02-08 05:40:18,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 285 places, 290 transitions, 601 flow [2025-02-08 05:40:18,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 270 transitions, 558 flow [2025-02-08 05:40:18,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:18,890 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;@281ae7b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:18,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-02-08 05:40:18,898 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:18,899 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:40:18,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:18,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:18,900 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] [2025-02-08 05:40:18,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:18,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash 896625357, now seen corresponding path program 1 times [2025-02-08 05:40:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:18,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549598709] [2025-02-08 05:40:18,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:40:18,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:40:18,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:18,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,091 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,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549598709] [2025-02-08 05:40:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549598709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645114975] [2025-02-08 05:40:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 290 [2025-02-08 05:40:19,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 270 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 290 [2025-02-08 05:40:19,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,353 INFO L124 PetriNetUnfolderBase]: 9/504 cut-off events. [2025-02-08 05:40:19,353 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 05:40:19,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552 conditions, 504 events. 9/504 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1976 event pairs, 7 based on Foata normal form. 33/464 useless extension candidates. Maximal degree in co-relation 362. Up to 27 conditions per place. [2025-02-08 05:40:19,362 INFO L140 encePairwiseOnDemand]: 275/290 looper letters, 13 selfloop transitions, 2 changer transitions 3/257 dead transitions. [2025-02-08 05:40:19,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 257 transitions, 562 flow [2025-02-08 05:40:19,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2025-02-08 05:40:19,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252873563218391 [2025-02-08 05:40:19,383 INFO L175 Difference]: Start difference. First operand has 266 places, 270 transitions, 558 flow. Second operand 3 states and 805 transitions. [2025-02-08 05:40:19,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 257 transitions, 562 flow [2025-02-08 05:40:19,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 257 transitions, 550 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:40:19,399 INFO L231 Difference]: Finished difference. Result has 261 places, 254 transitions, 518 flow [2025-02-08 05:40:19,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=261, PETRI_TRANSITIONS=254} [2025-02-08 05:40:19,407 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -5 predicate places. [2025-02-08 05:40:19,407 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 254 transitions, 518 flow [2025-02-08 05:40:19,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,408 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] [2025-02-08 05:40:19,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:19,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash -779336281, now seen corresponding path program 1 times [2025-02-08 05:40:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288398124] [2025-02-08 05:40:19,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:40:19,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:40:19,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,480 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,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288398124] [2025-02-08 05:40:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288398124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419465313] [2025-02-08 05:40:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,527 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 290 [2025-02-08 05:40:19,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 290 [2025-02-08 05:40:19,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,621 INFO L124 PetriNetUnfolderBase]: 7/383 cut-off events. [2025-02-08 05:40:19,622 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:40:19,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 383 events. 7/383 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1322 event pairs, 5 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 388. Up to 24 conditions per place. [2025-02-08 05:40:19,625 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 13 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-02-08 05:40:19,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 253 transitions, 546 flow [2025-02-08 05:40:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2025-02-08 05:40:19,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9114942528735632 [2025-02-08 05:40:19,628 INFO L175 Difference]: Start difference. First operand has 261 places, 254 transitions, 518 flow. Second operand 3 states and 793 transitions. [2025-02-08 05:40:19,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 253 transitions, 546 flow [2025-02-08 05:40:19,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 253 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:19,634 INFO L231 Difference]: Finished difference. Result has 257 places, 253 transitions, 516 flow [2025-02-08 05:40:19,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=257, PETRI_TRANSITIONS=253} [2025-02-08 05:40:19,638 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -9 predicate places. [2025-02-08 05:40:19,639 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 253 transitions, 516 flow [2025-02-08 05:40:19,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,639 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] [2025-02-08 05:40:19,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:19,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:19,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,640 INFO L85 PathProgramCache]: Analyzing trace with hash 32987017, now seen corresponding path program 1 times [2025-02-08 05:40:19,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-02-08 05:40:19,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:40:19,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:40:19,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:19,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:19,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-02-08 05:40:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127436292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:19,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202983473] [2025-02-08 05:40:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:19,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:19,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:19,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:19,728 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 290 [2025-02-08 05:40:19,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 253 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 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,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:19,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 290 [2025-02-08 05:40:19,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:19,816 INFO L124 PetriNetUnfolderBase]: 14/492 cut-off events. [2025-02-08 05:40:19,816 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:40:19,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 492 events. 14/492 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2114 event pairs, 12 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 505. Up to 38 conditions per place. [2025-02-08 05:40:19,821 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 14 selfloop transitions, 1 changer transitions 0/249 dead transitions. [2025-02-08 05:40:19,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 249 transitions, 538 flow [2025-02-08 05:40:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2025-02-08 05:40:19,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-02-08 05:40:19,824 INFO L175 Difference]: Start difference. First operand has 257 places, 253 transitions, 516 flow. Second operand 3 states and 790 transitions. [2025-02-08 05:40:19,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 249 transitions, 538 flow [2025-02-08 05:40:19,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 249 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:19,829 INFO L231 Difference]: Finished difference. Result has 253 places, 249 transitions, 506 flow [2025-02-08 05:40:19,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=253, PETRI_TRANSITIONS=249} [2025-02-08 05:40:19,830 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -13 predicate places. [2025-02-08 05:40:19,830 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 249 transitions, 506 flow [2025-02-08 05:40:19,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 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,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:19,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:19,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:19,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:19,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:19,833 INFO L85 PathProgramCache]: Analyzing trace with hash 981401118, now seen corresponding path program 1 times [2025-02-08 05:40:19,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:19,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-02-08 05:40:19,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:19,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:19,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:40:19,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:40:19,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:19,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:20,551 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,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:20,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-02-08 05:40:20,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426235210] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:20,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:20,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335872842] [2025-02-08 05:40:20,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:20,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:20,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:20,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:20,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 290 [2025-02-08 05:40:20,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 249 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 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,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:20,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 290 [2025-02-08 05:40:20,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,046 INFO L124 PetriNetUnfolderBase]: 266/1915 cut-off events. [2025-02-08 05:40:21,047 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-08 05:40:21,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 1915 events. 266/1915 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 16019 event pairs, 264 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 2376. Up to 459 conditions per place. [2025-02-08 05:40:21,061 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 26 selfloop transitions, 5 changer transitions 0/248 dead transitions. [2025-02-08 05:40:21,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 248 transitions, 566 flow [2025-02-08 05:40:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1496 transitions. [2025-02-08 05:40:21,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8597701149425288 [2025-02-08 05:40:21,065 INFO L175 Difference]: Start difference. First operand has 253 places, 249 transitions, 506 flow. Second operand 6 states and 1496 transitions. [2025-02-08 05:40:21,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 248 transitions, 566 flow [2025-02-08 05:40:21,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 248 transitions, 565 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:21,070 INFO L231 Difference]: Finished difference. Result has 256 places, 248 transitions, 513 flow [2025-02-08 05:40:21,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=256, PETRI_TRANSITIONS=248} [2025-02-08 05:40:21,072 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -10 predicate places. [2025-02-08 05:40:21,072 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 248 transitions, 513 flow [2025-02-08 05:40:21,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 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,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:21,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:21,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:21,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash -606349901, now seen corresponding path program 1 times [2025-02-08 05:40:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239028447] [2025-02-08 05:40:21,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-08 05:40:21,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-08 05:40:21,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,132 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,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239028447] [2025-02-08 05:40:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239028447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625427004] [2025-02-08 05:40:21,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 290 [2025-02-08 05:40:21,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 248 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 290 [2025-02-08 05:40:21,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,235 INFO L124 PetriNetUnfolderBase]: 17/447 cut-off events. [2025-02-08 05:40:21,235 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:40:21,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 447 events. 17/447 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1821 event pairs, 15 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 486. Up to 40 conditions per place. [2025-02-08 05:40:21,239 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 12 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2025-02-08 05:40:21,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 247 transitions, 539 flow [2025-02-08 05:40:21,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2025-02-08 05:40:21,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9137931034482759 [2025-02-08 05:40:21,242 INFO L175 Difference]: Start difference. First operand has 256 places, 248 transitions, 513 flow. Second operand 3 states and 795 transitions. [2025-02-08 05:40:21,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 247 transitions, 539 flow [2025-02-08 05:40:21,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 247 transitions, 529 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:21,247 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 505 flow [2025-02-08 05:40:21,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2025-02-08 05:40:21,248 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -14 predicate places. [2025-02-08 05:40:21,249 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 505 flow [2025-02-08 05:40:21,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,250 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] [2025-02-08 05:40:21,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:21,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 983933758, now seen corresponding path program 1 times [2025-02-08 05:40:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837625440] [2025-02-08 05:40:21,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:40:21,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:40:21,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,309 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,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837625440] [2025-02-08 05:40:21,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837625440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923784749] [2025-02-08 05:40:21,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 290 [2025-02-08 05:40:21,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 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,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 290 [2025-02-08 05:40:21,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,412 INFO L124 PetriNetUnfolderBase]: 22/612 cut-off events. [2025-02-08 05:40:21,412 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:40:21,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 612 events. 22/612 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2990 event pairs, 20 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 636. Up to 50 conditions per place. [2025-02-08 05:40:21,419 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 14 selfloop transitions, 1 changer transitions 0/243 dead transitions. [2025-02-08 05:40:21,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 243 transitions, 527 flow [2025-02-08 05:40:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2025-02-08 05:40:21,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9080459770114943 [2025-02-08 05:40:21,422 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 505 flow. Second operand 3 states and 790 transitions. [2025-02-08 05:40:21,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 243 transitions, 527 flow [2025-02-08 05:40:21,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 243 transitions, 523 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:21,426 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 495 flow [2025-02-08 05:40:21,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=495, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2025-02-08 05:40:21,427 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -18 predicate places. [2025-02-08 05:40:21,428 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 495 flow [2025-02-08 05:40:21,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 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,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:21,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:21,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:21,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash -673662576, now seen corresponding path program 1 times [2025-02-08 05:40:21,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085167155] [2025-02-08 05:40:21,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 05:40:21,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 05:40:21,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,475 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,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085167155] [2025-02-08 05:40:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085167155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61517522] [2025-02-08 05:40:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 290 [2025-02-08 05:40:21,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 495 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 290 [2025-02-08 05:40:21,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,543 INFO L124 PetriNetUnfolderBase]: 6/309 cut-off events. [2025-02-08 05:40:21,544 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:40:21,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 309 events. 6/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 890 event pairs, 0 based on Foata normal form. 1/285 useless extension candidates. Maximal degree in co-relation 301. Up to 11 conditions per place. [2025-02-08 05:40:21,546 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 8 selfloop transitions, 1 changer transitions 2/243 dead transitions. [2025-02-08 05:40:21,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 243 transitions, 519 flow [2025-02-08 05:40:21,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2025-02-08 05:40:21,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9252873563218391 [2025-02-08 05:40:21,554 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 495 flow. Second operand 3 states and 805 transitions. [2025-02-08 05:40:21,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 243 transitions, 519 flow [2025-02-08 05:40:21,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:21,558 INFO L231 Difference]: Finished difference. Result has 247 places, 239 transitions, 487 flow [2025-02-08 05:40:21,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=247, PETRI_TRANSITIONS=239} [2025-02-08 05:40:21,560 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -19 predicate places. [2025-02-08 05:40:21,561 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 239 transitions, 487 flow [2025-02-08 05:40:21,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:21,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:21,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:21,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1150345489, now seen corresponding path program 1 times [2025-02-08 05:40:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-02-08 05:40:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 05:40:21,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 05:40:21,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:21,628 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,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:21,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071892848] [2025-02-08 05:40:21,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071892848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:21,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686752832] [2025-02-08 05:40:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:21,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:21,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:21,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:21,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 290 [2025-02-08 05:40:21,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 239 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:21,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 290 [2025-02-08 05:40:21,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:21,811 INFO L124 PetriNetUnfolderBase]: 58/1034 cut-off events. [2025-02-08 05:40:21,811 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:40:21,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 1034 events. 58/1034 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7143 event pairs, 22 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1124. Up to 102 conditions per place. [2025-02-08 05:40:21,821 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 16 selfloop transitions, 3 changer transitions 0/243 dead transitions. [2025-02-08 05:40:21,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 243 transitions, 537 flow [2025-02-08 05:40:21,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:21,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:21,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2025-02-08 05:40:21,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218390804597701 [2025-02-08 05:40:21,824 INFO L175 Difference]: Start difference. First operand has 247 places, 239 transitions, 487 flow. Second operand 3 states and 802 transitions. [2025-02-08 05:40:21,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 243 transitions, 537 flow [2025-02-08 05:40:21,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 243 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:21,832 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 501 flow [2025-02-08 05:40:21,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2025-02-08 05:40:21,835 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -22 predicate places. [2025-02-08 05:40:21,835 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 501 flow [2025-02-08 05:40:21,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:21,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:21,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:21,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:21,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1538156556, now seen corresponding path program 1 times [2025-02-08 05:40:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084699923] [2025-02-08 05:40:21,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:21,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-08 05:40:21,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 05:40:21,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:21,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:22,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084699923] [2025-02-08 05:40:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084699923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 05:40:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686889639] [2025-02-08 05:40:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 05:40:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 05:40:22,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:40:22,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 290 [2025-02-08 05:40:22,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 501 flow. Second operand has 7 states, 7 states have (on average 257.85714285714283) internal successors, (1805), 7 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 290 [2025-02-08 05:40:22,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,496 INFO L124 PetriNetUnfolderBase]: 22/847 cut-off events. [2025-02-08 05:40:22,496 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:40:22,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 960 conditions, 847 events. 22/847 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4684 event pairs, 7 based on Foata normal form. 3/783 useless extension candidates. Maximal degree in co-relation 921. Up to 27 conditions per place. [2025-02-08 05:40:22,502 INFO L140 encePairwiseOnDemand]: 277/290 looper letters, 19 selfloop transitions, 14 changer transitions 0/253 dead transitions. [2025-02-08 05:40:22,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 253 transitions, 602 flow [2025-02-08 05:40:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:40:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:40:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2594 transitions. [2025-02-08 05:40:22,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944827586206896 [2025-02-08 05:40:22,508 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 501 flow. Second operand 10 states and 2594 transitions. [2025-02-08 05:40:22,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 253 transitions, 602 flow [2025-02-08 05:40:22,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 253 transitions, 602 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:40:22,512 INFO L231 Difference]: Finished difference. Result has 257 places, 246 transitions, 567 flow [2025-02-08 05:40:22,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=567, PETRI_PLACES=257, PETRI_TRANSITIONS=246} [2025-02-08 05:40:22,513 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -9 predicate places. [2025-02-08 05:40:22,513 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 246 transitions, 567 flow [2025-02-08 05:40:22,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 257.85714285714283) internal successors, (1805), 7 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,514 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] [2025-02-08 05:40:22,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:22,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:22,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1487790521, now seen corresponding path program 1 times [2025-02-08 05:40:22,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191980674] [2025-02-08 05:40:22,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:40:22,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:40:22,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:22,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191980674] [2025-02-08 05:40:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191980674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33780627] [2025-02-08 05:40:22,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:22,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:40:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:22,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:40:22,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:40:22,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 290 [2025-02-08 05:40:22,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 246 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:22,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 290 [2025-02-08 05:40:22,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:22,816 INFO L124 PetriNetUnfolderBase]: 31/1050 cut-off events. [2025-02-08 05:40:22,816 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 05:40:22,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1050 events. 31/1050 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6514 event pairs, 17 based on Foata normal form. 6/980 useless extension candidates. Maximal degree in co-relation 1198. Up to 48 conditions per place. [2025-02-08 05:40:22,826 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 21 selfloop transitions, 5 changer transitions 0/256 dead transitions. [2025-02-08 05:40:22,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 256 transitions, 646 flow [2025-02-08 05:40:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:40:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:40:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1317 transitions. [2025-02-08 05:40:22,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9082758620689655 [2025-02-08 05:40:22,829 INFO L175 Difference]: Start difference. First operand has 257 places, 246 transitions, 567 flow. Second operand 5 states and 1317 transitions. [2025-02-08 05:40:22,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 256 transitions, 646 flow [2025-02-08 05:40:22,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 256 transitions, 642 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:22,834 INFO L231 Difference]: Finished difference. Result has 262 places, 248 transitions, 588 flow [2025-02-08 05:40:22,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=588, PETRI_PLACES=262, PETRI_TRANSITIONS=248} [2025-02-08 05:40:22,835 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -4 predicate places. [2025-02-08 05:40:22,835 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 248 transitions, 588 flow [2025-02-08 05:40:22,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:22,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:22,836 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] [2025-02-08 05:40:22,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:40:22,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:22,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:22,837 INFO L85 PathProgramCache]: Analyzing trace with hash 889783227, now seen corresponding path program 1 times [2025-02-08 05:40:22,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:22,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727269897] [2025-02-08 05:40:22,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:22,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:22,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:40:22,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:40:22,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:22,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727269897] [2025-02-08 05:40:23,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727269897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:23,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414438109] [2025-02-08 05:40:23,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:23,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:23,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:23,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 290 [2025-02-08 05:40:23,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 248 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:23,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 290 [2025-02-08 05:40:23,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:23,555 INFO L124 PetriNetUnfolderBase]: 47/1060 cut-off events. [2025-02-08 05:40:23,555 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-02-08 05:40:23,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1348 conditions, 1060 events. 47/1060 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6677 event pairs, 17 based on Foata normal form. 0/990 useless extension candidates. Maximal degree in co-relation 1301. Up to 72 conditions per place. [2025-02-08 05:40:23,568 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 24 selfloop transitions, 4 changer transitions 0/255 dead transitions. [2025-02-08 05:40:23,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 255 transitions, 666 flow [2025-02-08 05:40:23,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1563 transitions. [2025-02-08 05:40:23,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982758620689655 [2025-02-08 05:40:23,572 INFO L175 Difference]: Start difference. First operand has 262 places, 248 transitions, 588 flow. Second operand 6 states and 1563 transitions. [2025-02-08 05:40:23,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 255 transitions, 666 flow [2025-02-08 05:40:23,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 255 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:23,577 INFO L231 Difference]: Finished difference. Result has 264 places, 247 transitions, 589 flow [2025-02-08 05:40:23,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=264, PETRI_TRANSITIONS=247} [2025-02-08 05:40:23,578 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -2 predicate places. [2025-02-08 05:40:23,578 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 247 transitions, 589 flow [2025-02-08 05:40:23,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:23,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:23,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:23,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:40:23,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:23,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash 931131609, now seen corresponding path program 1 times [2025-02-08 05:40:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802137587] [2025-02-08 05:40:23,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:23,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-08 05:40:23,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-08 05:40:23,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:23,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802137587] [2025-02-08 05:40:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802137587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342406315] [2025-02-08 05:40:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:23,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:23,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:23,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:24,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 290 [2025-02-08 05:40:24,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 247 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 257.8333333333333) internal successors, (1547), 6 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 290 [2025-02-08 05:40:24,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,272 INFO L124 PetriNetUnfolderBase]: 74/1088 cut-off events. [2025-02-08 05:40:24,272 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-02-08 05:40:24,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1088 events. 74/1088 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7198 event pairs, 17 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1353. Up to 72 conditions per place. [2025-02-08 05:40:24,280 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 17 selfloop transitions, 4 changer transitions 11/254 dead transitions. [2025-02-08 05:40:24,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 254 transitions, 663 flow [2025-02-08 05:40:24,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1563 transitions. [2025-02-08 05:40:24,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982758620689655 [2025-02-08 05:40:24,285 INFO L175 Difference]: Start difference. First operand has 264 places, 247 transitions, 589 flow. Second operand 6 states and 1563 transitions. [2025-02-08 05:40:24,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 254 transitions, 663 flow [2025-02-08 05:40:24,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 254 transitions, 656 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:24,290 INFO L231 Difference]: Finished difference. Result has 264 places, 239 transitions, 553 flow [2025-02-08 05:40:24,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=553, PETRI_PLACES=264, PETRI_TRANSITIONS=239} [2025-02-08 05:40:24,291 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -2 predicate places. [2025-02-08 05:40:24,291 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 239 transitions, 553 flow [2025-02-08 05:40:24,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.8333333333333) internal successors, (1547), 6 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:24,292 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] [2025-02-08 05:40:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:40:24,293 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:40:24,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1101726798, now seen corresponding path program 1 times [2025-02-08 05:40:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:24,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194963956] [2025-02-08 05:40:24,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:24,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:40:24,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:40:24,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:24,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:40:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194963956] [2025-02-08 05:40:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194963956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299874532] [2025-02-08 05:40:24,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:24,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:24,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:24,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:24,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 290 [2025-02-08 05:40:24,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 239 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:24,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 290 [2025-02-08 05:40:24,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:24,962 INFO L124 PetriNetUnfolderBase]: 36/713 cut-off events. [2025-02-08 05:40:24,962 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:40:24,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 713 events. 36/713 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3736 event pairs, 9 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 901. Up to 39 conditions per place. [2025-02-08 05:40:24,967 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 0 selfloop transitions, 0 changer transitions 246/246 dead transitions. [2025-02-08 05:40:24,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 246 transitions, 625 flow [2025-02-08 05:40:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:24,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1562 transitions. [2025-02-08 05:40:24,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8977011494252873 [2025-02-08 05:40:24,971 INFO L175 Difference]: Start difference. First operand has 264 places, 239 transitions, 553 flow. Second operand 6 states and 1562 transitions. [2025-02-08 05:40:24,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 246 transitions, 625 flow [2025-02-08 05:40:24,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 246 transitions, 598 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-02-08 05:40:24,975 INFO L231 Difference]: Finished difference. Result has 253 places, 0 transitions, 0 flow [2025-02-08 05:40:24,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=253, PETRI_TRANSITIONS=0} [2025-02-08 05:40:24,976 INFO L279 CegarLoopForPetriNet]: 266 programPoint places, -13 predicate places. [2025-02-08 05:40:24,976 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 0 transitions, 0 flow [2025-02-08 05:40:24,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:40:24,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (33 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (26 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (24 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (23 of 34 remaining) [2025-02-08 05:40:24,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (22 of 34 remaining) [2025-02-08 05:40:24,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 34 remaining) [2025-02-08 05:40:24,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 34 remaining) [2025-02-08 05:40:24,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 34 remaining) [2025-02-08 05:40:24,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (18 of 34 remaining) [2025-02-08 05:40:24,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (9 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (8 of 34 remaining) [2025-02-08 05:40:24,982 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (7 of 34 remaining) [2025-02-08 05:40:24,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 34 remaining) [2025-02-08 05:40:24,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 34 remaining) [2025-02-08 05:40:24,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 34 remaining) [2025-02-08 05:40:24,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 34 remaining) [2025-02-08 05:40:24,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 34 remaining) [2025-02-08 05:40:24,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 34 remaining) [2025-02-08 05:40:24,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 34 remaining) [2025-02-08 05:40:24,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:40:24,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:24,989 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:24,989 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:24,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:24 BasicIcfg [2025-02-08 05:40:24,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:24,996 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:24,996 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:24,997 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:24,997 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:18" (3/4) ... [2025-02-08 05:40:24,998 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:25,001 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:25,001 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:25,001 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:25,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 05:40:25,006 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:25,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:25,007 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:25,087 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:25,088 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:25,088 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:25,090 INFO L158 Benchmark]: Toolchain (without parser) took 7684.09ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 106.4MB in the beginning and 130.0MB in the end (delta: -23.6MB). Peak memory consumption was 169.6MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,090 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 126.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:25,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.63ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.74ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,092 INFO L158 Benchmark]: Boogie Preprocessor took 48.69ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:25,093 INFO L158 Benchmark]: IcfgBuilder took 692.36ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 64.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,093 INFO L158 Benchmark]: TraceAbstraction took 6512.25ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 63.5MB in the beginning and 138.4MB in the end (delta: -74.9MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,094 INFO L158 Benchmark]: Witness Printer took 91.46ms. Allocated memory is still 335.5MB. Free memory was 138.4MB in the beginning and 130.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:25,095 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.27ms. Allocated memory is still 201.3MB. Free memory was 127.0MB in the beginning and 126.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.63ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 94.0MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.74ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.69ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 692.36ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 64.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6512.25ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 63.5MB in the beginning and 138.4MB in the end (delta: -74.9MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Witness Printer took 91.46ms. Allocated memory is still 335.5MB. Free memory was 138.4MB in the beginning and 130.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: 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, 408 locations, 34 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: 6.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 844 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 204 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1269 IncrementalHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 123 mSDtfsCounter, 1269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 980 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 967 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 1/1 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:25,113 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