./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --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/pthread-deagle/circular_buffer_bad.i -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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:41:29,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:41:29,109 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:41:29,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:41:29,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:41:29,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:41:29,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:41:29,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:41:29,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:41:29,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:41:29,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:41:29,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:41:29,133 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:41:29,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:41:29,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:41:29,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:41:29,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:41:29,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:29,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:41:29,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:41:29,136 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2025-02-08 05:41:29,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:41:29,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:41:29,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:41:29,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:41:29,406 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:41:29,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-08 05:41:30,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e34136000/4a67af79e09a4af9b47705bc709b696a/FLAG38a7b6f87 [2025-02-08 05:41:30,934 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:41:30,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2025-02-08 05:41:30,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e34136000/4a67af79e09a4af9b47705bc709b696a/FLAG38a7b6f87 [2025-02-08 05:41:31,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e34136000/4a67af79e09a4af9b47705bc709b696a [2025-02-08 05:41:31,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:41:31,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:41:31,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:31,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:41:31,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:41:31,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254aaa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31, skipping insertion in model container [2025-02-08 05:41:31,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:41:31,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:31,521 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:41:31,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:41:31,577 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:41:31,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31 WrapperNode [2025-02-08 05:41:31,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:41:31,578 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:31,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:41:31,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:41:31,583 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:41:31" (1/1) ... [2025-02-08 05:41:31,593 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:41:31" (1/1) ... [2025-02-08 05:41:31,609 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 228 [2025-02-08 05:41:31,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:41:31,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:41:31,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:41:31,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:41:31,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,639 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:41:31,642 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:41:31,642 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:41:31,642 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:41:31,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (1/1) ... [2025-02-08 05:41:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:41:31,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:41:31,673 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:41:31,676 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:41:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:41:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-08 05:41:31,696 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-08 05:41:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-08 05:41:31,696 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-08 05:41:31,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:41:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:41:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:41:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:41:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:41:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:41:31,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:41:31,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:41:31,698 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:41:31,802 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:41:31,804 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:41:32,007 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729: havoc #t~ret12#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-1: assume { :end_inline_insertLogElement } true;assume -2147483648 <= #t~ret12#1 && #t~ret12#1 <= 2147483647; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-2: havoc insertLogElement_#in~b#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-3: havoc insertLogElement_#t~short8#1, insertLogElement_#t~nondet9#1, insertLogElement_#t~nondet10#1, insertLogElement_~b#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-4: #t~ret12#1 := insertLogElement_#res#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume #race~send~0 == #t~nondet13#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume !(#race~send~0 == #t~nondet13#1); [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: havoc #t~nondet13#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: #race~send~0 := #t~nondet13#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-3: havoc #t~nondet13#1; [2025-02-08 05:41:32,008 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-4: ~send~0 := 0; [2025-02-08 05:41:32,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume #race~receive~0 == #t~nondet14#1; [2025-02-08 05:41:32,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: assume !(#race~receive~0 == #t~nondet14#1); [2025-02-08 05:41:32,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: havoc #t~nondet14#1; [2025-02-08 05:41:32,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: #race~receive~0 := #t~nondet14#1; [2025-02-08 05:41:32,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-3: havoc #t~nondet14#1; [2025-02-08 05:41:32,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-4: ~receive~0 := 1; [2025-02-08 05:41:32,082 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:41:32,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:41:32,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-2: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:41:32,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: assume #race~receive~0 == #t~nondet19#1; [2025-02-08 05:41:32,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747: assume !(#race~receive~0 == #t~nondet19#1); [2025-02-08 05:41:32,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-1: havoc #t~nondet19#1; [2025-02-08 05:41:32,083 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-2: #race~receive~0 := #t~nondet19#1; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume false; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681: assume !false; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-3: havoc #t~nondet19#1; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L681-1: assume false; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L747-4: ~receive~0 := 0; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc removeLogElement_#t~mem7#1; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume #race~send~0 == #t~nondet20#1; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748: assume !(#race~send~0 == #t~nondet20#1); [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-1: havoc #t~nondet20#1; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-2: #race~send~0 := #t~nondet20#1; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-3: havoc #t~nondet20#1; [2025-02-08 05:41:32,084 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L748-4: ~send~0 := 1; [2025-02-08 05:41:32,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume #t~ret18#1 == ~i~1#1; [2025-02-08 05:41:32,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745: assume !(#t~ret18#1 == ~i~1#1); [2025-02-08 05:41:32,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-1: havoc #t~ret18#1; [2025-02-08 05:41:32,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-2: havoc #t~ret18#1; [2025-02-08 05:41:32,086 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-3: assume { :end_inline_removeLogElement } true;assume -2147483648 <= #t~ret18#1 && #t~ret18#1 <= 2147483647; [2025-02-08 05:41:32,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-4: havoc removeLogElement_#t~short4#1, removeLogElement_#t~post5#1, removeLogElement_#t~nondet6#1, removeLogElement_#t~mem7#1; [2025-02-08 05:41:32,087 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L745-5: #t~ret18#1 := removeLogElement_#res#1; [2025-02-08 05:41:32,088 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:41:32,088 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:41:32,115 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:41:32,117 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:41:32,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:32 BoogieIcfgContainer [2025-02-08 05:41:32,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:41:32,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:41:32,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:41:32,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:41:32,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:41:31" (1/3) ... [2025-02-08 05:41:32,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3199ea7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:32, skipping insertion in model container [2025-02-08 05:41:32,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:41:31" (2/3) ... [2025-02-08 05:41:32,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3199ea7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:41:32, skipping insertion in model container [2025-02-08 05:41:32,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:32" (3/3) ... [2025-02-08 05:41:32,126 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2025-02-08 05:41:32,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:41:32,142 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_bad.i that has 3 procedures, 226 locations, 1 initial locations, 2 loop locations, and 29 error locations. [2025-02-08 05:41:32,143 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:41:32,219 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:41:32,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 232 places, 233 transitions, 480 flow [2025-02-08 05:41:32,361 INFO L124 PetriNetUnfolderBase]: 8/231 cut-off events. [2025-02-08 05:41:32,364 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:41:32,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 231 events. 8/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 165. Up to 2 conditions per place. [2025-02-08 05:41:32,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 233 transitions, 480 flow [2025-02-08 05:41:32,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 226 transitions, 461 flow [2025-02-08 05:41:32,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:41:32,397 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;@4e367023, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:41:32,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 05:41:32,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:41:32,406 INFO L124 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-02-08 05:41:32,406 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:41:32,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:32,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:32,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1804023102, now seen corresponding path program 1 times [2025-02-08 05:41:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595098236] [2025-02-08 05:41:32,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:32,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:41:32,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:41:32,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:32,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:32,595 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:41:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595098236] [2025-02-08 05:41:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595098236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:32,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:32,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:32,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769200704] [2025-02-08 05:41:32,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:32,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:32,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:32,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:32,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 233 [2025-02-08 05:41:32,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 226 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 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:41:32,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:32,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 233 [2025-02-08 05:41:32,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:32,743 INFO L124 PetriNetUnfolderBase]: 49/539 cut-off events. [2025-02-08 05:41:32,743 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 05:41:32,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 539 events. 49/539 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2492 event pairs, 27 based on Foata normal form. 10/448 useless extension candidates. Maximal degree in co-relation 524. Up to 79 conditions per place. [2025-02-08 05:41:32,748 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 16 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-02-08 05:41:32,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 221 transitions, 487 flow [2025-02-08 05:41:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2025-02-08 05:41:32,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313304721030042 [2025-02-08 05:41:32,759 INFO L175 Difference]: Start difference. First operand has 225 places, 226 transitions, 461 flow. Second operand 3 states and 651 transitions. [2025-02-08 05:41:32,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 221 transitions, 487 flow [2025-02-08 05:41:32,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 221 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:41:32,766 INFO L231 Difference]: Finished difference. Result has 221 places, 221 transitions, 450 flow [2025-02-08 05:41:32,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=221, PETRI_TRANSITIONS=221} [2025-02-08 05:41:32,770 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -4 predicate places. [2025-02-08 05:41:32,770 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 221 transitions, 450 flow [2025-02-08 05:41:32,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 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:41:32,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:32,771 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] [2025-02-08 05:41:32,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:41:32,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:32,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:32,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2083657882, now seen corresponding path program 1 times [2025-02-08 05:41:32,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:32,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966723365] [2025-02-08 05:41:32,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:41:32,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:41:32,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:32,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:32,831 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:41:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:32,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966723365] [2025-02-08 05:41:32,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966723365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:32,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:32,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520377087] [2025-02-08 05:41:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:32,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:32,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:32,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:32,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:32,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 233 [2025-02-08 05:41:32,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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:41:32,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:32,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 233 [2025-02-08 05:41:32,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:32,945 INFO L124 PetriNetUnfolderBase]: 53/542 cut-off events. [2025-02-08 05:41:32,945 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:41:32,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 542 events. 53/542 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2566 event pairs, 31 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 601. Up to 89 conditions per place. [2025-02-08 05:41:32,947 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 18 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-02-08 05:41:32,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 220 transitions, 488 flow [2025-02-08 05:41:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2025-02-08 05:41:32,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227467811158798 [2025-02-08 05:41:32,950 INFO L175 Difference]: Start difference. First operand has 221 places, 221 transitions, 450 flow. Second operand 3 states and 645 transitions. [2025-02-08 05:41:32,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 220 transitions, 488 flow [2025-02-08 05:41:32,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 220 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:32,953 INFO L231 Difference]: Finished difference. Result has 220 places, 220 transitions, 448 flow [2025-02-08 05:41:32,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=220, PETRI_TRANSITIONS=220} [2025-02-08 05:41:32,954 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -5 predicate places. [2025-02-08 05:41:32,954 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 220 transitions, 448 flow [2025-02-08 05:41:32,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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:41:32,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:32,955 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] [2025-02-08 05:41:32,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:41:32,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:32,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash -940449468, now seen corresponding path program 1 times [2025-02-08 05:41:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:32,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317264066] [2025-02-08 05:41:32,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:32,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:32,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:41:32,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:41:32,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:32,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,024 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:41:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317264066] [2025-02-08 05:41:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317264066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251406281] [2025-02-08 05:41:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 233 [2025-02-08 05:41:33,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 220 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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:41:33,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 233 [2025-02-08 05:41:33,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,161 INFO L124 PetriNetUnfolderBase]: 98/843 cut-off events. [2025-02-08 05:41:33,162 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:33,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 843 events. 98/843 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4951 event pairs, 54 based on Foata normal form. 0/697 useless extension candidates. Maximal degree in co-relation 969. Up to 144 conditions per place. [2025-02-08 05:41:33,167 INFO L140 encePairwiseOnDemand]: 222/233 looper letters, 23 selfloop transitions, 5 changer transitions 0/221 dead transitions. [2025-02-08 05:41:33,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 221 transitions, 508 flow [2025-02-08 05:41:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2025-02-08 05:41:33,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9155937052932761 [2025-02-08 05:41:33,171 INFO L175 Difference]: Start difference. First operand has 220 places, 220 transitions, 448 flow. Second operand 3 states and 640 transitions. [2025-02-08 05:41:33,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 221 transitions, 508 flow [2025-02-08 05:41:33,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 221 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:33,175 INFO L231 Difference]: Finished difference. Result has 217 places, 218 transitions, 468 flow [2025-02-08 05:41:33,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=217, PETRI_TRANSITIONS=218} [2025-02-08 05:41:33,177 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -8 predicate places. [2025-02-08 05:41:33,177 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 218 transitions, 468 flow [2025-02-08 05:41:33,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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:41:33,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,178 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] [2025-02-08 05:41:33,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:41:33,179 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash -827231478, now seen corresponding path program 1 times [2025-02-08 05:41:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948413246] [2025-02-08 05:41:33,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:41:33,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:41:33,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,271 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:41:33,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948413246] [2025-02-08 05:41:33,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948413246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138297882] [2025-02-08 05:41:33,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-02-08 05:41:33,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 218 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:41:33,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-02-08 05:41:33,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,394 INFO L124 PetriNetUnfolderBase]: 63/788 cut-off events. [2025-02-08 05:41:33,394 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-02-08 05:41:33,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 788 events. 63/788 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4127 event pairs, 24 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 756. Up to 76 conditions per place. [2025-02-08 05:41:33,398 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 15 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-02-08 05:41:33,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 217 transitions, 500 flow [2025-02-08 05:41:33,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2025-02-08 05:41:33,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9313304721030042 [2025-02-08 05:41:33,400 INFO L175 Difference]: Start difference. First operand has 217 places, 218 transitions, 468 flow. Second operand 3 states and 651 transitions. [2025-02-08 05:41:33,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 217 transitions, 500 flow [2025-02-08 05:41:33,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 217 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:33,403 INFO L231 Difference]: Finished difference. Result has 216 places, 217 transitions, 460 flow [2025-02-08 05:41:33,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=216, PETRI_TRANSITIONS=217} [2025-02-08 05:41:33,404 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -9 predicate places. [2025-02-08 05:41:33,404 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 217 transitions, 460 flow [2025-02-08 05:41:33,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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:41:33,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:33,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:41:33,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash 512019167, now seen corresponding path program 1 times [2025-02-08 05:41:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864646081] [2025-02-08 05:41:33,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:41:33,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:41:33,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,445 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:41:33,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864646081] [2025-02-08 05:41:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864646081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727871049] [2025-02-08 05:41:33,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-02-08 05:41:33,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 217 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:33,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-02-08 05:41:33,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,513 INFO L124 PetriNetUnfolderBase]: 38/527 cut-off events. [2025-02-08 05:41:33,513 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:33,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 527 events. 38/527 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2042 event pairs, 13 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 540. Up to 40 conditions per place. [2025-02-08 05:41:33,516 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 11 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-02-08 05:41:33,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 216 transitions, 484 flow [2025-02-08 05:41:33,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-02-08 05:41:33,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384835479256081 [2025-02-08 05:41:33,518 INFO L175 Difference]: Start difference. First operand has 216 places, 217 transitions, 460 flow. Second operand 3 states and 656 transitions. [2025-02-08 05:41:33,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 216 transitions, 484 flow [2025-02-08 05:41:33,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 216 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:33,522 INFO L231 Difference]: Finished difference. Result has 215 places, 216 transitions, 458 flow [2025-02-08 05:41:33,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=215, PETRI_TRANSITIONS=216} [2025-02-08 05:41:33,522 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -10 predicate places. [2025-02-08 05:41:33,523 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 216 transitions, 458 flow [2025-02-08 05:41:33,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:33,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:33,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:41:33,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1718937980, now seen corresponding path program 1 times [2025-02-08 05:41:33,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872974858] [2025-02-08 05:41:33,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:41:33,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:41:33,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:33,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872974858] [2025-02-08 05:41:33,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872974858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141491203] [2025-02-08 05:41:33,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-02-08 05:41:33,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 216 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:33,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-02-08 05:41:33,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,636 INFO L124 PetriNetUnfolderBase]: 42/595 cut-off events. [2025-02-08 05:41:33,636 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 05:41:33,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 595 events. 42/595 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2547 event pairs, 13 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 603. Up to 42 conditions per place. [2025-02-08 05:41:33,640 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 11 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2025-02-08 05:41:33,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 215 transitions, 482 flow [2025-02-08 05:41:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-02-08 05:41:33,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384835479256081 [2025-02-08 05:41:33,642 INFO L175 Difference]: Start difference. First operand has 215 places, 216 transitions, 458 flow. Second operand 3 states and 656 transitions. [2025-02-08 05:41:33,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 215 transitions, 482 flow [2025-02-08 05:41:33,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 215 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:33,645 INFO L231 Difference]: Finished difference. Result has 214 places, 215 transitions, 456 flow [2025-02-08 05:41:33,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=214, PETRI_TRANSITIONS=215} [2025-02-08 05:41:33,646 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -11 predicate places. [2025-02-08 05:41:33,646 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 215 transitions, 456 flow [2025-02-08 05:41:33,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:33,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,646 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] [2025-02-08 05:41:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:41:33,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash 175662807, now seen corresponding path program 1 times [2025-02-08 05:41:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455357272] [2025-02-08 05:41:33,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-08 05:41:33,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-08 05:41:33,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455357272] [2025-02-08 05:41:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455357272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840802584] [2025-02-08 05:41:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 233 [2025-02-08 05:41:33,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 215 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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:41:33,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 233 [2025-02-08 05:41:33,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,762 INFO L124 PetriNetUnfolderBase]: 43/543 cut-off events. [2025-02-08 05:41:33,762 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 05:41:33,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 543 events. 43/543 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2255 event pairs, 7 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 561. Up to 37 conditions per place. [2025-02-08 05:41:33,765 INFO L140 encePairwiseOnDemand]: 231/233 looper letters, 15 selfloop transitions, 1 changer transitions 0/220 dead transitions. [2025-02-08 05:41:33,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 220 transitions, 501 flow [2025-02-08 05:41:33,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2025-02-08 05:41:33,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9599427753934192 [2025-02-08 05:41:33,767 INFO L175 Difference]: Start difference. First operand has 214 places, 215 transitions, 456 flow. Second operand 3 states and 671 transitions. [2025-02-08 05:41:33,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 220 transitions, 501 flow [2025-02-08 05:41:33,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 497 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:33,770 INFO L231 Difference]: Finished difference. Result has 214 places, 215 transitions, 457 flow [2025-02-08 05:41:33,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=214, PETRI_TRANSITIONS=215} [2025-02-08 05:41:33,771 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -11 predicate places. [2025-02-08 05:41:33,771 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 215 transitions, 457 flow [2025-02-08 05:41:33,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 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:41:33,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,771 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] [2025-02-08 05:41:33,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:41:33,772 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1273539373, now seen corresponding path program 1 times [2025-02-08 05:41:33,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428136707] [2025-02-08 05:41:33,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-08 05:41:33,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-08 05:41:33,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,824 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:41:33,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428136707] [2025-02-08 05:41:33,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428136707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684421784] [2025-02-08 05:41:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:33,834 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 233 [2025-02-08 05:41:33,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 215 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:33,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:33,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 233 [2025-02-08 05:41:33,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:33,934 INFO L124 PetriNetUnfolderBase]: 64/763 cut-off events. [2025-02-08 05:41:33,935 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:33,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 763 events. 64/763 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4208 event pairs, 10 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 712. Up to 50 conditions per place. [2025-02-08 05:41:33,937 INFO L140 encePairwiseOnDemand]: 231/233 looper letters, 14 selfloop transitions, 1 changer transitions 0/219 dead transitions. [2025-02-08 05:41:33,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 219 transitions, 496 flow [2025-02-08 05:41:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2025-02-08 05:41:33,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585121602288984 [2025-02-08 05:41:33,939 INFO L175 Difference]: Start difference. First operand has 214 places, 215 transitions, 457 flow. Second operand 3 states and 670 transitions. [2025-02-08 05:41:33,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 219 transitions, 496 flow [2025-02-08 05:41:33,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 219 transitions, 496 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:33,942 INFO L231 Difference]: Finished difference. Result has 216 places, 215 transitions, 462 flow [2025-02-08 05:41:33,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=216, PETRI_TRANSITIONS=215} [2025-02-08 05:41:33,945 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -9 predicate places. [2025-02-08 05:41:33,945 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 215 transitions, 462 flow [2025-02-08 05:41:33,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:41:33,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:33,946 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] [2025-02-08 05:41:33,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:41:33,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:33,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash -137826165, now seen corresponding path program 1 times [2025-02-08 05:41:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:33,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200733106] [2025-02-08 05:41:33,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:33,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:33,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:41:33,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:41:33,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:33,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:41:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200733106] [2025-02-08 05:41:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200733106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973786081] [2025-02-08 05:41:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:33,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:33,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:33,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 233 [2025-02-08 05:41:34,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 215 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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:41:34,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 233 [2025-02-08 05:41:34,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,082 INFO L124 PetriNetUnfolderBase]: 115/987 cut-off events. [2025-02-08 05:41:34,083 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-08 05:41:34,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 987 events. 115/987 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6268 event pairs, 36 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1027. Up to 132 conditions per place. [2025-02-08 05:41:34,087 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 24 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2025-02-08 05:41:34,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 218 transitions, 523 flow [2025-02-08 05:41:34,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2025-02-08 05:41:34,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9284692417739628 [2025-02-08 05:41:34,088 INFO L175 Difference]: Start difference. First operand has 216 places, 215 transitions, 462 flow. Second operand 3 states and 649 transitions. [2025-02-08 05:41:34,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 218 transitions, 523 flow [2025-02-08 05:41:34,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 218 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:34,091 INFO L231 Difference]: Finished difference. Result has 214 places, 212 transitions, 466 flow [2025-02-08 05:41:34,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=214, PETRI_TRANSITIONS=212} [2025-02-08 05:41:34,092 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -11 predicate places. [2025-02-08 05:41:34,092 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 212 transitions, 466 flow [2025-02-08 05:41:34,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 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:41:34,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,092 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] [2025-02-08 05:41:34,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:41:34,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash -28930018, now seen corresponding path program 1 times [2025-02-08 05:41:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132604766] [2025-02-08 05:41:34,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 05:41:34,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 05:41:34,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,127 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:41:34,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132604766] [2025-02-08 05:41:34,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132604766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:34,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475005104] [2025-02-08 05:41:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-02-08 05:41:34,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 212 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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:41:34,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-02-08 05:41:34,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,214 INFO L124 PetriNetUnfolderBase]: 116/956 cut-off events. [2025-02-08 05:41:34,215 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-02-08 05:41:34,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 956 events. 116/956 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6148 event pairs, 31 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1068. Up to 124 conditions per place. [2025-02-08 05:41:34,219 INFO L140 encePairwiseOnDemand]: 226/233 looper letters, 15 selfloop transitions, 4 changer transitions 0/213 dead transitions. [2025-02-08 05:41:34,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 213 transitions, 507 flow [2025-02-08 05:41:34,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2025-02-08 05:41:34,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9370529327610873 [2025-02-08 05:41:34,220 INFO L175 Difference]: Start difference. First operand has 214 places, 212 transitions, 466 flow. Second operand 3 states and 655 transitions. [2025-02-08 05:41:34,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 213 transitions, 507 flow [2025-02-08 05:41:34,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 213 transitions, 507 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:41:34,223 INFO L231 Difference]: Finished difference. Result has 214 places, 210 transitions, 476 flow [2025-02-08 05:41:34,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=214, PETRI_TRANSITIONS=210} [2025-02-08 05:41:34,224 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -11 predicate places. [2025-02-08 05:41:34,224 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 210 transitions, 476 flow [2025-02-08 05:41:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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:41:34,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,225 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:34,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:41:34,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1495891467, now seen corresponding path program 1 times [2025-02-08 05:41:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972285294] [2025-02-08 05:41:34,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-08 05:41:34,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-08 05:41:34,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,267 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:41:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972285294] [2025-02-08 05:41:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972285294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:34,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018408002] [2025-02-08 05:41:34,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 233 [2025-02-08 05:41:34,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 210 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:34,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 233 [2025-02-08 05:41:34,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,338 INFO L124 PetriNetUnfolderBase]: 82/688 cut-off events. [2025-02-08 05:41:34,338 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:41:34,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 688 events. 82/688 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3503 event pairs, 48 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 770. Up to 110 conditions per place. [2025-02-08 05:41:34,342 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 17 selfloop transitions, 3 changer transitions 0/214 dead transitions. [2025-02-08 05:41:34,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 214 transitions, 526 flow [2025-02-08 05:41:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2025-02-08 05:41:34,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944206008583691 [2025-02-08 05:41:34,343 INFO L175 Difference]: Start difference. First operand has 214 places, 210 transitions, 476 flow. Second operand 3 states and 660 transitions. [2025-02-08 05:41:34,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 214 transitions, 526 flow [2025-02-08 05:41:34,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 214 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:41:34,346 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 490 flow [2025-02-08 05:41:34,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2025-02-08 05:41:34,347 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -8 predicate places. [2025-02-08 05:41:34,347 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 490 flow [2025-02-08 05:41:34,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:34,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,348 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:41:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:41:34,348 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -518022545, now seen corresponding path program 1 times [2025-02-08 05:41:34,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527008416] [2025-02-08 05:41:34,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:41:34,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:41:34,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,494 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:41:34,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527008416] [2025-02-08 05:41:34,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527008416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081911390] [2025-02-08 05:41:34,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 233 [2025-02-08 05:41:34,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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:41:34,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 233 [2025-02-08 05:41:34,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,614 INFO L124 PetriNetUnfolderBase]: 97/789 cut-off events. [2025-02-08 05:41:34,614 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 05:41:34,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 789 events. 97/789 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4455 event pairs, 52 based on Foata normal form. 0/713 useless extension candidates. Maximal degree in co-relation 1027. Up to 130 conditions per place. [2025-02-08 05:41:34,618 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 20 selfloop transitions, 4 changer transitions 0/217 dead transitions. [2025-02-08 05:41:34,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 217 transitions, 552 flow [2025-02-08 05:41:34,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2025-02-08 05:41:34,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9413447782546495 [2025-02-08 05:41:34,619 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 490 flow. Second operand 3 states and 658 transitions. [2025-02-08 05:41:34,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 217 transitions, 552 flow [2025-02-08 05:41:34,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:34,623 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 514 flow [2025-02-08 05:41:34,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2025-02-08 05:41:34,623 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -6 predicate places. [2025-02-08 05:41:34,623 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 514 flow [2025-02-08 05:41:34,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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:41:34,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,624 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:41:34,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:41:34,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1482666948, now seen corresponding path program 1 times [2025-02-08 05:41:34,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728886213] [2025-02-08 05:41:34,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:41:34,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:41:34,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,653 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:41:34,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728886213] [2025-02-08 05:41:34,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728886213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:34,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647421753] [2025-02-08 05:41:34,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 233 [2025-02-08 05:41:34,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:41:34,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 233 [2025-02-08 05:41:34,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,739 INFO L124 PetriNetUnfolderBase]: 114/993 cut-off events. [2025-02-08 05:41:34,739 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-02-08 05:41:34,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 993 events. 114/993 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6146 event pairs, 63 based on Foata normal form. 0/895 useless extension candidates. Maximal degree in co-relation 1225. Up to 153 conditions per place. [2025-02-08 05:41:34,744 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 16 selfloop transitions, 3 changer transitions 1/217 dead transitions. [2025-02-08 05:41:34,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 559 flow [2025-02-08 05:41:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 660 transitions. [2025-02-08 05:41:34,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.944206008583691 [2025-02-08 05:41:34,745 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 514 flow. Second operand 3 states and 660 transitions. [2025-02-08 05:41:34,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 559 flow [2025-02-08 05:41:34,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 543 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-02-08 05:41:34,749 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 512 flow [2025-02-08 05:41:34,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2025-02-08 05:41:34,750 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -6 predicate places. [2025-02-08 05:41:34,750 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 512 flow [2025-02-08 05:41:34,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 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:41:34,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:34,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:41:34,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash 97957532, now seen corresponding path program 1 times [2025-02-08 05:41:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627107831] [2025-02-08 05:41:34,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-08 05:41:34,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-08 05:41:34,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,783 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:41:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627107831] [2025-02-08 05:41:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627107831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956113027] [2025-02-08 05:41:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 233 [2025-02-08 05:41:34,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:34,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 233 [2025-02-08 05:41:34,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:34,894 INFO L124 PetriNetUnfolderBase]: 100/919 cut-off events. [2025-02-08 05:41:34,895 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-08 05:41:34,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 919 events. 100/919 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5422 event pairs, 53 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1225. Up to 128 conditions per place. [2025-02-08 05:41:34,899 INFO L140 encePairwiseOnDemand]: 230/233 looper letters, 17 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2025-02-08 05:41:34,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 216 transitions, 555 flow [2025-02-08 05:41:34,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-02-08 05:41:34,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384835479256081 [2025-02-08 05:41:34,901 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 512 flow. Second operand 3 states and 656 transitions. [2025-02-08 05:41:34,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 216 transitions, 555 flow [2025-02-08 05:41:34,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 216 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:34,904 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 508 flow [2025-02-08 05:41:34,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2025-02-08 05:41:34,905 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -7 predicate places. [2025-02-08 05:41:34,905 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 508 flow [2025-02-08 05:41:34,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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:41:34,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:34,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:34,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:41:34,905 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:34,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash -589861451, now seen corresponding path program 1 times [2025-02-08 05:41:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:34,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605005052] [2025-02-08 05:41:34,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:34,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:34,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 05:41:34,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 05:41:34,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:34,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:34,955 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:41:34,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:34,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605005052] [2025-02-08 05:41:34,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605005052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:34,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:34,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:34,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713773663] [2025-02-08 05:41:34,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:34,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:34,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:34,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:34,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 233 [2025-02-08 05:41:34,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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:41:34,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:34,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 233 [2025-02-08 05:41:34,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,054 INFO L124 PetriNetUnfolderBase]: 107/842 cut-off events. [2025-02-08 05:41:35,054 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-08 05:41:35,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 842 events. 107/842 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4635 event pairs, 60 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1093. Up to 152 conditions per place. [2025-02-08 05:41:35,058 INFO L140 encePairwiseOnDemand]: 228/233 looper letters, 24 selfloop transitions, 4 changer transitions 0/219 dead transitions. [2025-02-08 05:41:35,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 219 transitions, 580 flow [2025-02-08 05:41:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2025-02-08 05:41:35,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9356223175965666 [2025-02-08 05:41:35,060 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 508 flow. Second operand 3 states and 654 transitions. [2025-02-08 05:41:35,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 219 transitions, 580 flow [2025-02-08 05:41:35,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 219 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:35,064 INFO L231 Difference]: Finished difference. Result has 220 places, 216 transitions, 536 flow [2025-02-08 05:41:35,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=220, PETRI_TRANSITIONS=216} [2025-02-08 05:41:35,064 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -5 predicate places. [2025-02-08 05:41:35,064 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 216 transitions, 536 flow [2025-02-08 05:41:35,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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:41:35,065 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,065 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:35,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:41:35,065 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1523407852, now seen corresponding path program 1 times [2025-02-08 05:41:35,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914790097] [2025-02-08 05:41:35,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 05:41:35,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 05:41:35,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,166 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:41:35,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914790097] [2025-02-08 05:41:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914790097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:41:35,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063402339] [2025-02-08 05:41:35,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 233 [2025-02-08 05:41:35,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 216 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:41:35,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 233 [2025-02-08 05:41:35,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,287 INFO L124 PetriNetUnfolderBase]: 71/839 cut-off events. [2025-02-08 05:41:35,287 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 05:41:35,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 839 events. 71/839 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4547 event pairs, 30 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1010. Up to 81 conditions per place. [2025-02-08 05:41:35,291 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 16 selfloop transitions, 3 changer transitions 2/221 dead transitions. [2025-02-08 05:41:35,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 221 transitions, 591 flow [2025-02-08 05:41:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2025-02-08 05:41:35,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9484978540772532 [2025-02-08 05:41:35,293 INFO L175 Difference]: Start difference. First operand has 220 places, 216 transitions, 536 flow. Second operand 3 states and 663 transitions. [2025-02-08 05:41:35,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 221 transitions, 591 flow [2025-02-08 05:41:35,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:41:35,296 INFO L231 Difference]: Finished difference. Result has 222 places, 217 transitions, 550 flow [2025-02-08 05:41:35,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=222, PETRI_TRANSITIONS=217} [2025-02-08 05:41:35,297 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -3 predicate places. [2025-02-08 05:41:35,297 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 217 transitions, 550 flow [2025-02-08 05:41:35,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:41:35,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:41:35,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:35,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:41:35,298 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2025-02-08 05:41:35,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:41:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1969629686, now seen corresponding path program 1 times [2025-02-08 05:41:35,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:41:35,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525260228] [2025-02-08 05:41:35,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:41:35,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:41:35,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 05:41:35,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 05:41:35,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:41:35,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:41:35,416 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:41:35,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:41:35,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525260228] [2025-02-08 05:41:35,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525260228] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:41:35,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:41:35,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:41:35,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747846426] [2025-02-08 05:41:35,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:41:35,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:41:35,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:41:35,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:41:35,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:41:35,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 233 [2025-02-08 05:41:35,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 217 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:41:35,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:41:35,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 233 [2025-02-08 05:41:35,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:41:35,471 INFO L124 PetriNetUnfolderBase]: 23/489 cut-off events. [2025-02-08 05:41:35,471 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 05:41:35,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 489 events. 23/489 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2060 event pairs, 4 based on Foata normal form. 8/474 useless extension candidates. Maximal degree in co-relation 628. Up to 20 conditions per place. [2025-02-08 05:41:35,473 INFO L140 encePairwiseOnDemand]: 229/233 looper letters, 0 selfloop transitions, 0 changer transitions 203/203 dead transitions. [2025-02-08 05:41:35,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 203 transitions, 503 flow [2025-02-08 05:41:35,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:41:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:41:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2025-02-08 05:41:35,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9628040057224606 [2025-02-08 05:41:35,475 INFO L175 Difference]: Start difference. First operand has 222 places, 217 transitions, 550 flow. Second operand 3 states and 673 transitions. [2025-02-08 05:41:35,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 203 transitions, 503 flow [2025-02-08 05:41:35,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 203 transitions, 470 flow, removed 7 selfloop flow, removed 10 redundant places. [2025-02-08 05:41:35,477 INFO L231 Difference]: Finished difference. Result has 210 places, 0 transitions, 0 flow [2025-02-08 05:41:35,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=210, PETRI_TRANSITIONS=0} [2025-02-08 05:41:35,477 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -15 predicate places. [2025-02-08 05:41:35,477 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 0 transitions, 0 flow [2025-02-08 05:41:35,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-02-08 05:41:35,480 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-02-08 05:41:35,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-02-08 05:41:35,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-02-08 05:41:35,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-02-08 05:41:35,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-02-08 05:41:35,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-02-08 05:41:35,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-02-08 05:41:35,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-02-08 05:41:35,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-02-08 05:41:35,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-02-08 05:41:35,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:41:35,483 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:41:35,487 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:41:35,487 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:41:35,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:41:35 BasicIcfg [2025-02-08 05:41:35,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:41:35,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:41:35,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:41:35,491 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:41:35,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:41:32" (3/4) ... [2025-02-08 05:41:35,493 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:41:35,495 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-02-08 05:41:35,495 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-02-08 05:41:35,497 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-08 05:41:35,497 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:41:35,497 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:41:35,498 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:41:35,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:41:35,545 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:41:35,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:41:35,546 INFO L158 Benchmark]: Toolchain (without parser) took 4343.38ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 110.0MB in the beginning and 254.1MB in the end (delta: -144.1MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2025-02-08 05:41:35,546 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:35,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.40ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 88.9MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:41:35,546 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.22ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:41:35,547 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:35,547 INFO L158 Benchmark]: IcfgBuilder took 475.79ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 60.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:41:35,547 INFO L158 Benchmark]: TraceAbstraction took 3371.37ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 59.4MB in the beginning and 257.8MB in the end (delta: -198.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:35,547 INFO L158 Benchmark]: Witness Printer took 54.13ms. Allocated memory is still 327.2MB. Free memory was 257.8MB in the beginning and 254.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:41:35,548 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.20ms. Allocated memory is still 226.5MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.40ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 88.9MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.22ms. Allocated memory is still 142.6MB. Free memory was 88.9MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 142.6MB. Free memory was 86.7MB in the beginning and 84.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 475.79ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 60.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3371.37ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 59.4MB in the beginning and 257.8MB in the end (delta: -198.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 54.13ms. Allocated memory is still 327.2MB. Free memory was 257.8MB in the beginning and 254.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 690]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: 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 5 procedures, 358 locations, 46 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: 3.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 478 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 189 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 674 IncrementalHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 51 mSDtfsCounter, 674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=16, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1489 NumberOfCodeBlocks, 1489 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1472 ConstructedInterpolants, 0 QuantifiedInterpolants, 1661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:41:35,563 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