./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 16:31:56,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 16:31:56,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 16:31:56,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 16:31:56,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 16:31:56,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 16:31:56,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 16:31:56,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 16:31:56,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 16:31:56,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 16:31:56,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 16:31:56,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 16:31:56,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 16:31:56,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 16:31:56,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 16:31:56,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 16:31:56,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 16:31:56,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 16:31:56,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 16:31:56,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 16:31:56,153 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 16:31:56,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 16:31:56,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 16:31:56,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 16:31:56,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 16:31:56,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 16:31:56,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 16:31:56,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 16:31:56,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 16:31:56,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 16:31:56,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 16:31:56,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 16:31:56,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 16:31:56,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 16:31:56,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 16:31:56,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 16:31:56,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 16:31:56,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 16:31:56,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 16:31:56,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 16:31:56,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 16:31:56,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 16:31:56,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-04-18 16:31:56,190 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 16:31:56,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 16:31:56,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 16:31:56,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 16:31:56,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 16:31:56,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 16:31:56,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-18 16:31:56,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-18 16:31:56,193 INFO L138 SettingsManager]: * Use SBE=true [2022-04-18 16:31:56,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 16:31:56,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 16:31:56,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 16:31:56,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 16:31:56,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 16:31:56,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 16:31:56,195 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 16:31:56,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 16:31:56,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 16:31:56,195 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 16:31:56,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 16:31:56,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 16:31:56,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 16:31:56,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 16:31:56,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 16:31:56,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-18 16:31:56,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 16:31:56,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:31:56,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 16:31:56,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 16:31:56,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 16:31:56,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-18 16:31:56,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 16:31:56,198 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-18 16:31:56,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-18 16:31:56,198 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 16:31:56,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 4c1c24b29e2a448aa58292c6eb9ff7da7a6479c4a0ee37fcfe55a998096eea30 [2022-04-18 16:31:56,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 16:31:56,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 16:31:56,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 16:31:56,379 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 16:31:56,380 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 16:31:56,381 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2022-04-18 16:31:56,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1a76651/055bbec7c10540ada1ac108cc5dee861/FLAG3cd62db5e [2022-04-18 16:31:56,795 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 16:31:56,802 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2022-04-18 16:31:56,825 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1a76651/055bbec7c10540ada1ac108cc5dee861/FLAG3cd62db5e [2022-04-18 16:31:56,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1a76651/055bbec7c10540ada1ac108cc5dee861 [2022-04-18 16:31:56,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 16:31:56,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 16:31:56,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 16:31:56,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 16:31:56,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 16:31:56,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:31:56" (1/1) ... [2022-04-18 16:31:56,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0f10f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:56, skipping insertion in model container [2022-04-18 16:31:56,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 04:31:56" (1/1) ... [2022-04-18 16:31:56,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 16:31:56,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 16:31:57,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-04-18 16:31:57,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:31:57,107 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 16:31:57,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c[2826,2839] [2022-04-18 16:31:57,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 16:31:57,142 INFO L208 MainTranslator]: Completed translation [2022-04-18 16:31:57,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57 WrapperNode [2022-04-18 16:31:57,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 16:31:57,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 16:31:57,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 16:31:57,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 16:31:57,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,161 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,189 INFO L137 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 271 [2022-04-18 16:31:57,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 16:31:57,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 16:31:57,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 16:31:57,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 16:31:57,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 16:31:57,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 16:31:57,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 16:31:57,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 16:31:57,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (1/1) ... [2022-04-18 16:31:57,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 16:31:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-18 16:31:57,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 16:31:57,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 16:31:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 16:31:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 16:31:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 16:31:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 16:31:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-04-18 16:31:57,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-04-18 16:31:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-04-18 16:31:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-04-18 16:31:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-04-18 16:31:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-04-18 16:31:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-04-18 16:31:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-04-18 16:31:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 16:31:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-04-18 16:31:57,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-04-18 16:31:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-04-18 16:31:57,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-04-18 16:31:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 16:31:57,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 16:31:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 16:31:57,297 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 16:31:57,412 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 16:31:57,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 16:31:57,769 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 16:31:57,790 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 16:31:57,790 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-18 16:31:57,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:31:57 BoogieIcfgContainer [2022-04-18 16:31:57,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 16:31:57,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 16:31:57,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 16:31:57,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 16:31:57,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 04:31:56" (1/3) ... [2022-04-18 16:31:57,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de53d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:31:57, skipping insertion in model container [2022-04-18 16:31:57,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 04:31:57" (2/3) ... [2022-04-18 16:31:57,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de53d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 04:31:57, skipping insertion in model container [2022-04-18 16:31:57,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:31:57" (3/3) ... [2022-04-18 16:31:57,802 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-04-18 16:31:57,805 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 16:31:57,805 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 16:31:57,805 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-04-18 16:31:57,806 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 16:31:57,883 INFO L135 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-04-18 16:31:57,921 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 16:31:57,928 INFO L340 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-04-18 16:31:57,928 INFO L341 AbstractCegarLoop]: Starting to check reachability of 103 error locations. [2022-04-18 16:31:57,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 458 places, 463 transitions, 974 flow [2022-04-18 16:31:58,057 INFO L129 PetriNetUnfolder]: 24/457 cut-off events. [2022-04-18 16:31:58,057 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-04-18 16:31:58,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 24/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 802 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 285. Up to 2 conditions per place. [2022-04-18 16:31:58,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 458 places, 463 transitions, 974 flow [2022-04-18 16:31:58,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 421 transitions, 878 flow [2022-04-18 16:31:58,081 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2022-04-18 16:31:58,081 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-04-18 16:31:58,082 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:31:58,082 INFO L255 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] [2022-04-18 16:31:58,083 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:31:58,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:31:58,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1336015694, now seen corresponding path program 1 times [2022-04-18 16:31:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:31:58,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217276081] [2022-04-18 16:31:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:31:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:31:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:31:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:31:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:31:58,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217276081] [2022-04-18 16:31:58,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217276081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:31:58,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:31:58,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:31:58,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131796910] [2022-04-18 16:31:58,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:31:58,291 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:31:58,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:31:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:31:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:31:58,321 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-04-18 16:31:58,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 421 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:58,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:31:58,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-04-18 16:31:58,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:31:58,502 INFO L129 PetriNetUnfolder]: 80/583 cut-off events. [2022-04-18 16:31:58,503 INFO L130 PetriNetUnfolder]: For 91/98 co-relation queries the response was YES. [2022-04-18 16:31:58,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 583 events. 80/583 cut-off events. For 91/98 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2299 event pairs, 60 based on Foata normal form. 211/668 useless extension candidates. Maximal degree in co-relation 614. Up to 157 conditions per place. [2022-04-18 16:31:58,514 INFO L132 encePairwiseOnDemand]: 453/463 looper letters, 36 selfloop transitions, 2 changer transitions 1/413 dead transitions. [2022-04-18 16:31:58,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 413 transitions, 938 flow [2022-04-18 16:31:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:31:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:31:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1291 transitions. [2022-04-18 16:31:58,529 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9294456443484521 [2022-04-18 16:31:58,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1291 transitions. [2022-04-18 16:31:58,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1291 transitions. [2022-04-18 16:31:58,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:31:58,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1291 transitions. [2022-04-18 16:31:58,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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) [2022-04-18 16:31:58,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:58,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:58,549 INFO L186 Difference]: Start difference. First operand has 418 places, 421 transitions, 878 flow. Second operand 3 states and 1291 transitions. [2022-04-18 16:31:58,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 413 transitions, 938 flow [2022-04-18 16:31:58,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 413 transitions, 914 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-04-18 16:31:58,564 INFO L242 Difference]: Finished difference. Result has 407 places, 412 transitions, 840 flow [2022-04-18 16:31:58,566 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=407, PETRI_TRANSITIONS=412} [2022-04-18 16:31:58,569 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -11 predicate places. [2022-04-18 16:31:58,569 INFO L478 AbstractCegarLoop]: Abstraction has has 407 places, 412 transitions, 840 flow [2022-04-18 16:31:58,570 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:58,570 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:31:58,570 INFO L255 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] [2022-04-18 16:31:58,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 16:31:58,571 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:31:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:31:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1730917584, now seen corresponding path program 1 times [2022-04-18 16:31:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:31:58,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499357670] [2022-04-18 16:31:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:31:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:31:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:31:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:31:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:31:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499357670] [2022-04-18 16:31:58,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499357670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:31:58,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:31:58,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:31:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112980647] [2022-04-18 16:31:58,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:31:58,649 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:31:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:31:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:31:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:31:58,652 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-04-18 16:31:58,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 412 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:58,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:31:58,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-04-18 16:31:58,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:31:58,759 INFO L129 PetriNetUnfolder]: 80/581 cut-off events. [2022-04-18 16:31:58,759 INFO L130 PetriNetUnfolder]: For 18/24 co-relation queries the response was YES. [2022-04-18 16:31:58,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 581 events. 80/581 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2277 event pairs, 60 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 761. Up to 157 conditions per place. [2022-04-18 16:31:58,784 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2022-04-18 16:31:58,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 411 transitions, 914 flow [2022-04-18 16:31:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:31:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:31:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-04-18 16:31:58,786 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-04-18 16:31:58,787 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-04-18 16:31:58,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-04-18 16:31:58,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:31:58,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-04-18 16:31:58,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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) [2022-04-18 16:31:58,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:58,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:58,792 INFO L186 Difference]: Start difference. First operand has 407 places, 412 transitions, 840 flow. Second operand 3 states and 1284 transitions. [2022-04-18 16:31:58,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 411 transitions, 914 flow [2022-04-18 16:31:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 411 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:31:58,798 INFO L242 Difference]: Finished difference. Result has 405 places, 411 transitions, 838 flow [2022-04-18 16:31:58,798 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=405, PETRI_TRANSITIONS=411} [2022-04-18 16:31:58,800 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -13 predicate places. [2022-04-18 16:31:58,800 INFO L478 AbstractCegarLoop]: Abstraction has has 405 places, 411 transitions, 838 flow [2022-04-18 16:31:58,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:58,801 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:31:58,801 INFO L255 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] [2022-04-18 16:31:58,801 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 16:31:58,801 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:31:58,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:31:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash 740256022, now seen corresponding path program 1 times [2022-04-18 16:31:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:31:58,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855863593] [2022-04-18 16:31:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:31:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:31:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:31:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:31:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:31:58,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855863593] [2022-04-18 16:31:58,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855863593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:31:58,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:31:58,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:31:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6277882] [2022-04-18 16:31:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:31:58,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:31:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:31:58,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:31:58,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:31:58,870 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-04-18 16:31:58,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 411 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:58,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:31:58,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-04-18 16:31:58,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:31:58,988 INFO L129 PetriNetUnfolder]: 80/580 cut-off events. [2022-04-18 16:31:58,989 INFO L130 PetriNetUnfolder]: For 30/36 co-relation queries the response was YES. [2022-04-18 16:31:58,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 580 events. 80/580 cut-off events. For 30/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2230 event pairs, 60 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 742. Up to 157 conditions per place. [2022-04-18 16:31:59,000 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-04-18 16:31:59,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 410 transitions, 912 flow [2022-04-18 16:31:59,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:31:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:31:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-04-18 16:31:59,003 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-04-18 16:31:59,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:31:59,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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) [2022-04-18 16:31:59,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,010 INFO L186 Difference]: Start difference. First operand has 405 places, 411 transitions, 838 flow. Second operand 3 states and 1284 transitions. [2022-04-18 16:31:59,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 410 transitions, 912 flow [2022-04-18 16:31:59,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 410 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:31:59,015 INFO L242 Difference]: Finished difference. Result has 404 places, 410 transitions, 836 flow [2022-04-18 16:31:59,016 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=404, PETRI_TRANSITIONS=410} [2022-04-18 16:31:59,018 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -14 predicate places. [2022-04-18 16:31:59,018 INFO L478 AbstractCegarLoop]: Abstraction has has 404 places, 410 transitions, 836 flow [2022-04-18 16:31:59,019 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:59,019 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:31:59,019 INFO L255 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] [2022-04-18 16:31:59,020 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-18 16:31:59,020 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:31:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:31:59,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1949606868, now seen corresponding path program 1 times [2022-04-18 16:31:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:31:59,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806243965] [2022-04-18 16:31:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:31:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:31:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:31:59,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:31:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:31:59,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806243965] [2022-04-18 16:31:59,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806243965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:31:59,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:31:59,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:31:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826768749] [2022-04-18 16:31:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:31:59,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:31:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:31:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:31:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:31:59,088 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-04-18 16:31:59,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 410 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:59,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:31:59,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-04-18 16:31:59,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:31:59,209 INFO L129 PetriNetUnfolder]: 80/579 cut-off events. [2022-04-18 16:31:59,210 INFO L130 PetriNetUnfolder]: For 42/48 co-relation queries the response was YES. [2022-04-18 16:31:59,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 579 events. 80/579 cut-off events. For 42/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2189 event pairs, 60 based on Foata normal form. 0/447 useless extension candidates. Maximal degree in co-relation 723. Up to 157 conditions per place. [2022-04-18 16:31:59,220 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2022-04-18 16:31:59,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 409 transitions, 910 flow [2022-04-18 16:31:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:31:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:31:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-04-18 16:31:59,226 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-04-18 16:31:59,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:31:59,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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) [2022-04-18 16:31:59,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,233 INFO L186 Difference]: Start difference. First operand has 404 places, 410 transitions, 836 flow. Second operand 3 states and 1284 transitions. [2022-04-18 16:31:59,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 409 transitions, 910 flow [2022-04-18 16:31:59,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 409 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:31:59,239 INFO L242 Difference]: Finished difference. Result has 403 places, 409 transitions, 834 flow [2022-04-18 16:31:59,239 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=403, PETRI_TRANSITIONS=409} [2022-04-18 16:31:59,241 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -15 predicate places. [2022-04-18 16:31:59,241 INFO L478 AbstractCegarLoop]: Abstraction has has 403 places, 409 transitions, 834 flow [2022-04-18 16:31:59,242 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:59,242 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:31:59,242 INFO L255 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] [2022-04-18 16:31:59,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-18 16:31:59,242 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:31:59,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:31:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1482091646, now seen corresponding path program 1 times [2022-04-18 16:31:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:31:59,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851693845] [2022-04-18 16:31:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:31:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:31:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:31:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:31:59,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:31:59,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851693845] [2022-04-18 16:31:59,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851693845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:31:59,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:31:59,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:31:59,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164746305] [2022-04-18 16:31:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:31:59,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:31:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:31:59,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:31:59,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:31:59,303 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-04-18 16:31:59,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 409 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:59,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:31:59,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-04-18 16:31:59,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:31:59,399 INFO L129 PetriNetUnfolder]: 80/578 cut-off events. [2022-04-18 16:31:59,400 INFO L130 PetriNetUnfolder]: For 54/60 co-relation queries the response was YES. [2022-04-18 16:31:59,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 578 events. 80/578 cut-off events. For 54/60 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2154 event pairs, 60 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 704. Up to 157 conditions per place. [2022-04-18 16:31:59,408 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 36 selfloop transitions, 2 changer transitions 0/408 dead transitions. [2022-04-18 16:31:59,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 408 transitions, 908 flow [2022-04-18 16:31:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:31:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:31:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-04-18 16:31:59,418 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9244060475161987 [2022-04-18 16:31:59,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:31:59,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1284 transitions. [2022-04-18 16:31:59,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 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) [2022-04-18 16:31:59,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,423 INFO L186 Difference]: Start difference. First operand has 403 places, 409 transitions, 834 flow. Second operand 3 states and 1284 transitions. [2022-04-18 16:31:59,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 408 transitions, 908 flow [2022-04-18 16:31:59,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 408 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:31:59,429 INFO L242 Difference]: Finished difference. Result has 402 places, 408 transitions, 832 flow [2022-04-18 16:31:59,429 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=402, PETRI_TRANSITIONS=408} [2022-04-18 16:31:59,430 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -16 predicate places. [2022-04-18 16:31:59,430 INFO L478 AbstractCegarLoop]: Abstraction has has 402 places, 408 transitions, 832 flow [2022-04-18 16:31:59,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:59,431 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:31:59,431 INFO L255 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] [2022-04-18 16:31:59,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 16:31:59,432 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:31:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:31:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1485355233, now seen corresponding path program 1 times [2022-04-18 16:31:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:31:59,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160115853] [2022-04-18 16:31:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:31:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:31:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:31:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:31:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:31:59,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160115853] [2022-04-18 16:31:59,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160115853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:31:59,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:31:59,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:31:59,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570666135] [2022-04-18 16:31:59,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:31:59,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:31:59,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:31:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:31:59,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:31:59,460 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 463 [2022-04-18 16:31:59,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 408 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:59,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:31:59,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 463 [2022-04-18 16:31:59,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:31:59,553 INFO L129 PetriNetUnfolder]: 80/577 cut-off events. [2022-04-18 16:31:59,553 INFO L130 PetriNetUnfolder]: For 66/72 co-relation queries the response was YES. [2022-04-18 16:31:59,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 577 events. 80/577 cut-off events. For 66/72 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2138 event pairs, 60 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 684. Up to 156 conditions per place. [2022-04-18 16:31:59,560 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 35 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2022-04-18 16:31:59,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 407 transitions, 904 flow [2022-04-18 16:31:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:31:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:31:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2022-04-18 16:31:59,563 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9236861051115911 [2022-04-18 16:31:59,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1283 transitions. [2022-04-18 16:31:59,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1283 transitions. [2022-04-18 16:31:59,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:31:59,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1283 transitions. [2022-04-18 16:31:59,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.6666666666667) internal successors, (1283), 3 states have internal predecessors, (1283), 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) [2022-04-18 16:31:59,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:31:59,568 INFO L186 Difference]: Start difference. First operand has 402 places, 408 transitions, 832 flow. Second operand 3 states and 1283 transitions. [2022-04-18 16:31:59,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 407 transitions, 904 flow [2022-04-18 16:31:59,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 407 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:31:59,574 INFO L242 Difference]: Finished difference. Result has 401 places, 407 transitions, 830 flow [2022-04-18 16:31:59,575 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=401, PETRI_TRANSITIONS=407} [2022-04-18 16:31:59,575 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -17 predicate places. [2022-04-18 16:31:59,575 INFO L478 AbstractCegarLoop]: Abstraction has has 401 places, 407 transitions, 830 flow [2022-04-18 16:31:59,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 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) [2022-04-18 16:31:59,576 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:31:59,576 INFO L255 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] [2022-04-18 16:31:59,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 16:31:59,577 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:31:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:31:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1143953655, now seen corresponding path program 1 times [2022-04-18 16:31:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:31:59,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424636000] [2022-04-18 16:31:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:31:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:31:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:31:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:31:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:31:59,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424636000] [2022-04-18 16:31:59,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424636000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:31:59,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:31:59,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:31:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304859634] [2022-04-18 16:31:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:31:59,609 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:31:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:31:59,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:31:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:31:59,611 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-04-18 16:31:59,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 407 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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) [2022-04-18 16:31:59,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:31:59,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-04-18 16:31:59,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:07,483 INFO L129 PetriNetUnfolder]: 26740/76416 cut-off events. [2022-04-18 16:32:07,483 INFO L130 PetriNetUnfolder]: For 1365/1736 co-relation queries the response was YES. [2022-04-18 16:32:08,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108529 conditions, 76416 events. 26740/76416 cut-off events. For 1365/1736 co-relation queries the response was YES. Maximal size of possible extension queue 3869. Compared 1070045 event pairs, 23895 based on Foata normal form. 0/55614 useless extension candidates. Maximal degree in co-relation 108462. Up to 30742 conditions per place. [2022-04-18 16:32:08,905 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 51 selfloop transitions, 2 changer transitions 0/406 dead transitions. [2022-04-18 16:32:08,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 406 transitions, 934 flow [2022-04-18 16:32:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2022-04-18 16:32:08,911 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9028077753779697 [2022-04-18 16:32:08,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2022-04-18 16:32:08,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2022-04-18 16:32:08,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:08,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2022-04-18 16:32:08,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 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) [2022-04-18 16:32:08,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:08,919 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:08,919 INFO L186 Difference]: Start difference. First operand has 401 places, 407 transitions, 830 flow. Second operand 3 states and 1254 transitions. [2022-04-18 16:32:08,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 406 transitions, 934 flow [2022-04-18 16:32:08,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 406 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:08,925 INFO L242 Difference]: Finished difference. Result has 400 places, 406 transitions, 828 flow [2022-04-18 16:32:08,926 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=400, PETRI_TRANSITIONS=406} [2022-04-18 16:32:08,927 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -18 predicate places. [2022-04-18 16:32:08,927 INFO L478 AbstractCegarLoop]: Abstraction has has 400 places, 406 transitions, 828 flow [2022-04-18 16:32:08,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.3333333333333) internal successors, (1204), 3 states have internal predecessors, (1204), 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) [2022-04-18 16:32:08,928 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:08,928 INFO L255 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] [2022-04-18 16:32:08,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 16:32:08,928 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2022394243, now seen corresponding path program 1 times [2022-04-18 16:32:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:08,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187133978] [2022-04-18 16:32:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:08,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:08,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187133978] [2022-04-18 16:32:08,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187133978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:08,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:08,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:08,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095131939] [2022-04-18 16:32:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:08,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:08,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:08,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:08,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:08,987 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-04-18 16:32:08,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 406 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:08,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:08,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-04-18 16:32:08,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:09,064 INFO L129 PetriNetUnfolder]: 65/546 cut-off events. [2022-04-18 16:32:09,064 INFO L130 PetriNetUnfolder]: For 6/11 co-relation queries the response was YES. [2022-04-18 16:32:09,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 546 events. 65/546 cut-off events. For 6/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1940 event pairs, 30 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 653. Up to 90 conditions per place. [2022-04-18 16:32:09,074 INFO L132 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/406 dead transitions. [2022-04-18 16:32:09,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 406 transitions, 903 flow [2022-04-18 16:32:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-04-18 16:32:09,079 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-04-18 16:32:09,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-04-18 16:32:09,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-04-18 16:32:09,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:09,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-04-18 16:32:09,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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) [2022-04-18 16:32:09,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,088 INFO L186 Difference]: Start difference. First operand has 400 places, 406 transitions, 828 flow. Second operand 3 states and 1295 transitions. [2022-04-18 16:32:09,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 406 transitions, 903 flow [2022-04-18 16:32:09,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 406 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:09,094 INFO L242 Difference]: Finished difference. Result has 395 places, 401 transitions, 825 flow [2022-04-18 16:32:09,095 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=395, PETRI_TRANSITIONS=401} [2022-04-18 16:32:09,098 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -23 predicate places. [2022-04-18 16:32:09,098 INFO L478 AbstractCegarLoop]: Abstraction has has 395 places, 401 transitions, 825 flow [2022-04-18 16:32:09,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,099 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:09,099 INFO L255 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] [2022-04-18 16:32:09,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 16:32:09,099 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:09,099 INFO L85 PathProgramCache]: Analyzing trace with hash 2099345529, now seen corresponding path program 1 times [2022-04-18 16:32:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:09,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137040327] [2022-04-18 16:32:09,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:09,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:09,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137040327] [2022-04-18 16:32:09,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137040327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:09,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:09,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:09,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736027243] [2022-04-18 16:32:09,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:09,134 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:09,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:09,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:09,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:09,135 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-04-18 16:32:09,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 401 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:09,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-04-18 16:32:09,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:09,202 INFO L129 PetriNetUnfolder]: 65/541 cut-off events. [2022-04-18 16:32:09,202 INFO L130 PetriNetUnfolder]: For 16/20 co-relation queries the response was YES. [2022-04-18 16:32:09,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 541 events. 65/541 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1949 event pairs, 30 based on Foata normal form. 0/451 useless extension candidates. Maximal degree in co-relation 634. Up to 90 conditions per place. [2022-04-18 16:32:09,208 INFO L132 encePairwiseOnDemand]: 454/463 looper letters, 32 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2022-04-18 16:32:09,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 401 transitions, 900 flow [2022-04-18 16:32:09,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-04-18 16:32:09,211 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9323254139668826 [2022-04-18 16:32:09,211 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-04-18 16:32:09,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-04-18 16:32:09,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:09,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-04-18 16:32:09,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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) [2022-04-18 16:32:09,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,216 INFO L186 Difference]: Start difference. First operand has 395 places, 401 transitions, 825 flow. Second operand 3 states and 1295 transitions. [2022-04-18 16:32:09,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 401 transitions, 900 flow [2022-04-18 16:32:09,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 401 transitions, 897 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:32:09,222 INFO L242 Difference]: Finished difference. Result has 391 places, 396 transitions, 823 flow [2022-04-18 16:32:09,222 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=391, PETRI_TRANSITIONS=396} [2022-04-18 16:32:09,223 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -27 predicate places. [2022-04-18 16:32:09,223 INFO L478 AbstractCegarLoop]: Abstraction has has 391 places, 396 transitions, 823 flow [2022-04-18 16:32:09,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,224 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:09,224 INFO L255 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] [2022-04-18 16:32:09,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 16:32:09,225 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1479418596, now seen corresponding path program 1 times [2022-04-18 16:32:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:09,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204560035] [2022-04-18 16:32:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:09,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:09,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:09,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:09,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204560035] [2022-04-18 16:32:09,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204560035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:09,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:09,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394349543] [2022-04-18 16:32:09,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:09,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:09,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:09,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:09,247 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-04-18 16:32:09,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 396 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:09,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-04-18 16:32:09,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:09,470 INFO L129 PetriNetUnfolder]: 81/896 cut-off events. [2022-04-18 16:32:09,470 INFO L130 PetriNetUnfolder]: For 28/32 co-relation queries the response was YES. [2022-04-18 16:32:09,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 896 events. 81/896 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4429 event pairs, 33 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 994. Up to 90 conditions per place. [2022-04-18 16:32:09,481 INFO L132 encePairwiseOnDemand]: 454/463 looper letters, 35 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2022-04-18 16:32:09,482 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 399 transitions, 913 flow [2022-04-18 16:32:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2022-04-18 16:32:09,484 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9344852411807055 [2022-04-18 16:32:09,484 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1298 transitions. [2022-04-18 16:32:09,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1298 transitions. [2022-04-18 16:32:09,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:09,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1298 transitions. [2022-04-18 16:32:09,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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) [2022-04-18 16:32:09,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,489 INFO L186 Difference]: Start difference. First operand has 391 places, 396 transitions, 823 flow. Second operand 3 states and 1298 transitions. [2022-04-18 16:32:09,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 399 transitions, 913 flow [2022-04-18 16:32:09,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 399 transitions, 910 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:32:09,495 INFO L242 Difference]: Finished difference. Result has 387 places, 391 transitions, 821 flow [2022-04-18 16:32:09,495 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=387, PETRI_TRANSITIONS=391} [2022-04-18 16:32:09,496 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -31 predicate places. [2022-04-18 16:32:09,496 INFO L478 AbstractCegarLoop]: Abstraction has has 387 places, 391 transitions, 821 flow [2022-04-18 16:32:09,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,496 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:09,496 INFO L255 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] [2022-04-18 16:32:09,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 16:32:09,497 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:09,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash -91411477, now seen corresponding path program 1 times [2022-04-18 16:32:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:09,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770010147] [2022-04-18 16:32:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:09,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:09,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770010147] [2022-04-18 16:32:09,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770010147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:09,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:09,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691420974] [2022-04-18 16:32:09,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:09,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:09,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:09,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:09,529 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-04-18 16:32:09,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 391 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:09,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-04-18 16:32:09,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:09,690 INFO L129 PetriNetUnfolder]: 119/1144 cut-off events. [2022-04-18 16:32:09,690 INFO L130 PetriNetUnfolder]: For 70/74 co-relation queries the response was YES. [2022-04-18 16:32:09,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 1144 events. 119/1144 cut-off events. For 70/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6622 event pairs, 24 based on Foata normal form. 1/976 useless extension candidates. Maximal degree in co-relation 912. Up to 146 conditions per place. [2022-04-18 16:32:09,707 INFO L132 encePairwiseOnDemand]: 454/463 looper letters, 37 selfloop transitions, 3 changer transitions 0/396 dead transitions. [2022-04-18 16:32:09,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 396 transitions, 921 flow [2022-04-18 16:32:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-04-18 16:32:09,710 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-04-18 16:32:09,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-04-18 16:32:09,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-04-18 16:32:09,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:09,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-04-18 16:32:09,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:32:09,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:09,715 INFO L186 Difference]: Start difference. First operand has 387 places, 391 transitions, 821 flow. Second operand 3 states and 1300 transitions. [2022-04-18 16:32:09,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 396 transitions, 921 flow [2022-04-18 16:32:09,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 396 transitions, 918 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:32:09,720 INFO L242 Difference]: Finished difference. Result has 383 places, 386 transitions, 819 flow [2022-04-18 16:32:09,721 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=819, PETRI_PLACES=383, PETRI_TRANSITIONS=386} [2022-04-18 16:32:09,721 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -35 predicate places. [2022-04-18 16:32:09,721 INFO L478 AbstractCegarLoop]: Abstraction has has 383 places, 386 transitions, 819 flow [2022-04-18 16:32:09,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,722 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:09,722 INFO L255 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] [2022-04-18 16:32:09,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 16:32:09,722 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -87068456, now seen corresponding path program 1 times [2022-04-18 16:32:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:09,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230011157] [2022-04-18 16:32:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:09,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:09,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:09,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:09,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230011157] [2022-04-18 16:32:09,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230011157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:09,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:09,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:09,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320968728] [2022-04-18 16:32:09,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:09,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:09,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:09,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:09,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:09,745 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-04-18 16:32:09,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 386 transitions, 819 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:09,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:09,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-04-18 16:32:09,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:10,008 INFO L129 PetriNetUnfolder]: 239/1831 cut-off events. [2022-04-18 16:32:10,009 INFO L130 PetriNetUnfolder]: For 127/135 co-relation queries the response was YES. [2022-04-18 16:32:10,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 1831 events. 239/1831 cut-off events. For 127/135 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 13012 event pairs, 126 based on Foata normal form. 0/1510 useless extension candidates. Maximal degree in co-relation 1662. Up to 292 conditions per place. [2022-04-18 16:32:10,048 INFO L132 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 0/390 dead transitions. [2022-04-18 16:32:10,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 390 transitions, 914 flow [2022-04-18 16:32:10,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-04-18 16:32:10,051 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9352051835853131 [2022-04-18 16:32:10,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-04-18 16:32:10,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-04-18 16:32:10,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:10,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-04-18 16:32:10,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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) [2022-04-18 16:32:10,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:10,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:10,056 INFO L186 Difference]: Start difference. First operand has 383 places, 386 transitions, 819 flow. Second operand 3 states and 1299 transitions. [2022-04-18 16:32:10,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 390 transitions, 914 flow [2022-04-18 16:32:10,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 390 transitions, 911 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:32:10,062 INFO L242 Difference]: Finished difference. Result has 379 places, 381 transitions, 817 flow [2022-04-18 16:32:10,063 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=379, PETRI_TRANSITIONS=381} [2022-04-18 16:32:10,063 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -39 predicate places. [2022-04-18 16:32:10,063 INFO L478 AbstractCegarLoop]: Abstraction has has 379 places, 381 transitions, 817 flow [2022-04-18 16:32:10,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:10,064 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:10,064 INFO L255 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] [2022-04-18 16:32:10,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-18 16:32:10,064 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1947059132, now seen corresponding path program 1 times [2022-04-18 16:32:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:10,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369855258] [2022-04-18 16:32:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:10,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:10,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369855258] [2022-04-18 16:32:10,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369855258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:10,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:10,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240758952] [2022-04-18 16:32:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:10,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:10,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:10,087 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 418 out of 463 [2022-04-18 16:32:10,088 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 381 transitions, 817 flow. Second operand has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:10,088 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:10,088 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 418 of 463 [2022-04-18 16:32:10,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:10,336 INFO L129 PetriNetUnfolder]: 205/1762 cut-off events. [2022-04-18 16:32:10,336 INFO L130 PetriNetUnfolder]: For 185/189 co-relation queries the response was YES. [2022-04-18 16:32:10,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2253 conditions, 1762 events. 205/1762 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11796 event pairs, 104 based on Foata normal form. 1/1499 useless extension candidates. Maximal degree in co-relation 1039. Up to 261 conditions per place. [2022-04-18 16:32:10,362 INFO L132 encePairwiseOnDemand]: 454/463 looper letters, 36 selfloop transitions, 3 changer transitions 8/387 dead transitions. [2022-04-18 16:32:10,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 387 transitions, 920 flow [2022-04-18 16:32:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2022-04-18 16:32:10,365 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9359251259899208 [2022-04-18 16:32:10,365 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1300 transitions. [2022-04-18 16:32:10,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1300 transitions. [2022-04-18 16:32:10,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:10,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1300 transitions. [2022-04-18 16:32:10,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.3333333333333) internal successors, (1300), 3 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 16:32:10,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:10,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:10,370 INFO L186 Difference]: Start difference. First operand has 379 places, 381 transitions, 817 flow. Second operand 3 states and 1300 transitions. [2022-04-18 16:32:10,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 387 transitions, 920 flow [2022-04-18 16:32:10,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 387 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:32:10,375 INFO L242 Difference]: Finished difference. Result has 375 places, 368 transitions, 799 flow [2022-04-18 16:32:10,375 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=375, PETRI_TRANSITIONS=368} [2022-04-18 16:32:10,376 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -43 predicate places. [2022-04-18 16:32:10,376 INFO L478 AbstractCegarLoop]: Abstraction has has 375 places, 368 transitions, 799 flow [2022-04-18 16:32:10,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 419.3333333333333) internal successors, (1258), 3 states have internal predecessors, (1258), 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) [2022-04-18 16:32:10,376 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:10,376 INFO L255 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] [2022-04-18 16:32:10,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 16:32:10,377 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash 427726989, now seen corresponding path program 1 times [2022-04-18 16:32:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:10,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072427537] [2022-04-18 16:32:10,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:10,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:10,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:10,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072427537] [2022-04-18 16:32:10,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072427537] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:10,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:10,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438705770] [2022-04-18 16:32:10,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:10,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:10,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:10,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:10,402 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 463 [2022-04-18 16:32:10,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 368 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 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) [2022-04-18 16:32:10,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:10,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 463 [2022-04-18 16:32:10,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:15,925 INFO L129 PetriNetUnfolder]: 16691/55209 cut-off events. [2022-04-18 16:32:15,925 INFO L130 PetriNetUnfolder]: For 1608/2188 co-relation queries the response was YES. [2022-04-18 16:32:16,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78893 conditions, 55209 events. 16691/55209 cut-off events. For 1608/2188 co-relation queries the response was YES. Maximal size of possible extension queue 2171. Compared 760139 event pairs, 7678 based on Foata normal form. 5/48007 useless extension candidates. Maximal degree in co-relation 27795. Up to 18943 conditions per place. [2022-04-18 16:32:17,132 INFO L132 encePairwiseOnDemand]: 445/463 looper letters, 30 selfloop transitions, 6 changer transitions 59/367 dead transitions. [2022-04-18 16:32:17,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 367 transitions, 898 flow [2022-04-18 16:32:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2022-04-18 16:32:17,144 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9136069114470843 [2022-04-18 16:32:17,145 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1269 transitions. [2022-04-18 16:32:17,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1269 transitions. [2022-04-18 16:32:17,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:17,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1269 transitions. [2022-04-18 16:32:17,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 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) [2022-04-18 16:32:17,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:17,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:17,149 INFO L186 Difference]: Start difference. First operand has 375 places, 368 transitions, 799 flow. Second operand 3 states and 1269 transitions. [2022-04-18 16:32:17,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 367 transitions, 898 flow [2022-04-18 16:32:17,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 367 transitions, 895 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-04-18 16:32:17,286 INFO L242 Difference]: Finished difference. Result has 358 places, 303 transitions, 695 flow [2022-04-18 16:32:17,286 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=358, PETRI_TRANSITIONS=303} [2022-04-18 16:32:17,287 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -60 predicate places. [2022-04-18 16:32:17,287 INFO L478 AbstractCegarLoop]: Abstraction has has 358 places, 303 transitions, 695 flow [2022-04-18 16:32:17,287 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.6666666666667) internal successors, (1214), 3 states have internal predecessors, (1214), 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) [2022-04-18 16:32:17,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:17,288 INFO L255 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] [2022-04-18 16:32:17,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 16:32:17,288 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1253586922, now seen corresponding path program 1 times [2022-04-18 16:32:17,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:17,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354842812] [2022-04-18 16:32:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:17,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:17,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:17,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354842812] [2022-04-18 16:32:17,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354842812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:17,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:17,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471713084] [2022-04-18 16:32:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:17,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:17,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:17,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:17,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:17,330 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-04-18 16:32:17,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 303 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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) [2022-04-18 16:32:17,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:17,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-04-18 16:32:17,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:18,246 INFO L129 PetriNetUnfolder]: 1593/7185 cut-off events. [2022-04-18 16:32:18,246 INFO L130 PetriNetUnfolder]: For 37/57 co-relation queries the response was YES. [2022-04-18 16:32:18,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10133 conditions, 7185 events. 1593/7185 cut-off events. For 37/57 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 77269 event pairs, 442 based on Foata normal form. 0/6046 useless extension candidates. Maximal degree in co-relation 5423. Up to 1528 conditions per place. [2022-04-18 16:32:18,385 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2022-04-18 16:32:18,386 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 770 flow [2022-04-18 16:32:18,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-04-18 16:32:18,388 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-04-18 16:32:18,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-04-18 16:32:18,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-04-18 16:32:18,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:18,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-04-18 16:32:18,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2022-04-18 16:32:18,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:18,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:18,392 INFO L186 Difference]: Start difference. First operand has 358 places, 303 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-04-18 16:32:18,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 770 flow [2022-04-18 16:32:18,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 307 transitions, 770 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-04-18 16:32:18,400 INFO L242 Difference]: Finished difference. Result has 306 places, 302 transitions, 697 flow [2022-04-18 16:32:18,401 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=697, PETRI_PLACES=306, PETRI_TRANSITIONS=302} [2022-04-18 16:32:18,401 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -112 predicate places. [2022-04-18 16:32:18,401 INFO L478 AbstractCegarLoop]: Abstraction has has 306 places, 302 transitions, 697 flow [2022-04-18 16:32:18,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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) [2022-04-18 16:32:18,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:18,403 INFO L255 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] [2022-04-18 16:32:18,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 16:32:18,403 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:18,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1568621509, now seen corresponding path program 1 times [2022-04-18 16:32:18,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:18,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751006863] [2022-04-18 16:32:18,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:18,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:18,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751006863] [2022-04-18 16:32:18,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751006863] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:18,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:18,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:18,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984151265] [2022-04-18 16:32:18,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:18,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:18,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:18,442 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-04-18 16:32:18,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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) [2022-04-18 16:32:18,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:18,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-04-18 16:32:18,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:19,586 INFO L129 PetriNetUnfolder]: 2190/8499 cut-off events. [2022-04-18 16:32:19,586 INFO L130 PetriNetUnfolder]: For 89/117 co-relation queries the response was YES. [2022-04-18 16:32:19,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13114 conditions, 8499 events. 2190/8499 cut-off events. For 89/117 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 92792 event pairs, 838 based on Foata normal form. 0/7390 useless extension candidates. Maximal degree in co-relation 12764. Up to 1759 conditions per place. [2022-04-18 16:32:19,775 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2022-04-18 16:32:19,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 306 transitions, 772 flow [2022-04-18 16:32:19,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-04-18 16:32:19,778 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-04-18 16:32:19,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-04-18 16:32:19,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-04-18 16:32:19,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:19,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-04-18 16:32:19,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2022-04-18 16:32:19,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:19,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:19,782 INFO L186 Difference]: Start difference. First operand has 306 places, 302 transitions, 697 flow. Second operand 3 states and 1279 transitions. [2022-04-18 16:32:19,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 306 transitions, 772 flow [2022-04-18 16:32:19,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 306 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:19,791 INFO L242 Difference]: Finished difference. Result has 305 places, 301 transitions, 695 flow [2022-04-18 16:32:19,791 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=305, PETRI_TRANSITIONS=301} [2022-04-18 16:32:19,792 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -113 predicate places. [2022-04-18 16:32:19,792 INFO L478 AbstractCegarLoop]: Abstraction has has 305 places, 301 transitions, 695 flow [2022-04-18 16:32:19,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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) [2022-04-18 16:32:19,794 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:19,795 INFO L255 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] [2022-04-18 16:32:19,795 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 16:32:19,795 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:19,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1789669962, now seen corresponding path program 1 times [2022-04-18 16:32:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:19,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065101738] [2022-04-18 16:32:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:19,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:19,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065101738] [2022-04-18 16:32:19,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065101738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:19,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:19,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631764251] [2022-04-18 16:32:19,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:19,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:19,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:19,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:19,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:19,823 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-04-18 16:32:19,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 301 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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) [2022-04-18 16:32:19,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:19,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-04-18 16:32:19,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:20,372 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 504#true, 298#L49-2true, 229#L73-5true, 243#L65-2true, 269#L107-4true, Black: 519#true, 43#L41-5true, 331#L57-2true, Black: 489#true, 514#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true]) [2022-04-18 16:32:20,373 INFO L384 tUnfolder$Statistics]: this new event has 134 ancestors and is cut-off event [2022-04-18 16:32:20,373 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-04-18 16:32:20,373 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 16:32:20,373 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-04-18 16:32:20,420 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, 411#L41-2true, 243#L65-2true, 269#L107-4true, Black: 519#true, 331#L57-2true, 363#L73-2true, Black: 489#true, 514#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,420 INFO L384 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-04-18 16:32:20,421 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-04-18 16:32:20,421 INFO L387 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-04-18 16:32:20,421 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-04-18 16:32:20,646 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 229#L73-5true, 243#L65-2true, 269#L107-4true, Black: 519#true, 43#L41-5true, 331#L57-2true, Black: 489#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,647 INFO L384 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-04-18 16:32:20,647 INFO L387 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-04-18 16:32:20,647 INFO L387 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-04-18 16:32:20,647 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 16:32:20,687 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, 292#L108-4true, 411#L41-2true, 399#L81-5true, 243#L65-2true, Black: 519#true, 363#L73-2true, 331#L57-2true, Black: 489#true, 514#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,688 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-04-18 16:32:20,688 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:32:20,688 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-04-18 16:32:20,688 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:32:20,688 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 504#true, 298#L49-2true, 292#L108-4true, 229#L73-5true, 399#L81-5true, 243#L65-2true, 43#L41-5true, Black: 519#true, Black: 489#true, 331#L57-2true, 514#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true]) [2022-04-18 16:32:20,689 INFO L384 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-04-18 16:32:20,689 INFO L387 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-04-18 16:32:20,689 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-04-18 16:32:20,689 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-04-18 16:32:20,689 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, 292#L108-4true, 399#L81-5true, 243#L65-2true, Black: 519#true, 43#L41-5true, 331#L57-2true, 363#L73-2true, Black: 489#true, 514#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,689 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-04-18 16:32:20,689 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-04-18 16:32:20,689 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-04-18 16:32:20,690 INFO L387 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-04-18 16:32:20,690 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, 292#L108-4true, 399#L81-5true, 243#L65-2true, Black: 519#true, 43#L41-5true, 331#L57-2true, 363#L73-2true, Black: 489#true, 514#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,690 INFO L384 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-04-18 16:32:20,690 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-04-18 16:32:20,691 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-04-18 16:32:20,691 INFO L387 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-04-18 16:32:20,691 INFO L387 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-04-18 16:32:20,705 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 411#L41-2true, 243#L65-2true, 269#L107-4true, Black: 519#true, 331#L57-2true, 363#L73-2true, Black: 489#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,706 INFO L384 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-04-18 16:32:20,706 INFO L387 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-04-18 16:32:20,706 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-04-18 16:32:20,706 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-04-18 16:32:20,742 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 504#true, 298#L49-2true, 411#L41-2true, Black: 514#true, 292#L108-4true, 229#L73-5true, 243#L65-2true, Black: 519#true, 331#L57-2true, Black: 489#true, Black: 494#true, 381#L81-2true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true]) [2022-04-18 16:32:20,743 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-04-18 16:32:20,743 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:32:20,743 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:32:20,743 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-04-18 16:32:20,745 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, 292#L108-4true, Black: 514#true, 243#L65-2true, Black: 519#true, 43#L41-5true, 331#L57-2true, 363#L73-2true, Black: 489#true, Black: 494#true, 381#L81-2true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,745 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-04-18 16:32:20,745 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:32:20,745 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-04-18 16:32:20,745 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:32:20,885 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, 292#L108-4true, 411#L41-2true, Black: 514#true, 243#L65-2true, Black: 519#true, 331#L57-2true, 363#L73-2true, Black: 489#true, Black: 494#true, 381#L81-2true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,885 INFO L384 tUnfolder$Statistics]: this new event has 149 ancestors and is cut-off event [2022-04-18 16:32:20,885 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-04-18 16:32:20,885 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-04-18 16:32:20,885 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:32:20,940 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 292#L108-4true, 399#L81-5true, 243#L65-2true, Black: 519#true, 43#L41-5true, 331#L57-2true, Black: 489#true, 363#L73-2true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,940 INFO L384 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-04-18 16:32:20,941 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 16:32:20,941 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-04-18 16:32:20,941 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:32:20,941 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 292#L108-4true, 229#L73-5true, 399#L81-5true, 243#L65-2true, Black: 519#true, 43#L41-5true, 331#L57-2true, Black: 489#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,941 INFO L384 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-04-18 16:32:20,941 INFO L387 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-04-18 16:32:20,941 INFO L387 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-04-18 16:32:20,941 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-04-18 16:32:20,942 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 292#L108-4true, 411#L41-2true, 399#L81-5true, 243#L65-2true, Black: 519#true, 363#L73-2true, Black: 489#true, 331#L57-2true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,942 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-04-18 16:32:20,942 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:32:20,942 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-04-18 16:32:20,942 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 16:32:20,943 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 292#L108-4true, 399#L81-5true, 243#L65-2true, Black: 519#true, 43#L41-5true, 331#L57-2true, 363#L73-2true, Black: 489#true, Black: 494#true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,943 INFO L384 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-04-18 16:32:20,943 INFO L387 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-04-18 16:32:20,943 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-04-18 16:32:20,943 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:32:20,943 INFO L387 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-04-18 16:32:20,986 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 411#L41-2true, 292#L108-4true, 229#L73-5true, 243#L65-2true, Black: 519#true, Black: 489#true, 331#L57-2true, Black: 494#true, 381#L81-2true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:20,986 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-04-18 16:32:20,987 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:32:20,987 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-04-18 16:32:20,987 INFO L387 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-04-18 16:32:21,135 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 292#L108-4true, 243#L65-2true, Black: 519#true, 43#L41-5true, 363#L73-2true, 331#L57-2true, Black: 489#true, Black: 494#true, 381#L81-2true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:21,135 INFO L384 tUnfolder$Statistics]: this new event has 151 ancestors and is cut-off event [2022-04-18 16:32:21,136 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:32:21,136 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-04-18 16:32:21,136 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-04-18 16:32:21,136 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-04-18 16:32:21,198 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1064] L57-1-->L57-2: Formula: (= |v_#race~n~0_7| 0) InVars {} OutVars{#race~n~0=|v_#race~n~0_7|} AuxVars[] AssignedVars[#race~n~0][146], [Black: 509#true, 298#L49-2true, Black: 514#true, 411#L41-2true, 292#L108-4true, 243#L65-2true, Black: 519#true, 331#L57-2true, Black: 489#true, 363#L73-2true, Black: 494#true, 381#L81-2true, Black: 499#true, 528#true, 521#(= |#race~n~0| 0), 532#true, Black: 504#true]) [2022-04-18 16:32:21,199 INFO L384 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-04-18 16:32:21,199 INFO L387 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-04-18 16:32:21,199 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-04-18 16:32:21,199 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:32:21,199 INFO L387 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-04-18 16:32:21,519 INFO L129 PetriNetUnfolder]: 2460/11300 cut-off events. [2022-04-18 16:32:21,519 INFO L130 PetriNetUnfolder]: For 416/516 co-relation queries the response was YES. [2022-04-18 16:32:21,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16495 conditions, 11300 events. 2460/11300 cut-off events. For 416/516 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 131400 event pairs, 819 based on Foata normal form. 0/9811 useless extension candidates. Maximal degree in co-relation 15297. Up to 2059 conditions per place. [2022-04-18 16:32:21,772 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2022-04-18 16:32:21,773 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 770 flow [2022-04-18 16:32:21,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-04-18 16:32:21,775 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-04-18 16:32:21,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-04-18 16:32:21,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-04-18 16:32:21,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:21,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-04-18 16:32:21,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2022-04-18 16:32:21,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:21,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:21,779 INFO L186 Difference]: Start difference. First operand has 305 places, 301 transitions, 695 flow. Second operand 3 states and 1279 transitions. [2022-04-18 16:32:21,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 770 flow [2022-04-18 16:32:21,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 305 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:21,790 INFO L242 Difference]: Finished difference. Result has 304 places, 300 transitions, 693 flow [2022-04-18 16:32:21,791 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=304, PETRI_TRANSITIONS=300} [2022-04-18 16:32:21,791 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-04-18 16:32:21,791 INFO L478 AbstractCegarLoop]: Abstraction has has 304 places, 300 transitions, 693 flow [2022-04-18 16:32:21,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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) [2022-04-18 16:32:21,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:21,792 INFO L255 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] [2022-04-18 16:32:21,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-18 16:32:21,792 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:21,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash -187429401, now seen corresponding path program 1 times [2022-04-18 16:32:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:21,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148432048] [2022-04-18 16:32:21,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:21,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148432048] [2022-04-18 16:32:21,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148432048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:21,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:21,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103819014] [2022-04-18 16:32:21,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:21,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:21,824 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-04-18 16:32:21,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 300 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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) [2022-04-18 16:32:21,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:21,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-04-18 16:32:21,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:22,935 INFO L129 PetriNetUnfolder]: 1961/8204 cut-off events. [2022-04-18 16:32:22,935 INFO L130 PetriNetUnfolder]: For 326/410 co-relation queries the response was YES. [2022-04-18 16:32:23,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11991 conditions, 8204 events. 1961/8204 cut-off events. For 326/410 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 86373 event pairs, 639 based on Foata normal form. 0/7034 useless extension candidates. Maximal degree in co-relation 11521. Up to 1733 conditions per place. [2022-04-18 16:32:23,114 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2022-04-18 16:32:23,114 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 304 transitions, 768 flow [2022-04-18 16:32:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-04-18 16:32:23,117 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-04-18 16:32:23,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-04-18 16:32:23,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-04-18 16:32:23,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:23,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-04-18 16:32:23,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2022-04-18 16:32:23,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:23,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:23,121 INFO L186 Difference]: Start difference. First operand has 304 places, 300 transitions, 693 flow. Second operand 3 states and 1279 transitions. [2022-04-18 16:32:23,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 304 transitions, 768 flow [2022-04-18 16:32:23,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 304 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:23,130 INFO L242 Difference]: Finished difference. Result has 303 places, 299 transitions, 691 flow [2022-04-18 16:32:23,130 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=691, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2022-04-18 16:32:23,131 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-04-18 16:32:23,131 INFO L478 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 691 flow [2022-04-18 16:32:23,131 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 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) [2022-04-18 16:32:23,131 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:23,131 INFO L255 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] [2022-04-18 16:32:23,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-18 16:32:23,132 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -260389847, now seen corresponding path program 1 times [2022-04-18 16:32:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:23,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761723981] [2022-04-18 16:32:23,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:23,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:23,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761723981] [2022-04-18 16:32:23,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761723981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:23,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:23,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:23,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336207065] [2022-04-18 16:32:23,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:23,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:23,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:23,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:23,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:23,159 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-04-18 16:32:23,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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) [2022-04-18 16:32:23,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:23,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-04-18 16:32:23,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:24,031 INFO L129 PetriNetUnfolder]: 1871/7737 cut-off events. [2022-04-18 16:32:24,031 INFO L130 PetriNetUnfolder]: For 459/523 co-relation queries the response was YES. [2022-04-18 16:32:24,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11426 conditions, 7737 events. 1871/7737 cut-off events. For 459/523 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 79701 event pairs, 644 based on Foata normal form. 0/6693 useless extension candidates. Maximal degree in co-relation 10587. Up to 1618 conditions per place. [2022-04-18 16:32:24,190 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-04-18 16:32:24,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 303 transitions, 766 flow [2022-04-18 16:32:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:24,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-04-18 16:32:24,192 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-04-18 16:32:24,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-04-18 16:32:24,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-04-18 16:32:24,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:24,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-04-18 16:32:24,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2022-04-18 16:32:24,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:24,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:24,197 INFO L186 Difference]: Start difference. First operand has 303 places, 299 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-04-18 16:32:24,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 303 transitions, 766 flow [2022-04-18 16:32:24,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 303 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:24,205 INFO L242 Difference]: Finished difference. Result has 302 places, 298 transitions, 689 flow [2022-04-18 16:32:24,205 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=302, PETRI_TRANSITIONS=298} [2022-04-18 16:32:24,205 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -116 predicate places. [2022-04-18 16:32:24,206 INFO L478 AbstractCegarLoop]: Abstraction has has 302 places, 298 transitions, 689 flow [2022-04-18 16:32:24,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.3333333333333) internal successors, (1264), 3 states have internal predecessors, (1264), 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) [2022-04-18 16:32:24,206 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:24,206 INFO L255 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] [2022-04-18 16:32:24,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-18 16:32:24,207 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1626420513, now seen corresponding path program 1 times [2022-04-18 16:32:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809562036] [2022-04-18 16:32:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:24,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809562036] [2022-04-18 16:32:24,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809562036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:24,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:24,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:32:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818685387] [2022-04-18 16:32:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:24,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:32:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:32:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:32:24,288 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-04-18 16:32:24,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 298 transitions, 689 flow. Second operand has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 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) [2022-04-18 16:32:24,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:24,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-04-18 16:32:24,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:24,894 INFO L129 PetriNetUnfolder]: 966/4812 cut-off events. [2022-04-18 16:32:24,894 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-04-18 16:32:24,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6759 conditions, 4812 events. 966/4812 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 44803 event pairs, 172 based on Foata normal form. 0/4206 useless extension candidates. Maximal degree in co-relation 6393. Up to 1092 conditions per place. [2022-04-18 16:32:24,976 INFO L132 encePairwiseOnDemand]: 458/463 looper letters, 46 selfloop transitions, 4 changer transitions 0/297 dead transitions. [2022-04-18 16:32:24,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 787 flow [2022-04-18 16:32:24,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:32:24,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:32:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2451 transitions. [2022-04-18 16:32:24,980 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8822894168466523 [2022-04-18 16:32:24,980 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2451 transitions. [2022-04-18 16:32:24,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2451 transitions. [2022-04-18 16:32:24,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:24,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2451 transitions. [2022-04-18 16:32:24,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.5) internal successors, (2451), 6 states have internal predecessors, (2451), 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) [2022-04-18 16:32:24,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:24,986 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:24,986 INFO L186 Difference]: Start difference. First operand has 302 places, 298 transitions, 689 flow. Second operand 6 states and 2451 transitions. [2022-04-18 16:32:24,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 787 flow [2022-04-18 16:32:24,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 297 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:24,992 INFO L242 Difference]: Finished difference. Result has 304 places, 297 transitions, 691 flow [2022-04-18 16:32:24,993 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=691, PETRI_PLACES=304, PETRI_TRANSITIONS=297} [2022-04-18 16:32:24,993 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -114 predicate places. [2022-04-18 16:32:24,993 INFO L478 AbstractCegarLoop]: Abstraction has has 304 places, 297 transitions, 691 flow [2022-04-18 16:32:24,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 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) [2022-04-18 16:32:24,994 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:24,994 INFO L255 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] [2022-04-18 16:32:24,994 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-18 16:32:24,994 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:24,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1800624235, now seen corresponding path program 1 times [2022-04-18 16:32:24,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:24,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890734946] [2022-04-18 16:32:24,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:24,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:25,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890734946] [2022-04-18 16:32:25,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890734946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:25,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:25,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 16:32:25,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188992577] [2022-04-18 16:32:25,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:25,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 16:32:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:25,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 16:32:25,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 16:32:25,019 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 463 [2022-04-18 16:32:25,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 297 transitions, 691 flow. Second operand has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2022-04-18 16:32:25,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:25,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 463 [2022-04-18 16:32:25,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:25,790 INFO L129 PetriNetUnfolder]: 1527/6489 cut-off events. [2022-04-18 16:32:25,790 INFO L130 PetriNetUnfolder]: For 377/425 co-relation queries the response was YES. [2022-04-18 16:32:25,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9256 conditions, 6489 events. 1527/6489 cut-off events. For 377/425 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 63021 event pairs, 504 based on Foata normal form. 0/5607 useless extension candidates. Maximal degree in co-relation 6023. Up to 1359 conditions per place. [2022-04-18 16:32:25,921 INFO L132 encePairwiseOnDemand]: 460/463 looper letters, 29 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-04-18 16:32:25,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 301 transitions, 766 flow [2022-04-18 16:32:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 16:32:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-04-18 16:32:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-04-18 16:32:25,924 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.9208063354931606 [2022-04-18 16:32:25,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-04-18 16:32:25,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-04-18 16:32:25,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:25,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-04-18 16:32:25,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 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) [2022-04-18 16:32:25,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:25,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 463.0) internal successors, (1852), 4 states have internal predecessors, (1852), 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) [2022-04-18 16:32:25,928 INFO L186 Difference]: Start difference. First operand has 304 places, 297 transitions, 691 flow. Second operand 3 states and 1279 transitions. [2022-04-18 16:32:25,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 301 transitions, 766 flow [2022-04-18 16:32:25,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 759 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:32:25,935 INFO L242 Difference]: Finished difference. Result has 301 places, 296 transitions, 686 flow [2022-04-18 16:32:25,936 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=301, PETRI_TRANSITIONS=296} [2022-04-18 16:32:25,936 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -117 predicate places. [2022-04-18 16:32:25,936 INFO L478 AbstractCegarLoop]: Abstraction has has 301 places, 296 transitions, 686 flow [2022-04-18 16:32:25,937 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.6666666666667) internal successors, (1265), 3 states have internal predecessors, (1265), 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) [2022-04-18 16:32:25,937 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:25,937 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:32:25,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-18 16:32:25,937 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:25,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:25,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1028799796, now seen corresponding path program 1 times [2022-04-18 16:32:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:25,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787146052] [2022-04-18 16:32:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:25,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:26,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:26,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787146052] [2022-04-18 16:32:26,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787146052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:26,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:26,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:32:26,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696970293] [2022-04-18 16:32:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:26,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:32:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:32:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:32:26,046 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-04-18 16:32:26,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 296 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 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) [2022-04-18 16:32:26,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:26,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-04-18 16:32:26,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:26,677 INFO L129 PetriNetUnfolder]: 966/4794 cut-off events. [2022-04-18 16:32:26,678 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-04-18 16:32:26,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6705 conditions, 4794 events. 966/4794 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 44584 event pairs, 172 based on Foata normal form. 0/4206 useless extension candidates. Maximal degree in co-relation 6401. Up to 1092 conditions per place. [2022-04-18 16:32:26,766 INFO L132 encePairwiseOnDemand]: 458/463 looper letters, 45 selfloop transitions, 4 changer transitions 0/295 dead transitions. [2022-04-18 16:32:26,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 295 transitions, 782 flow [2022-04-18 16:32:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:32:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:32:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2450 transitions. [2022-04-18 16:32:26,769 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8819294456443485 [2022-04-18 16:32:26,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2450 transitions. [2022-04-18 16:32:26,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2450 transitions. [2022-04-18 16:32:26,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:26,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2450 transitions. [2022-04-18 16:32:26,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.3333333333333) internal successors, (2450), 6 states have internal predecessors, (2450), 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) [2022-04-18 16:32:26,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:26,775 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:26,775 INFO L186 Difference]: Start difference. First operand has 301 places, 296 transitions, 686 flow. Second operand 6 states and 2450 transitions. [2022-04-18 16:32:26,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 295 transitions, 782 flow [2022-04-18 16:32:26,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 295 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-04-18 16:32:26,781 INFO L242 Difference]: Finished difference. Result has 303 places, 295 transitions, 688 flow [2022-04-18 16:32:26,781 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=688, PETRI_PLACES=303, PETRI_TRANSITIONS=295} [2022-04-18 16:32:26,782 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-04-18 16:32:26,782 INFO L478 AbstractCegarLoop]: Abstraction has has 303 places, 295 transitions, 688 flow [2022-04-18 16:32:26,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.5) internal successors, (2421), 6 states have internal predecessors, (2421), 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) [2022-04-18 16:32:26,782 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:26,783 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:32:26,783 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-18 16:32:26,783 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 414197575, now seen corresponding path program 1 times [2022-04-18 16:32:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:26,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494297477] [2022-04-18 16:32:26,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:26,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494297477] [2022-04-18 16:32:26,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494297477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:26,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:26,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:32:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836037065] [2022-04-18 16:32:26,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:26,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:32:26,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:26,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:32:26,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:32:26,878 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-04-18 16:32:26,879 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 295 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 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) [2022-04-18 16:32:26,879 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:26,879 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-04-18 16:32:26,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:27,458 INFO L129 PetriNetUnfolder]: 966/4774 cut-off events. [2022-04-18 16:32:27,458 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-04-18 16:32:27,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6669 conditions, 4774 events. 966/4774 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 44373 event pairs, 172 based on Foata normal form. 0/4206 useless extension candidates. Maximal degree in co-relation 5935. Up to 1092 conditions per place. [2022-04-18 16:32:27,538 INFO L132 encePairwiseOnDemand]: 458/463 looper letters, 44 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-04-18 16:32:27,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 782 flow [2022-04-18 16:32:27,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:32:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:32:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2449 transitions. [2022-04-18 16:32:27,542 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8815694744420446 [2022-04-18 16:32:27,542 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2449 transitions. [2022-04-18 16:32:27,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2449 transitions. [2022-04-18 16:32:27,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:27,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2449 transitions. [2022-04-18 16:32:27,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.1666666666667) internal successors, (2449), 6 states have internal predecessors, (2449), 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) [2022-04-18 16:32:27,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:27,548 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:27,548 INFO L186 Difference]: Start difference. First operand has 303 places, 295 transitions, 688 flow. Second operand 6 states and 2449 transitions. [2022-04-18 16:32:27,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 782 flow [2022-04-18 16:32:27,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 294 transitions, 775 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:32:27,554 INFO L242 Difference]: Finished difference. Result has 303 places, 294 transitions, 687 flow [2022-04-18 16:32:27,554 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=303, PETRI_TRANSITIONS=294} [2022-04-18 16:32:27,555 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-04-18 16:32:27,555 INFO L478 AbstractCegarLoop]: Abstraction has has 303 places, 294 transitions, 687 flow [2022-04-18 16:32:27,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.5) internal successors, (2427), 6 states have internal predecessors, (2427), 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) [2022-04-18 16:32:27,555 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:27,556 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:32:27,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-18 16:32:27,556 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:27,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:27,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2116183077, now seen corresponding path program 1 times [2022-04-18 16:32:27,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:27,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421437664] [2022-04-18 16:32:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:27,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:27,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:27,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421437664] [2022-04-18 16:32:27,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421437664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:27,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:27,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:32:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923197590] [2022-04-18 16:32:27,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:27,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:32:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:27,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:32:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:32:27,636 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-04-18 16:32:27,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 294 transitions, 687 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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) [2022-04-18 16:32:27,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:27,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-04-18 16:32:27,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:28,209 INFO L129 PetriNetUnfolder]: 966/4760 cut-off events. [2022-04-18 16:32:28,209 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-04-18 16:32:28,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6703 conditions, 4760 events. 966/4760 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 44238 event pairs, 172 based on Foata normal form. 0/4206 useless extension candidates. Maximal degree in co-relation 6059. Up to 1092 conditions per place. [2022-04-18 16:32:28,288 INFO L132 encePairwiseOnDemand]: 458/463 looper letters, 43 selfloop transitions, 4 changer transitions 0/293 dead transitions. [2022-04-18 16:32:28,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 293 transitions, 779 flow [2022-04-18 16:32:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:32:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:32:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2448 transitions. [2022-04-18 16:32:28,292 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8812095032397408 [2022-04-18 16:32:28,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2448 transitions. [2022-04-18 16:32:28,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2448 transitions. [2022-04-18 16:32:28,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:28,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2448 transitions. [2022-04-18 16:32:28,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 408.0) internal successors, (2448), 6 states have internal predecessors, (2448), 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) [2022-04-18 16:32:28,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:28,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:28,297 INFO L186 Difference]: Start difference. First operand has 303 places, 294 transitions, 687 flow. Second operand 6 states and 2448 transitions. [2022-04-18 16:32:28,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 293 transitions, 779 flow [2022-04-18 16:32:28,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 293 transitions, 772 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:32:28,304 INFO L242 Difference]: Finished difference. Result has 303 places, 293 transitions, 686 flow [2022-04-18 16:32:28,304 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=686, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2022-04-18 16:32:28,304 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-04-18 16:32:28,305 INFO L478 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 686 flow [2022-04-18 16:32:28,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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) [2022-04-18 16:32:28,305 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:28,305 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:32:28,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-18 16:32:28,306 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:28,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1153415121, now seen corresponding path program 1 times [2022-04-18 16:32:28,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:28,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408205861] [2022-04-18 16:32:28,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:28,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:28,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:28,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408205861] [2022-04-18 16:32:28,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408205861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:28,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:28,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:32:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872832177] [2022-04-18 16:32:28,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:28,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:32:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:32:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:32:28,387 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-04-18 16:32:28,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 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) [2022-04-18 16:32:28,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:28,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-04-18 16:32:28,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:28,953 INFO L129 PetriNetUnfolder]: 966/4754 cut-off events. [2022-04-18 16:32:28,953 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-04-18 16:32:29,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6679 conditions, 4754 events. 966/4754 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 44215 event pairs, 172 based on Foata normal form. 0/4206 useless extension candidates. Maximal degree in co-relation 6335. Up to 1092 conditions per place. [2022-04-18 16:32:29,031 INFO L132 encePairwiseOnDemand]: 458/463 looper letters, 42 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2022-04-18 16:32:29,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 292 transitions, 776 flow [2022-04-18 16:32:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:32:29,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:32:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2447 transitions. [2022-04-18 16:32:29,034 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.880849532037437 [2022-04-18 16:32:29,034 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2447 transitions. [2022-04-18 16:32:29,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2447 transitions. [2022-04-18 16:32:29,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:29,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2447 transitions. [2022-04-18 16:32:29,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.8333333333333) internal successors, (2447), 6 states have internal predecessors, (2447), 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) [2022-04-18 16:32:29,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:29,039 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:29,039 INFO L186 Difference]: Start difference. First operand has 303 places, 293 transitions, 686 flow. Second operand 6 states and 2447 transitions. [2022-04-18 16:32:29,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 292 transitions, 776 flow [2022-04-18 16:32:29,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 292 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:32:29,045 INFO L242 Difference]: Finished difference. Result has 303 places, 292 transitions, 685 flow [2022-04-18 16:32:29,045 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=685, PETRI_PLACES=303, PETRI_TRANSITIONS=292} [2022-04-18 16:32:29,046 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-04-18 16:32:29,046 INFO L478 AbstractCegarLoop]: Abstraction has has 303 places, 292 transitions, 685 flow [2022-04-18 16:32:29,046 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 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) [2022-04-18 16:32:29,046 INFO L247 CegarLoopForPetriNet]: Found error trace [2022-04-18 16:32:29,047 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 16:32:29,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-18 16:32:29,047 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 99 more)] === [2022-04-18 16:32:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 16:32:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2043561472, now seen corresponding path program 1 times [2022-04-18 16:32:29,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-18 16:32:29,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338451033] [2022-04-18 16:32:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 16:32:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 16:32:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 16:32:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 16:32:29,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-18 16:32:29,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338451033] [2022-04-18 16:32:29,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338451033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 16:32:29,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 16:32:29,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 16:32:29,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287346344] [2022-04-18 16:32:29,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 16:32:29,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 16:32:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-18 16:32:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 16:32:29,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 16:32:29,124 INFO L502 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 463 [2022-04-18 16:32:29,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 292 transitions, 685 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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) [2022-04-18 16:32:29,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-04-18 16:32:29,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 463 [2022-04-18 16:32:29,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-04-18 16:32:29,688 INFO L129 PetriNetUnfolder]: 966/4751 cut-off events. [2022-04-18 16:32:29,688 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-04-18 16:32:29,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 4751 events. 966/4751 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 44190 event pairs, 172 based on Foata normal form. 0/4206 useless extension candidates. Maximal degree in co-relation 6513. Up to 1092 conditions per place. [2022-04-18 16:32:29,743 INFO L132 encePairwiseOnDemand]: 458/463 looper letters, 0 selfloop transitions, 0 changer transitions 291/291 dead transitions. [2022-04-18 16:32:29,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 291 transitions, 773 flow [2022-04-18 16:32:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 16:32:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-04-18 16:32:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2446 transitions. [2022-04-18 16:32:29,747 INFO L547 CegarLoopForPetriNet]: DFA transition density 0.8804895608351332 [2022-04-18 16:32:29,747 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2446 transitions. [2022-04-18 16:32:29,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2446 transitions. [2022-04-18 16:32:29,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-04-18 16:32:29,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2446 transitions. [2022-04-18 16:32:29,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 407.6666666666667) internal successors, (2446), 6 states have internal predecessors, (2446), 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) [2022-04-18 16:32:29,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:29,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 463.0) internal successors, (3241), 7 states have internal predecessors, (3241), 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) [2022-04-18 16:32:29,752 INFO L186 Difference]: Start difference. First operand has 303 places, 292 transitions, 685 flow. Second operand 6 states and 2446 transitions. [2022-04-18 16:32:29,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 291 transitions, 773 flow [2022-04-18 16:32:29,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 291 transitions, 766 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-04-18 16:32:29,756 INFO L242 Difference]: Finished difference. Result has 303 places, 0 transitions, 0 flow [2022-04-18 16:32:29,757 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=463, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=303, PETRI_TRANSITIONS=0} [2022-04-18 16:32:29,758 INFO L335 CegarLoopForPetriNet]: 418 programPoint places, -115 predicate places. [2022-04-18 16:32:29,758 INFO L478 AbstractCegarLoop]: Abstraction has has 303 places, 0 transitions, 0 flow [2022-04-18 16:32:29,758 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 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) [2022-04-18 16:32:29,760 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (102 of 103 remaining) [2022-04-18 16:32:29,761 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (101 of 103 remaining) [2022-04-18 16:32:29,761 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (100 of 103 remaining) [2022-04-18 16:32:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 103 remaining) [2022-04-18 16:32:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (98 of 103 remaining) [2022-04-18 16:32:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (97 of 103 remaining) [2022-04-18 16:32:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 103 remaining) [2022-04-18 16:32:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 103 remaining) [2022-04-18 16:32:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (94 of 103 remaining) [2022-04-18 16:32:29,764 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 103 remaining) [2022-04-18 16:32:29,765 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 103 remaining) [2022-04-18 16:32:29,765 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 103 remaining) [2022-04-18 16:32:29,765 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (83 of 103 remaining) [2022-04-18 16:32:29,766 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (82 of 103 remaining) [2022-04-18 16:32:29,767 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 103 remaining) [2022-04-18 16:32:29,768 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 103 remaining) [2022-04-18 16:32:29,768 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 103 remaining) [2022-04-18 16:32:29,768 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 103 remaining) [2022-04-18 16:32:29,768 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (77 of 103 remaining) [2022-04-18 16:32:29,768 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 103 remaining) [2022-04-18 16:32:29,768 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (75 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (74 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (73 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (72 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (71 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (70 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (68 of 103 remaining) [2022-04-18 16:32:29,769 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (66 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (65 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (64 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (62 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (61 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (60 of 103 remaining) [2022-04-18 16:32:29,770 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (59 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (58 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (57 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (56 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (55 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (54 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (53 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (52 of 103 remaining) [2022-04-18 16:32:29,771 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (51 of 103 remaining) [2022-04-18 16:32:29,772 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 103 remaining) [2022-04-18 16:32:29,772 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 103 remaining) [2022-04-18 16:32:29,772 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 103 remaining) [2022-04-18 16:32:29,772 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 103 remaining) [2022-04-18 16:32:29,772 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 103 remaining) [2022-04-18 16:32:29,772 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 103 remaining) [2022-04-18 16:32:29,773 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 103 remaining) [2022-04-18 16:32:29,774 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 103 remaining) [2022-04-18 16:32:29,775 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 103 remaining) [2022-04-18 16:32:29,776 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 103 remaining) [2022-04-18 16:32:29,777 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 103 remaining) [2022-04-18 16:32:29,777 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 103 remaining) [2022-04-18 16:32:29,777 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 103 remaining) [2022-04-18 16:32:29,777 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 103 remaining) [2022-04-18 16:32:29,777 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 103 remaining) [2022-04-18 16:32:29,777 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 103 remaining) [2022-04-18 16:32:29,777 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 103 remaining) [2022-04-18 16:32:29,778 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 103 remaining) [2022-04-18 16:32:29,778 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 103 remaining) [2022-04-18 16:32:29,778 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 103 remaining) [2022-04-18 16:32:29,778 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 103 remaining) [2022-04-18 16:32:29,778 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 103 remaining) [2022-04-18 16:32:29,778 INFO L788 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 103 remaining) [2022-04-18 16:32:29,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-18 16:32:29,781 INFO L719 BasicCegarLoop]: Path program 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] [2022-04-18 16:32:29,785 INFO L227 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-04-18 16:32:29,785 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-18 16:32:29,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 04:32:29 BasicIcfg [2022-04-18 16:32:29,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-18 16:32:29,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-04-18 16:32:29,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-04-18 16:32:29,789 INFO L275 PluginConnector]: Witness Printer initialized [2022-04-18 16:32:29,789 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 04:31:57" (3/4) ... [2022-04-18 16:32:29,791 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-04-18 16:32:29,794 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-04-18 16:32:29,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-04-18 16:32:29,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-04-18 16:32:29,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-04-18 16:32:29,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2022-04-18 16:32:29,795 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2022-04-18 16:32:29,804 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-04-18 16:32:29,804 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-04-18 16:32:29,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-04-18 16:32:29,805 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-04-18 16:32:29,849 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-04-18 16:32:29,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-04-18 16:32:29,850 INFO L158 Benchmark]: Toolchain (without parser) took 32995.41ms. Allocated memory was 119.5MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 90.6MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2022-04-18 16:32:29,850 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 119.5MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-04-18 16:32:29,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.57ms. Allocated memory is still 119.5MB. Free memory was 90.3MB in the beginning and 92.1MB in the end (delta: -1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-04-18 16:32:29,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.20ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 89.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 16:32:29,851 INFO L158 Benchmark]: Boogie Preprocessor took 26.07ms. Allocated memory is still 119.5MB. Free memory was 89.7MB in the beginning and 87.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-04-18 16:32:29,851 INFO L158 Benchmark]: RCFGBuilder took 573.77ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 87.3MB in the beginning and 123.3MB in the end (delta: -36.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2022-04-18 16:32:29,851 INFO L158 Benchmark]: TraceAbstraction took 31995.78ms. Allocated memory was 148.9MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 122.8MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2022-04-18 16:32:29,851 INFO L158 Benchmark]: Witness Printer took 60.33ms. Allocated memory is still 9.8GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-04-18 16:32:29,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 119.5MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.57ms. Allocated memory is still 119.5MB. Free memory was 90.3MB in the beginning and 92.1MB in the end (delta: -1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.20ms. Allocated memory is still 119.5MB. Free memory was 92.1MB in the beginning and 89.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.07ms. Allocated memory is still 119.5MB. Free memory was 89.7MB in the beginning and 87.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.77ms. Allocated memory was 119.5MB in the beginning and 148.9MB in the end (delta: 29.4MB). Free memory was 87.3MB in the beginning and 123.3MB in the end (delta: -36.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31995.78ms. Allocated memory was 148.9MB in the beginning and 9.8GB in the end (delta: 9.7GB). Free memory was 122.8MB in the beginning and 5.6GB in the end (delta: -5.5GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 60.33ms. Allocated memory is still 9.8GB. Free memory was 5.6GB in the beginning and 5.6GB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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 13 procedures, 578 locations, 103 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: 31.9s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 293 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 293 mSDsluCounter, 462 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 462 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=878occurred in iteration=0, InterpolantAutomatonStates: 96, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2533 NumberOfCodeBlocks, 2533 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2507 ConstructedInterpolants, 0 QuantifiedInterpolants, 3033 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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 - AllSpecificationsHoldResult: All specifications hold 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-18 16:32:29,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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