./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc --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 df820220e47314ad1ae7e5e69c959ff16aa366a463fd9290864972c0f85d142a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:17:18,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:17:18,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:17:18,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:17:18,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:17:18,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:17:18,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:17:18,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:17:18,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:17:18,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:17:18,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:17:18,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:17:18,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:17:18,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:17:18,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:17:18,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:17:18,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:17:18,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:17:18,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:17:18,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:17:18,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:17:18,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:17:18,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:17:18,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:17:18,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:17:18,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:17:18,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:17:18,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:17:18,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:17:18,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:17:18,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:17:18,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:17:18,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:17:18,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:17:18,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:17:18,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:17:18,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:17:18,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:17:18,360 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:17:18,361 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:17:18,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:17:18,363 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:17:18,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:17:18,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:17:18,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:17:18,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:17:18,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:17:18,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:17:18,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:17:18,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:17:18,409 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:17:18,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:17:18,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:17:18,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:17:18,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:17:18,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:17:18,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:17:18,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:17:18,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:17:18,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:17:18,415 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:17:18,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:17:18,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:17:18,415 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:17:18,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:17:18,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:17:18,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:17:18,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:17:18,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:17:18,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:17:18,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:17:18,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:17:18,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:17:18,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:17:18,421 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:17:18,421 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:17:18,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:17:18,422 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc 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 -> df820220e47314ad1ae7e5e69c959ff16aa366a463fd9290864972c0f85d142a [2022-11-02 20:17:18,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:17:18,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:17:18,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:17:18,752 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:17:18,753 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:17:18,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2022-11-02 20:17:18,825 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/data/04ccfa24b/9d8e09ec4011442881ddf9422b5d3330/FLAG85c53c456 [2022-11-02 20:17:19,343 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:17:19,344 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2022-11-02 20:17:19,359 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/data/04ccfa24b/9d8e09ec4011442881ddf9422b5d3330/FLAG85c53c456 [2022-11-02 20:17:19,630 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/data/04ccfa24b/9d8e09ec4011442881ddf9422b5d3330 [2022-11-02 20:17:19,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:17:19,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:17:19,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:17:19,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:17:19,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:17:19,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:17:19" (1/1) ... [2022-11-02 20:17:19,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c0f088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:19, skipping insertion in model container [2022-11-02 20:17:19,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:17:19" (1/1) ... [2022-11-02 20:17:19,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:17:19,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:17:19,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c[4099,4112] [2022-11-02 20:17:19,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:17:20,002 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:17:20,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c[4099,4112] [2022-11-02 20:17:20,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:17:20,076 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:17:20,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20 WrapperNode [2022-11-02 20:17:20,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:17:20,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:17:20,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:17:20,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:17:20,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,119 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,170 INFO L138 Inliner]: procedures = 27, calls = 76, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 603 [2022-11-02 20:17:20,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:17:20,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:17:20,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:17:20,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:17:20,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,255 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:17:20,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:17:20,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:17:20,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:17:20,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (1/1) ... [2022-11-02 20:17:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:17:20,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:20,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:17:20,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:17:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:17:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:17:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:17:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:17:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:17:20,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:17:20,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:17:20,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:17:20,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:17:20,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:17:20,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:17:20,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:17:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:17:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:17:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:17:20,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:17:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:17:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:17:20,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:17:20,401 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:17:20,625 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:17:20,640 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:17:21,741 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:17:22,514 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:17:22,515 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:17:22,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:22 BoogieIcfgContainer [2022-11-02 20:17:22,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:17:22,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:17:22,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:17:22,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:17:22,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:17:19" (1/3) ... [2022-11-02 20:17:22,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f90ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:22, skipping insertion in model container [2022-11-02 20:17:22,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:20" (2/3) ... [2022-11-02 20:17:22,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f90ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:22, skipping insertion in model container [2022-11-02 20:17:22,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:22" (3/3) ... [2022-11-02 20:17:22,535 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2022-11-02 20:17:22,548 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:17:22,561 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:17:22,561 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 93 error locations. [2022-11-02 20:17:22,562 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:17:22,732 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:17:22,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 408 places, 414 transitions, 860 flow [2022-11-02 20:17:23,029 INFO L130 PetriNetUnfolder]: 19/410 cut-off events. [2022-11-02 20:17:23,030 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:17:23,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 410 events. 19/410 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 564 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 325. Up to 2 conditions per place. [2022-11-02 20:17:23,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 408 places, 414 transitions, 860 flow [2022-11-02 20:17:23,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 383 places, 388 transitions, 800 flow [2022-11-02 20:17:23,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:17:23,065 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2cee10ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:17:23,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 167 error locations. [2022-11-02 20:17:23,072 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-11-02 20:17:23,072 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:17:23,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:23,073 INFO L208 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] [2022-11-02 20:17:23,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1031131335, now seen corresponding path program 1 times [2022-11-02 20:17:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:23,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574056701] [2022-11-02 20:17:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:23,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:23,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574056701] [2022-11-02 20:17:23,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574056701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:23,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:23,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:23,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727531914] [2022-11-02 20:17:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:23,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:23,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:23,439 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 414 [2022-11-02 20:17:23,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 388 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:23,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:23,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 414 [2022-11-02 20:17:23,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:24,175 INFO L130 PetriNetUnfolder]: 451/1182 cut-off events. [2022-11-02 20:17:24,175 INFO L131 PetriNetUnfolder]: For 162/233 co-relation queries the response was YES. [2022-11-02 20:17:24,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1924 conditions, 1182 events. 451/1182 cut-off events. For 162/233 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5153 event pairs, 272 based on Foata normal form. 183/1197 useless extension candidates. Maximal degree in co-relation 1540. Up to 615 conditions per place. [2022-11-02 20:17:24,193 INFO L137 encePairwiseOnDemand]: 330/414 looper letters, 26 selfloop transitions, 2 changer transitions 5/306 dead transitions. [2022-11-02 20:17:24,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 306 transitions, 692 flow [2022-11-02 20:17:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2022-11-02 20:17:24,222 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8180354267310789 [2022-11-02 20:17:24,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1016 transitions. [2022-11-02 20:17:24,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1016 transitions. [2022-11-02 20:17:24,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:24,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1016 transitions. [2022-11-02 20:17:24,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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-11-02 20:17:24,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:24,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:24,255 INFO L175 Difference]: Start difference. First operand has 383 places, 388 transitions, 800 flow. Second operand 3 states and 1016 transitions. [2022-11-02 20:17:24,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 306 transitions, 692 flow [2022-11-02 20:17:24,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 306 transitions, 676 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:17:24,277 INFO L231 Difference]: Finished difference. Result has 306 places, 301 transitions, 614 flow [2022-11-02 20:17:24,280 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=306, PETRI_TRANSITIONS=301} [2022-11-02 20:17:24,284 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -77 predicate places. [2022-11-02 20:17:24,285 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 301 transitions, 614 flow [2022-11-02 20:17:24,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:24,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:24,286 INFO L208 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-11-02 20:17:24,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:17:24,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1771780771, now seen corresponding path program 1 times [2022-11-02 20:17:24,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:24,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176137942] [2022-11-02 20:17:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:24,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:24,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176137942] [2022-11-02 20:17:24,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176137942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:24,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:24,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:24,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546441060] [2022-11-02 20:17:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:24,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:24,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:24,461 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 414 [2022-11-02 20:17:24,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 301 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:24,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:24,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 414 [2022-11-02 20:17:24,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:25,079 INFO L130 PetriNetUnfolder]: 451/1176 cut-off events. [2022-11-02 20:17:25,080 INFO L131 PetriNetUnfolder]: For 40/111 co-relation queries the response was YES. [2022-11-02 20:17:25,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 1176 events. 451/1176 cut-off events. For 40/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5118 event pairs, 272 based on Foata normal form. 0/1014 useless extension candidates. Maximal degree in co-relation 1795. Up to 615 conditions per place. [2022-11-02 20:17:25,091 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 26 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2022-11-02 20:17:25,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 668 flow [2022-11-02 20:17:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2022-11-02 20:17:25,094 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7528180354267311 [2022-11-02 20:17:25,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 935 transitions. [2022-11-02 20:17:25,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 935 transitions. [2022-11-02 20:17:25,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:25,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 935 transitions. [2022-11-02 20:17:25,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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-11-02 20:17:25,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:25,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:25,103 INFO L175 Difference]: Start difference. First operand has 306 places, 301 transitions, 614 flow. Second operand 3 states and 935 transitions. [2022-11-02 20:17:25,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 668 flow [2022-11-02 20:17:25,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 300 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:25,114 INFO L231 Difference]: Finished difference. Result has 300 places, 300 transitions, 612 flow [2022-11-02 20:17:25,115 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=298, 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=612, PETRI_PLACES=300, PETRI_TRANSITIONS=300} [2022-11-02 20:17:25,116 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -83 predicate places. [2022-11-02 20:17:25,116 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 300 transitions, 612 flow [2022-11-02 20:17:25,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:25,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:25,117 INFO L208 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] [2022-11-02 20:17:25,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:17:25,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash -443828394, now seen corresponding path program 1 times [2022-11-02 20:17:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:25,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050444882] [2022-11-02 20:17:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:25,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050444882] [2022-11-02 20:17:25,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050444882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:25,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:25,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038486376] [2022-11-02 20:17:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:25,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:25,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:25,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:25,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:25,249 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 414 [2022-11-02 20:17:25,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 300 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:25,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:25,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 414 [2022-11-02 20:17:25,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:25,727 INFO L130 PetriNetUnfolder]: 451/1175 cut-off events. [2022-11-02 20:17:25,727 INFO L131 PetriNetUnfolder]: For 40/111 co-relation queries the response was YES. [2022-11-02 20:17:25,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 1175 events. 451/1175 cut-off events. For 40/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5147 event pairs, 272 based on Foata normal form. 0/1014 useless extension candidates. Maximal degree in co-relation 1787. Up to 615 conditions per place. [2022-11-02 20:17:25,736 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 26 selfloop transitions, 2 changer transitions 0/299 dead transitions. [2022-11-02 20:17:25,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 299 transitions, 666 flow [2022-11-02 20:17:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2022-11-02 20:17:25,740 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7528180354267311 [2022-11-02 20:17:25,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 935 transitions. [2022-11-02 20:17:25,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 935 transitions. [2022-11-02 20:17:25,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:25,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 935 transitions. [2022-11-02 20:17:25,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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-11-02 20:17:25,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:25,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:25,747 INFO L175 Difference]: Start difference. First operand has 300 places, 300 transitions, 612 flow. Second operand 3 states and 935 transitions. [2022-11-02 20:17:25,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 299 transitions, 666 flow [2022-11-02 20:17:25,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 299 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:25,753 INFO L231 Difference]: Finished difference. Result has 299 places, 299 transitions, 610 flow [2022-11-02 20:17:25,754 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=297, 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=610, PETRI_PLACES=299, PETRI_TRANSITIONS=299} [2022-11-02 20:17:25,754 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -84 predicate places. [2022-11-02 20:17:25,755 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 299 transitions, 610 flow [2022-11-02 20:17:25,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:25,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:25,756 INFO L208 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] [2022-11-02 20:17:25,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:17:25,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:25,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1756209855, now seen corresponding path program 1 times [2022-11-02 20:17:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:25,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456823743] [2022-11-02 20:17:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:25,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:25,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:25,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456823743] [2022-11-02 20:17:25,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456823743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:25,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:25,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:25,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592234754] [2022-11-02 20:17:25,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:25,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:25,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:25,815 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 414 [2022-11-02 20:17:25,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 299 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:25,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:25,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 414 [2022-11-02 20:17:25,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:26,234 INFO L130 PetriNetUnfolder]: 451/1174 cut-off events. [2022-11-02 20:17:26,234 INFO L131 PetriNetUnfolder]: For 40/111 co-relation queries the response was YES. [2022-11-02 20:17:26,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1174 events. 451/1174 cut-off events. For 40/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5135 event pairs, 272 based on Foata normal form. 0/1014 useless extension candidates. Maximal degree in co-relation 1779. Up to 615 conditions per place. [2022-11-02 20:17:26,245 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 26 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2022-11-02 20:17:26,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 298 transitions, 664 flow [2022-11-02 20:17:26,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2022-11-02 20:17:26,253 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7528180354267311 [2022-11-02 20:17:26,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 935 transitions. [2022-11-02 20:17:26,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 935 transitions. [2022-11-02 20:17:26,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:26,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 935 transitions. [2022-11-02 20:17:26,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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-11-02 20:17:26,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:26,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:26,264 INFO L175 Difference]: Start difference. First operand has 299 places, 299 transitions, 610 flow. Second operand 3 states and 935 transitions. [2022-11-02 20:17:26,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 298 transitions, 664 flow [2022-11-02 20:17:26,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 298 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:26,271 INFO L231 Difference]: Finished difference. Result has 298 places, 298 transitions, 608 flow [2022-11-02 20:17:26,272 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=296, 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=608, PETRI_PLACES=298, PETRI_TRANSITIONS=298} [2022-11-02 20:17:26,273 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -85 predicate places. [2022-11-02 20:17:26,274 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 298 transitions, 608 flow [2022-11-02 20:17:26,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:26,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:26,275 INFO L208 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] [2022-11-02 20:17:26,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:17:26,276 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1953487152, now seen corresponding path program 1 times [2022-11-02 20:17:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:26,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266442835] [2022-11-02 20:17:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:26,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266442835] [2022-11-02 20:17:26,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266442835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:26,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:26,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:26,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82261405] [2022-11-02 20:17:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:26,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:26,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:26,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:26,379 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 414 [2022-11-02 20:17:26,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 298 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:26,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:26,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 414 [2022-11-02 20:17:26,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:26,860 INFO L130 PetriNetUnfolder]: 451/1173 cut-off events. [2022-11-02 20:17:26,860 INFO L131 PetriNetUnfolder]: For 40/111 co-relation queries the response was YES. [2022-11-02 20:17:26,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1173 events. 451/1173 cut-off events. For 40/111 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5123 event pairs, 272 based on Foata normal form. 0/1014 useless extension candidates. Maximal degree in co-relation 1771. Up to 615 conditions per place. [2022-11-02 20:17:26,871 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 26 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-11-02 20:17:26,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 297 transitions, 662 flow [2022-11-02 20:17:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2022-11-02 20:17:26,874 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7528180354267311 [2022-11-02 20:17:26,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 935 transitions. [2022-11-02 20:17:26,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 935 transitions. [2022-11-02 20:17:26,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:26,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 935 transitions. [2022-11-02 20:17:26,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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-11-02 20:17:26,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:26,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:26,883 INFO L175 Difference]: Start difference. First operand has 298 places, 298 transitions, 608 flow. Second operand 3 states and 935 transitions. [2022-11-02 20:17:26,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 297 transitions, 662 flow [2022-11-02 20:17:26,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 297 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:26,889 INFO L231 Difference]: Finished difference. Result has 297 places, 297 transitions, 606 flow [2022-11-02 20:17:26,890 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=297, PETRI_TRANSITIONS=297} [2022-11-02 20:17:26,893 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -86 predicate places. [2022-11-02 20:17:26,894 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 297 transitions, 606 flow [2022-11-02 20:17:26,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:26,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:26,895 INFO L208 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] [2022-11-02 20:17:26,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:17:26,896 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1772072742, now seen corresponding path program 1 times [2022-11-02 20:17:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:26,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567680472] [2022-11-02 20:17:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:27,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567680472] [2022-11-02 20:17:27,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567680472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:27,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:27,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:27,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019257051] [2022-11-02 20:17:27,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:27,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:27,021 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:27,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 297 transitions, 606 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:27,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:27,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:27,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:27,541 INFO L130 PetriNetUnfolder]: 595/1535 cut-off events. [2022-11-02 20:17:27,542 INFO L131 PetriNetUnfolder]: For 57/157 co-relation queries the response was YES. [2022-11-02 20:17:27,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 1535 events. 595/1535 cut-off events. For 57/157 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7602 event pairs, 171 based on Foata normal form. 0/1331 useless extension candidates. Maximal degree in co-relation 2326. Up to 436 conditions per place. [2022-11-02 20:17:27,557 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 37 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2022-11-02 20:17:27,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 311 transitions, 717 flow [2022-11-02 20:17:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:27,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2022-11-02 20:17:27,560 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7689210950080515 [2022-11-02 20:17:27,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 955 transitions. [2022-11-02 20:17:27,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 955 transitions. [2022-11-02 20:17:27,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:27,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 955 transitions. [2022-11-02 20:17:27,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 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-11-02 20:17:27,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:27,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:27,568 INFO L175 Difference]: Start difference. First operand has 297 places, 297 transitions, 606 flow. Second operand 3 states and 955 transitions. [2022-11-02 20:17:27,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 311 transitions, 717 flow [2022-11-02 20:17:27,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 311 transitions, 713 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:27,576 INFO L231 Difference]: Finished difference. Result has 297 places, 297 transitions, 610 flow [2022-11-02 20:17:27,576 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=297, PETRI_TRANSITIONS=297} [2022-11-02 20:17:27,577 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -86 predicate places. [2022-11-02 20:17:27,577 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 297 transitions, 610 flow [2022-11-02 20:17:27,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:27,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:27,578 INFO L208 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] [2022-11-02 20:17:27,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:17:27,579 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:27,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash 693310660, now seen corresponding path program 1 times [2022-11-02 20:17:27,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:27,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113690092] [2022-11-02 20:17:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:27,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:27,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113690092] [2022-11-02 20:17:27,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113690092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:27,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:27,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061805451] [2022-11-02 20:17:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:27,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:27,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:27,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:27,631 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:27,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 297 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:27,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:27,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:27,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:28,143 INFO L130 PetriNetUnfolder]: 595/1522 cut-off events. [2022-11-02 20:17:28,144 INFO L131 PetriNetUnfolder]: For 153/253 co-relation queries the response was YES. [2022-11-02 20:17:28,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 1522 events. 595/1522 cut-off events. For 153/253 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7771 event pairs, 375 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 1223. Up to 808 conditions per place. [2022-11-02 20:17:28,164 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 24 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-11-02 20:17:28,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 296 transitions, 660 flow [2022-11-02 20:17:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-11-02 20:17:28,169 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7576489533011272 [2022-11-02 20:17:28,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-11-02 20:17:28,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-11-02 20:17:28,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:28,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-11-02 20:17:28,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 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-11-02 20:17:28,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:28,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:28,178 INFO L175 Difference]: Start difference. First operand has 297 places, 297 transitions, 610 flow. Second operand 3 states and 941 transitions. [2022-11-02 20:17:28,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 296 transitions, 660 flow [2022-11-02 20:17:28,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 296 transitions, 658 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:17:28,187 INFO L231 Difference]: Finished difference. Result has 297 places, 296 transitions, 610 flow [2022-11-02 20:17:28,188 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=295, 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=610, PETRI_PLACES=297, PETRI_TRANSITIONS=296} [2022-11-02 20:17:28,189 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -86 predicate places. [2022-11-02 20:17:28,190 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 296 transitions, 610 flow [2022-11-02 20:17:28,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:28,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:28,191 INFO L208 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] [2022-11-02 20:17:28,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:17:28,191 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 231860542, now seen corresponding path program 1 times [2022-11-02 20:17:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:28,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970414319] [2022-11-02 20:17:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:28,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:28,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970414319] [2022-11-02 20:17:28,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970414319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:28,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:28,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:28,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608561226] [2022-11-02 20:17:28,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:28,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:28,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:28,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:28,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:28,275 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 414 [2022-11-02 20:17:28,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 296 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:28,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:28,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 414 [2022-11-02 20:17:28,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:28,756 INFO L130 PetriNetUnfolder]: 595/1521 cut-off events. [2022-11-02 20:17:28,756 INFO L131 PetriNetUnfolder]: For 152/252 co-relation queries the response was YES. [2022-11-02 20:17:28,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 1521 events. 595/1521 cut-off events. For 152/252 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7748 event pairs, 375 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 2406. Up to 811 conditions per place. [2022-11-02 20:17:28,769 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 27 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2022-11-02 20:17:28,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 295 transitions, 666 flow [2022-11-02 20:17:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2022-11-02 20:17:28,772 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7528180354267311 [2022-11-02 20:17:28,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 935 transitions. [2022-11-02 20:17:28,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 935 transitions. [2022-11-02 20:17:28,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:28,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 935 transitions. [2022-11-02 20:17:28,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 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-11-02 20:17:28,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:28,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:28,779 INFO L175 Difference]: Start difference. First operand has 297 places, 296 transitions, 610 flow. Second operand 3 states and 935 transitions. [2022-11-02 20:17:28,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 295 transitions, 666 flow [2022-11-02 20:17:28,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 295 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:28,786 INFO L231 Difference]: Finished difference. Result has 296 places, 295 transitions, 608 flow [2022-11-02 20:17:28,786 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=296, PETRI_TRANSITIONS=295} [2022-11-02 20:17:28,787 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:28,787 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 295 transitions, 608 flow [2022-11-02 20:17:28,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 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-11-02 20:17:28,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:28,788 INFO L208 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] [2022-11-02 20:17:28,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:17:28,789 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:28,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1753309315, now seen corresponding path program 1 times [2022-11-02 20:17:28,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:28,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160341652] [2022-11-02 20:17:28,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:28,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:28,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:28,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:28,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160341652] [2022-11-02 20:17:28,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160341652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:28,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:28,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213345907] [2022-11-02 20:17:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:28,839 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:28,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 295 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:28,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:28,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:28,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:29,534 INFO L130 PetriNetUnfolder]: 749/2132 cut-off events. [2022-11-02 20:17:29,535 INFO L131 PetriNetUnfolder]: For 199/298 co-relation queries the response was YES. [2022-11-02 20:17:29,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 2132 events. 749/2132 cut-off events. For 199/298 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 12645 event pairs, 280 based on Foata normal form. 0/1851 useless extension candidates. Maximal degree in co-relation 3241. Up to 544 conditions per place. [2022-11-02 20:17:29,555 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 38 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2022-11-02 20:17:29,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 309 transitions, 724 flow [2022-11-02 20:17:29,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:29,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 954 transitions. [2022-11-02 20:17:29,559 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7681159420289855 [2022-11-02 20:17:29,559 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 954 transitions. [2022-11-02 20:17:29,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 954 transitions. [2022-11-02 20:17:29,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:29,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 954 transitions. [2022-11-02 20:17:29,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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-11-02 20:17:29,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:29,568 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:29,568 INFO L175 Difference]: Start difference. First operand has 296 places, 295 transitions, 608 flow. Second operand 3 states and 954 transitions. [2022-11-02 20:17:29,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 309 transitions, 724 flow [2022-11-02 20:17:29,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 309 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:29,579 INFO L231 Difference]: Finished difference. Result has 296 places, 295 transitions, 612 flow [2022-11-02 20:17:29,580 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=296, PETRI_TRANSITIONS=295} [2022-11-02 20:17:29,581 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:29,582 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 295 transitions, 612 flow [2022-11-02 20:17:29,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:29,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:29,583 INFO L208 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] [2022-11-02 20:17:29,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:17:29,583 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:29,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1931570271, now seen corresponding path program 1 times [2022-11-02 20:17:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:29,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59526574] [2022-11-02 20:17:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:29,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59526574] [2022-11-02 20:17:29,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59526574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:29,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:29,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149077467] [2022-11-02 20:17:29,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:29,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:29,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:29,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:29,691 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:29,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 295 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:29,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:29,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:29,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:30,361 INFO L130 PetriNetUnfolder]: 749/1951 cut-off events. [2022-11-02 20:17:30,361 INFO L131 PetriNetUnfolder]: For 307/436 co-relation queries the response was YES. [2022-11-02 20:17:30,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1951 events. 749/1951 cut-off events. For 307/436 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11356 event pairs, 488 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 1843. Up to 1018 conditions per place. [2022-11-02 20:17:30,378 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 25 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2022-11-02 20:17:30,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 294 transitions, 664 flow [2022-11-02 20:17:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-11-02 20:17:30,382 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7576489533011272 [2022-11-02 20:17:30,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-11-02 20:17:30,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-11-02 20:17:30,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:30,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-11-02 20:17:30,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 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-11-02 20:17:30,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:30,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:30,389 INFO L175 Difference]: Start difference. First operand has 296 places, 295 transitions, 612 flow. Second operand 3 states and 941 transitions. [2022-11-02 20:17:30,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 294 transitions, 664 flow [2022-11-02 20:17:30,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 294 transitions, 662 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:17:30,396 INFO L231 Difference]: Finished difference. Result has 296 places, 294 transitions, 612 flow [2022-11-02 20:17:30,397 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=296, PETRI_TRANSITIONS=294} [2022-11-02 20:17:30,397 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:30,398 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 294 transitions, 612 flow [2022-11-02 20:17:30,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:30,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:30,399 INFO L208 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] [2022-11-02 20:17:30,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:17:30,399 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:30,400 INFO L85 PathProgramCache]: Analyzing trace with hash -560383611, now seen corresponding path program 1 times [2022-11-02 20:17:30,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:30,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620105073] [2022-11-02 20:17:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:30,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:30,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620105073] [2022-11-02 20:17:30,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620105073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:30,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:30,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:30,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992119186] [2022-11-02 20:17:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:30,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:30,444 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:30,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 294 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:30,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:30,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:30,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:31,044 INFO L130 PetriNetUnfolder]: 749/1950 cut-off events. [2022-11-02 20:17:31,044 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:17:31,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 1950 events. 749/1950 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11295 event pairs, 488 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 3160. Up to 1016 conditions per place. [2022-11-02 20:17:31,062 INFO L137 encePairwiseOnDemand]: 412/414 looper letters, 25 selfloop transitions, 1 changer transitions 0/293 dead transitions. [2022-11-02 20:17:31,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 293 transitions, 662 flow [2022-11-02 20:17:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2022-11-02 20:17:31,066 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568438003220612 [2022-11-02 20:17:31,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2022-11-02 20:17:31,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2022-11-02 20:17:31,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:31,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2022-11-02 20:17:31,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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-11-02 20:17:31,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:31,072 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:31,073 INFO L175 Difference]: Start difference. First operand has 296 places, 294 transitions, 612 flow. Second operand 3 states and 940 transitions. [2022-11-02 20:17:31,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 293 transitions, 662 flow [2022-11-02 20:17:31,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 293 transitions, 658 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:31,079 INFO L231 Difference]: Finished difference. Result has 295 places, 293 transitions, 608 flow [2022-11-02 20:17:31,080 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=295, PETRI_TRANSITIONS=293} [2022-11-02 20:17:31,081 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -88 predicate places. [2022-11-02 20:17:31,081 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 293 transitions, 608 flow [2022-11-02 20:17:31,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:31,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:31,082 INFO L208 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] [2022-11-02 20:17:31,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:17:31,082 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:31,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash -690374382, now seen corresponding path program 1 times [2022-11-02 20:17:31,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:31,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921358498] [2022-11-02 20:17:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:31,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:31,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921358498] [2022-11-02 20:17:31,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921358498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:31,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:31,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624189370] [2022-11-02 20:17:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:31,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:31,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:31,139 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:31,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 293 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:31,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:31,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:31,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:31,728 INFO L130 PetriNetUnfolder]: 749/1949 cut-off events. [2022-11-02 20:17:31,728 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:17:31,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 1949 events. 749/1949 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11316 event pairs, 488 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 3160. Up to 1018 conditions per place. [2022-11-02 20:17:31,746 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 25 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2022-11-02 20:17:31,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 292 transitions, 660 flow [2022-11-02 20:17:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:31,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-11-02 20:17:31,752 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7576489533011272 [2022-11-02 20:17:31,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-11-02 20:17:31,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-11-02 20:17:31,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:31,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-11-02 20:17:31,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 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-11-02 20:17:31,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:31,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:31,760 INFO L175 Difference]: Start difference. First operand has 295 places, 293 transitions, 608 flow. Second operand 3 states and 941 transitions. [2022-11-02 20:17:31,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 292 transitions, 660 flow [2022-11-02 20:17:31,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 292 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:17:31,767 INFO L231 Difference]: Finished difference. Result has 295 places, 292 transitions, 609 flow [2022-11-02 20:17:31,768 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=609, PETRI_PLACES=295, PETRI_TRANSITIONS=292} [2022-11-02 20:17:31,769 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -88 predicate places. [2022-11-02 20:17:31,769 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 292 transitions, 609 flow [2022-11-02 20:17:31,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:31,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:31,771 INFO L208 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] [2022-11-02 20:17:31,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:17:31,771 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1889358665, now seen corresponding path program 1 times [2022-11-02 20:17:31,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:31,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777396095] [2022-11-02 20:17:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:31,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:32,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777396095] [2022-11-02 20:17:32,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777396095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:32,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:32,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642181458] [2022-11-02 20:17:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:32,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:32,333 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 414 [2022-11-02 20:17:32,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 609 flow. Second operand has 6 states, 6 states have (on average 254.83333333333334) internal successors, (1529), 6 states have internal predecessors, (1529), 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-11-02 20:17:32,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:32,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 414 [2022-11-02 20:17:32,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:35,739 INFO L130 PetriNetUnfolder]: 5309/8105 cut-off events. [2022-11-02 20:17:35,740 INFO L131 PetriNetUnfolder]: For 1502/1502 co-relation queries the response was YES. [2022-11-02 20:17:35,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16568 conditions, 8105 events. 5309/8105 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 41624 event pairs, 3740 based on Foata normal form. 0/7619 useless extension candidates. Maximal degree in co-relation 16474. Up to 6893 conditions per place. [2022-11-02 20:17:35,816 INFO L137 encePairwiseOnDemand]: 402/414 looper letters, 68 selfloop transitions, 10 changer transitions 0/290 dead transitions. [2022-11-02 20:17:35,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 290 transitions, 761 flow [2022-11-02 20:17:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:17:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1596 transitions. [2022-11-02 20:17:35,822 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.642512077294686 [2022-11-02 20:17:35,823 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1596 transitions. [2022-11-02 20:17:35,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1596 transitions. [2022-11-02 20:17:35,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:35,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1596 transitions. [2022-11-02 20:17:35,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 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-11-02 20:17:35,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:35,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:35,834 INFO L175 Difference]: Start difference. First operand has 295 places, 292 transitions, 609 flow. Second operand 6 states and 1596 transitions. [2022-11-02 20:17:35,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 290 transitions, 761 flow [2022-11-02 20:17:35,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 290 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:35,844 INFO L231 Difference]: Finished difference. Result has 296 places, 290 transitions, 621 flow [2022-11-02 20:17:35,845 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=621, PETRI_PLACES=296, PETRI_TRANSITIONS=290} [2022-11-02 20:17:35,846 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:35,847 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 290 transitions, 621 flow [2022-11-02 20:17:35,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 254.83333333333334) internal successors, (1529), 6 states have internal predecessors, (1529), 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-11-02 20:17:35,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:35,849 INFO L208 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] [2022-11-02 20:17:35,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:17:35,850 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash -179044634, now seen corresponding path program 1 times [2022-11-02 20:17:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:35,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540018102] [2022-11-02 20:17:35,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:35,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:35,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:35,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540018102] [2022-11-02 20:17:35,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540018102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:35,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:35,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503836389] [2022-11-02 20:17:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:35,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:35,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:35,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:35,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:35,933 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:35,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 290 transitions, 621 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:35,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:35,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:35,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:36,609 INFO L130 PetriNetUnfolder]: 749/1946 cut-off events. [2022-11-02 20:17:36,609 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:17:36,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 1946 events. 749/1946 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11321 event pairs, 488 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 3226. Up to 1016 conditions per place. [2022-11-02 20:17:36,625 INFO L137 encePairwiseOnDemand]: 412/414 looper letters, 25 selfloop transitions, 1 changer transitions 0/289 dead transitions. [2022-11-02 20:17:36,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 289 transitions, 671 flow [2022-11-02 20:17:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2022-11-02 20:17:36,629 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568438003220612 [2022-11-02 20:17:36,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2022-11-02 20:17:36,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2022-11-02 20:17:36,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:36,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2022-11-02 20:17:36,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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-11-02 20:17:36,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:36,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:36,636 INFO L175 Difference]: Start difference. First operand has 296 places, 290 transitions, 621 flow. Second operand 3 states and 940 transitions. [2022-11-02 20:17:36,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 289 transitions, 671 flow [2022-11-02 20:17:36,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 651 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:17:36,643 INFO L231 Difference]: Finished difference. Result has 292 places, 289 transitions, 601 flow [2022-11-02 20:17:36,644 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=292, PETRI_TRANSITIONS=289} [2022-11-02 20:17:36,645 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -91 predicate places. [2022-11-02 20:17:36,645 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 289 transitions, 601 flow [2022-11-02 20:17:36,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:36,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:36,646 INFO L208 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] [2022-11-02 20:17:36,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:17:36,646 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash 708606169, now seen corresponding path program 1 times [2022-11-02 20:17:36,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:36,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944312253] [2022-11-02 20:17:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:36,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:36,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944312253] [2022-11-02 20:17:36,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944312253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:36,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:36,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:36,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490840743] [2022-11-02 20:17:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:36,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:36,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:36,727 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:36,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 289 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:36,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:36,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:36,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:37,360 INFO L130 PetriNetUnfolder]: 749/1945 cut-off events. [2022-11-02 20:17:37,360 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:17:37,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1945 events. 749/1945 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11268 event pairs, 488 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 3157. Up to 1018 conditions per place. [2022-11-02 20:17:37,380 INFO L137 encePairwiseOnDemand]: 411/414 looper letters, 25 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2022-11-02 20:17:37,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 288 transitions, 653 flow [2022-11-02 20:17:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-11-02 20:17:37,384 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7576489533011272 [2022-11-02 20:17:37,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-11-02 20:17:37,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-11-02 20:17:37,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:37,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-11-02 20:17:37,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 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-11-02 20:17:37,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:37,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:37,391 INFO L175 Difference]: Start difference. First operand has 292 places, 289 transitions, 601 flow. Second operand 3 states and 941 transitions. [2022-11-02 20:17:37,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 288 transitions, 653 flow [2022-11-02 20:17:37,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 288 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:17:37,400 INFO L231 Difference]: Finished difference. Result has 292 places, 288 transitions, 602 flow [2022-11-02 20:17:37,401 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=292, PETRI_TRANSITIONS=288} [2022-11-02 20:17:37,402 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -91 predicate places. [2022-11-02 20:17:37,402 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 288 transitions, 602 flow [2022-11-02 20:17:37,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:37,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:37,403 INFO L208 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] [2022-11-02 20:17:37,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:17:37,403 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1448950711, now seen corresponding path program 1 times [2022-11-02 20:17:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:37,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763656138] [2022-11-02 20:17:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:37,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763656138] [2022-11-02 20:17:37,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763656138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:37,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:37,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861099802] [2022-11-02 20:17:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:37,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:37,490 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:37,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 288 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:37,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:37,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:37,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:38,235 INFO L130 PetriNetUnfolder]: 749/1944 cut-off events. [2022-11-02 20:17:38,236 INFO L131 PetriNetUnfolder]: For 306/435 co-relation queries the response was YES. [2022-11-02 20:17:38,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1944 events. 749/1944 cut-off events. For 306/435 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11249 event pairs, 488 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 3156. Up to 1016 conditions per place. [2022-11-02 20:17:38,258 INFO L137 encePairwiseOnDemand]: 412/414 looper letters, 25 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2022-11-02 20:17:38,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 287 transitions, 652 flow [2022-11-02 20:17:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2022-11-02 20:17:38,262 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568438003220612 [2022-11-02 20:17:38,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2022-11-02 20:17:38,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2022-11-02 20:17:38,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:38,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2022-11-02 20:17:38,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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-11-02 20:17:38,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:38,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:38,271 INFO L175 Difference]: Start difference. First operand has 292 places, 288 transitions, 602 flow. Second operand 3 states and 940 transitions. [2022-11-02 20:17:38,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 287 transitions, 652 flow [2022-11-02 20:17:38,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 287 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:17:38,279 INFO L231 Difference]: Finished difference. Result has 291 places, 287 transitions, 598 flow [2022-11-02 20:17:38,280 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=291, PETRI_TRANSITIONS=287} [2022-11-02 20:17:38,280 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -92 predicate places. [2022-11-02 20:17:38,281 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 287 transitions, 598 flow [2022-11-02 20:17:38,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:38,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:38,282 INFO L208 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] [2022-11-02 20:17:38,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:17:38,282 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash 745499468, now seen corresponding path program 1 times [2022-11-02 20:17:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:38,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734016355] [2022-11-02 20:17:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:38,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-11-02 20:17:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:38,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734016355] [2022-11-02 20:17:38,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734016355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:38,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:38,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:38,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20928172] [2022-11-02 20:17:38,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:38,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:38,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:38,388 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 414 [2022-11-02 20:17:38,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 287 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:38,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:38,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 414 [2022-11-02 20:17:38,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:39,156 INFO L130 PetriNetUnfolder]: 758/2009 cut-off events. [2022-11-02 20:17:39,157 INFO L131 PetriNetUnfolder]: For 306/397 co-relation queries the response was YES. [2022-11-02 20:17:39,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 2009 events. 758/2009 cut-off events. For 306/397 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11763 event pairs, 401 based on Foata normal form. 0/1745 useless extension candidates. Maximal degree in co-relation 3238. Up to 1026 conditions per place. [2022-11-02 20:17:39,172 INFO L137 encePairwiseOnDemand]: 408/414 looper letters, 29 selfloop transitions, 5 changer transitions 0/294 dead transitions. [2022-11-02 20:17:39,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 294 transitions, 684 flow [2022-11-02 20:17:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2022-11-02 20:17:39,175 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7632850241545893 [2022-11-02 20:17:39,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 948 transitions. [2022-11-02 20:17:39,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 948 transitions. [2022-11-02 20:17:39,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:39,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 948 transitions. [2022-11-02 20:17:39,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 316.0) internal successors, (948), 3 states have internal predecessors, (948), 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-11-02 20:17:39,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:39,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:39,182 INFO L175 Difference]: Start difference. First operand has 291 places, 287 transitions, 598 flow. Second operand 3 states and 948 transitions. [2022-11-02 20:17:39,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 294 transitions, 684 flow [2022-11-02 20:17:39,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 294 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:17:39,188 INFO L231 Difference]: Finished difference. Result has 292 places, 290 transitions, 626 flow [2022-11-02 20:17:39,189 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=292, PETRI_TRANSITIONS=290} [2022-11-02 20:17:39,189 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -91 predicate places. [2022-11-02 20:17:39,189 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 290 transitions, 626 flow [2022-11-02 20:17:39,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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-11-02 20:17:39,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:39,190 INFO L208 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] [2022-11-02 20:17:39,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:17:39,191 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash -321887382, now seen corresponding path program 1 times [2022-11-02 20:17:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716730674] [2022-11-02 20:17:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:39,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:39,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716730674] [2022-11-02 20:17:39,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716730674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:39,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:39,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858225697] [2022-11-02 20:17:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:40,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:40,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:40,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:40,003 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 414 [2022-11-02 20:17:40,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 290 transitions, 626 flow. Second operand has 6 states, 6 states have (on average 271.1666666666667) internal successors, (1627), 6 states have internal predecessors, (1627), 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-11-02 20:17:40,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:40,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 414 [2022-11-02 20:17:40,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:42,425 INFO L130 PetriNetUnfolder]: 5342/8171 cut-off events. [2022-11-02 20:17:42,425 INFO L131 PetriNetUnfolder]: For 2964/2964 co-relation queries the response was YES. [2022-11-02 20:17:42,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18300 conditions, 8171 events. 5342/8171 cut-off events. For 2964/2964 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 41712 event pairs, 616 based on Foata normal form. 0/7840 useless extension candidates. Maximal degree in co-relation 18204. Up to 3246 conditions per place. [2022-11-02 20:17:42,499 INFO L137 encePairwiseOnDemand]: 409/414 looper letters, 131 selfloop transitions, 4 changer transitions 0/361 dead transitions. [2022-11-02 20:17:42,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 361 transitions, 1150 flow [2022-11-02 20:17:42,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:17:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1720 transitions. [2022-11-02 20:17:42,505 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6924315619967794 [2022-11-02 20:17:42,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1720 transitions. [2022-11-02 20:17:42,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1720 transitions. [2022-11-02 20:17:42,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:42,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1720 transitions. [2022-11-02 20:17:42,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.6666666666667) internal successors, (1720), 6 states have internal predecessors, (1720), 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-11-02 20:17:42,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:42,517 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:42,517 INFO L175 Difference]: Start difference. First operand has 292 places, 290 transitions, 626 flow. Second operand 6 states and 1720 transitions. [2022-11-02 20:17:42,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 361 transitions, 1150 flow [2022-11-02 20:17:42,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 361 transitions, 1150 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:17:42,526 INFO L231 Difference]: Finished difference. Result has 296 places, 289 transitions, 632 flow [2022-11-02 20:17:42,526 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=632, PETRI_PLACES=296, PETRI_TRANSITIONS=289} [2022-11-02 20:17:42,527 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:42,527 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 289 transitions, 632 flow [2022-11-02 20:17:42,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 271.1666666666667) internal successors, (1627), 6 states have internal predecessors, (1627), 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-11-02 20:17:42,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:42,528 INFO L208 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, 1, 1, 1, 1] [2022-11-02 20:17:42,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:17:42,529 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:42,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -444916475, now seen corresponding path program 1 times [2022-11-02 20:17:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:42,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078748232] [2022-11-02 20:17:42,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078748232] [2022-11-02 20:17:43,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078748232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:43,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:43,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:43,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017715324] [2022-11-02 20:17:43,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:43,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:43,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:43,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:43,205 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 414 [2022-11-02 20:17:43,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 289 transitions, 632 flow. Second operand has 6 states, 6 states have (on average 272.3333333333333) internal successors, (1634), 6 states have internal predecessors, (1634), 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-11-02 20:17:43,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:43,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 414 [2022-11-02 20:17:43,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:45,594 INFO L130 PetriNetUnfolder]: 4766/7420 cut-off events. [2022-11-02 20:17:45,594 INFO L131 PetriNetUnfolder]: For 2939/2939 co-relation queries the response was YES. [2022-11-02 20:17:45,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17094 conditions, 7420 events. 4766/7420 cut-off events. For 2939/2939 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 37992 event pairs, 2198 based on Foata normal form. 0/7118 useless extension candidates. Maximal degree in co-relation 16997. Up to 4798 conditions per place. [2022-11-02 20:17:45,670 INFO L137 encePairwiseOnDemand]: 409/414 looper letters, 102 selfloop transitions, 4 changer transitions 0/332 dead transitions. [2022-11-02 20:17:45,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 332 transitions, 986 flow [2022-11-02 20:17:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:45,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:17:45,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1707 transitions. [2022-11-02 20:17:45,681 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6871980676328503 [2022-11-02 20:17:45,681 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1707 transitions. [2022-11-02 20:17:45,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1707 transitions. [2022-11-02 20:17:45,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:45,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1707 transitions. [2022-11-02 20:17:45,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.5) internal successors, (1707), 6 states have internal predecessors, (1707), 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-11-02 20:17:45,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:45,696 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:45,696 INFO L175 Difference]: Start difference. First operand has 296 places, 289 transitions, 632 flow. Second operand 6 states and 1707 transitions. [2022-11-02 20:17:45,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 332 transitions, 986 flow [2022-11-02 20:17:45,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 332 transitions, 979 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:17:45,708 INFO L231 Difference]: Finished difference. Result has 296 places, 288 transitions, 631 flow [2022-11-02 20:17:45,709 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=631, PETRI_PLACES=296, PETRI_TRANSITIONS=288} [2022-11-02 20:17:45,709 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:45,709 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 288 transitions, 631 flow [2022-11-02 20:17:45,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 272.3333333333333) internal successors, (1634), 6 states have internal predecessors, (1634), 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-11-02 20:17:45,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:45,711 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:45,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:17:45,711 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:45,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash -825506301, now seen corresponding path program 1 times [2022-11-02 20:17:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:45,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838646824] [2022-11-02 20:17:45,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:45,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838646824] [2022-11-02 20:17:46,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838646824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:46,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:46,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695510671] [2022-11-02 20:17:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:46,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:46,564 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 414 [2022-11-02 20:17:46,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 288 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 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-11-02 20:17:46,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:46,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 414 [2022-11-02 20:17:46,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:48,762 INFO L130 PetriNetUnfolder]: 4638/7300 cut-off events. [2022-11-02 20:17:48,762 INFO L131 PetriNetUnfolder]: For 2624/2624 co-relation queries the response was YES. [2022-11-02 20:17:48,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16480 conditions, 7300 events. 4638/7300 cut-off events. For 2624/2624 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 37601 event pairs, 2670 based on Foata normal form. 0/7009 useless extension candidates. Maximal degree in co-relation 16383. Up to 5684 conditions per place. [2022-11-02 20:17:48,824 INFO L137 encePairwiseOnDemand]: 409/414 looper letters, 89 selfloop transitions, 4 changer transitions 0/319 dead transitions. [2022-11-02 20:17:48,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 319 transitions, 927 flow [2022-11-02 20:17:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:17:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1694 transitions. [2022-11-02 20:17:48,830 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6819645732689211 [2022-11-02 20:17:48,830 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1694 transitions. [2022-11-02 20:17:48,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1694 transitions. [2022-11-02 20:17:48,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:48,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1694 transitions. [2022-11-02 20:17:48,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-11-02 20:17:48,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:48,842 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:48,842 INFO L175 Difference]: Start difference. First operand has 296 places, 288 transitions, 631 flow. Second operand 6 states and 1694 transitions. [2022-11-02 20:17:48,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 319 transitions, 927 flow [2022-11-02 20:17:48,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 319 transitions, 920 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:17:48,852 INFO L231 Difference]: Finished difference. Result has 296 places, 287 transitions, 630 flow [2022-11-02 20:17:48,853 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=296, PETRI_TRANSITIONS=287} [2022-11-02 20:17:48,853 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:48,854 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 287 transitions, 630 flow [2022-11-02 20:17:48,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 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-11-02 20:17:48,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:48,855 INFO L208 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, 1, 1, 1, 1, 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-11-02 20:17:48,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:17:48,855 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash 241232944, now seen corresponding path program 1 times [2022-11-02 20:17:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:48,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934053386] [2022-11-02 20:17:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:49,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934053386] [2022-11-02 20:17:49,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934053386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:49,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:49,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334992591] [2022-11-02 20:17:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:49,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:49,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:49,644 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 414 [2022-11-02 20:17:49,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 287 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 274.6666666666667) internal successors, (1648), 6 states have internal predecessors, (1648), 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-11-02 20:17:49,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:49,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 414 [2022-11-02 20:17:49,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:52,067 INFO L130 PetriNetUnfolder]: 4697/7363 cut-off events. [2022-11-02 20:17:52,067 INFO L131 PetriNetUnfolder]: For 2609/2609 co-relation queries the response was YES. [2022-11-02 20:17:52,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16556 conditions, 7363 events. 4697/7363 cut-off events. For 2609/2609 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 37671 event pairs, 2829 based on Foata normal form. 0/7104 useless extension candidates. Maximal degree in co-relation 16459. Up to 6026 conditions per place. [2022-11-02 20:17:52,125 INFO L137 encePairwiseOnDemand]: 409/414 looper letters, 72 selfloop transitions, 4 changer transitions 0/302 dead transitions. [2022-11-02 20:17:52,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 302 transitions, 836 flow [2022-11-02 20:17:52,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:17:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1681 transitions. [2022-11-02 20:17:52,130 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.676731078904992 [2022-11-02 20:17:52,131 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1681 transitions. [2022-11-02 20:17:52,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1681 transitions. [2022-11-02 20:17:52,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:52,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1681 transitions. [2022-11-02 20:17:52,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 280.1666666666667) internal successors, (1681), 6 states have internal predecessors, (1681), 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-11-02 20:17:52,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:52,142 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 414.0) internal successors, (2898), 7 states have internal predecessors, (2898), 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-11-02 20:17:52,142 INFO L175 Difference]: Start difference. First operand has 296 places, 287 transitions, 630 flow. Second operand 6 states and 1681 transitions. [2022-11-02 20:17:52,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 302 transitions, 836 flow [2022-11-02 20:17:52,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 302 transitions, 829 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:17:52,149 INFO L231 Difference]: Finished difference. Result has 296 places, 286 transitions, 629 flow [2022-11-02 20:17:52,150 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=629, PETRI_PLACES=296, PETRI_TRANSITIONS=286} [2022-11-02 20:17:52,150 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -87 predicate places. [2022-11-02 20:17:52,150 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 286 transitions, 629 flow [2022-11-02 20:17:52,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.6666666666667) internal successors, (1648), 6 states have internal predecessors, (1648), 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-11-02 20:17:52,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:17:52,151 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 20:17:52,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:17:52,152 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 163 more)] === [2022-11-02 20:17:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:52,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1455922208, now seen corresponding path program 1 times [2022-11-02 20:17:52,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:52,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945979506] [2022-11-02 20:17:52,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:52,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:52,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:52,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945979506] [2022-11-02 20:17:52,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945979506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:52,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:52,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:17:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213559514] [2022-11-02 20:17:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:17:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:17:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:17:52,260 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 414 [2022-11-02 20:17:52,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 286 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 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-11-02 20:17:52,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:17:52,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 414 [2022-11-02 20:17:52,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:17:52,870 INFO L130 PetriNetUnfolder]: 758/1981 cut-off events. [2022-11-02 20:17:52,870 INFO L131 PetriNetUnfolder]: For 479/608 co-relation queries the response was YES. [2022-11-02 20:17:52,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 1981 events. 758/1981 cut-off events. For 479/608 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11491 event pairs, 407 based on Foata normal form. 4/1728 useless extension candidates. Maximal degree in co-relation 3555. Up to 1029 conditions per place. [2022-11-02 20:17:52,881 INFO L137 encePairwiseOnDemand]: 412/414 looper letters, 0 selfloop transitions, 0 changer transitions 285/285 dead transitions. [2022-11-02 20:17:52,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 285 transitions, 681 flow [2022-11-02 20:17:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:17:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:17:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 946 transitions. [2022-11-02 20:17:52,884 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7616747181964574 [2022-11-02 20:17:52,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 946 transitions. [2022-11-02 20:17:52,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 946 transitions. [2022-11-02 20:17:52,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:17:52,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 946 transitions. [2022-11-02 20:17:52,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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-11-02 20:17:52,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:52,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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-11-02 20:17:52,891 INFO L175 Difference]: Start difference. First operand has 296 places, 286 transitions, 629 flow. Second operand 3 states and 946 transitions. [2022-11-02 20:17:52,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 285 transitions, 681 flow [2022-11-02 20:17:52,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 285 transitions, 674 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:17:52,896 INFO L231 Difference]: Finished difference. Result has 293 places, 0 transitions, 0 flow [2022-11-02 20:17:52,896 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=293, PETRI_TRANSITIONS=0} [2022-11-02 20:17:52,897 INFO L287 CegarLoopForPetriNet]: 383 programPoint places, -90 predicate places. [2022-11-02 20:17:52,897 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 0 transitions, 0 flow [2022-11-02 20:17:52,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 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-11-02 20:17:52,900 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (166 of 167 remaining) [2022-11-02 20:17:52,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (165 of 167 remaining) [2022-11-02 20:17:52,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (164 of 167 remaining) [2022-11-02 20:17:52,901 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (163 of 167 remaining) [2022-11-02 20:17:52,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (162 of 167 remaining) [2022-11-02 20:17:52,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (161 of 167 remaining) [2022-11-02 20:17:52,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (160 of 167 remaining) [2022-11-02 20:17:52,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (159 of 167 remaining) [2022-11-02 20:17:52,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (158 of 167 remaining) [2022-11-02 20:17:52,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (157 of 167 remaining) [2022-11-02 20:17:52,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (156 of 167 remaining) [2022-11-02 20:17:52,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (155 of 167 remaining) [2022-11-02 20:17:52,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (154 of 167 remaining) [2022-11-02 20:17:52,903 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (153 of 167 remaining) [2022-11-02 20:17:52,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (152 of 167 remaining) [2022-11-02 20:17:52,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (151 of 167 remaining) [2022-11-02 20:17:52,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (150 of 167 remaining) [2022-11-02 20:17:52,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (149 of 167 remaining) [2022-11-02 20:17:52,904 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (148 of 167 remaining) [2022-11-02 20:17:52,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (147 of 167 remaining) [2022-11-02 20:17:52,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (146 of 167 remaining) [2022-11-02 20:17:52,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (145 of 167 remaining) [2022-11-02 20:17:52,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (144 of 167 remaining) [2022-11-02 20:17:52,905 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (143 of 167 remaining) [2022-11-02 20:17:52,906 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (142 of 167 remaining) [2022-11-02 20:17:52,906 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (141 of 167 remaining) [2022-11-02 20:17:52,906 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (140 of 167 remaining) [2022-11-02 20:17:52,906 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (139 of 167 remaining) [2022-11-02 20:17:52,906 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (138 of 167 remaining) [2022-11-02 20:17:52,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (137 of 167 remaining) [2022-11-02 20:17:52,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (136 of 167 remaining) [2022-11-02 20:17:52,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (135 of 167 remaining) [2022-11-02 20:17:52,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (134 of 167 remaining) [2022-11-02 20:17:52,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (133 of 167 remaining) [2022-11-02 20:17:52,907 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (132 of 167 remaining) [2022-11-02 20:17:52,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (131 of 167 remaining) [2022-11-02 20:17:52,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (130 of 167 remaining) [2022-11-02 20:17:52,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (129 of 167 remaining) [2022-11-02 20:17:52,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (128 of 167 remaining) [2022-11-02 20:17:52,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (127 of 167 remaining) [2022-11-02 20:17:52,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (126 of 167 remaining) [2022-11-02 20:17:52,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (125 of 167 remaining) [2022-11-02 20:17:52,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (124 of 167 remaining) [2022-11-02 20:17:52,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (123 of 167 remaining) [2022-11-02 20:17:52,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (122 of 167 remaining) [2022-11-02 20:17:52,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (121 of 167 remaining) [2022-11-02 20:17:52,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (120 of 167 remaining) [2022-11-02 20:17:52,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (119 of 167 remaining) [2022-11-02 20:17:52,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (118 of 167 remaining) [2022-11-02 20:17:52,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (117 of 167 remaining) [2022-11-02 20:17:52,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (116 of 167 remaining) [2022-11-02 20:17:52,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (115 of 167 remaining) [2022-11-02 20:17:52,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (114 of 167 remaining) [2022-11-02 20:17:52,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (113 of 167 remaining) [2022-11-02 20:17:52,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (112 of 167 remaining) [2022-11-02 20:17:52,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (111 of 167 remaining) [2022-11-02 20:17:52,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (110 of 167 remaining) [2022-11-02 20:17:52,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (109 of 167 remaining) [2022-11-02 20:17:52,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (108 of 167 remaining) [2022-11-02 20:17:52,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (107 of 167 remaining) [2022-11-02 20:17:52,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (106 of 167 remaining) [2022-11-02 20:17:52,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (105 of 167 remaining) [2022-11-02 20:17:52,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (104 of 167 remaining) [2022-11-02 20:17:52,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (103 of 167 remaining) [2022-11-02 20:17:52,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (102 of 167 remaining) [2022-11-02 20:17:52,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (101 of 167 remaining) [2022-11-02 20:17:52,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (100 of 167 remaining) [2022-11-02 20:17:52,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (99 of 167 remaining) [2022-11-02 20:17:52,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (98 of 167 remaining) [2022-11-02 20:17:52,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (97 of 167 remaining) [2022-11-02 20:17:52,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (96 of 167 remaining) [2022-11-02 20:17:52,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (95 of 167 remaining) [2022-11-02 20:17:52,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (94 of 167 remaining) [2022-11-02 20:17:52,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 167 remaining) [2022-11-02 20:17:52,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 167 remaining) [2022-11-02 20:17:52,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 167 remaining) [2022-11-02 20:17:52,915 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 167 remaining) [2022-11-02 20:17:52,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 167 remaining) [2022-11-02 20:17:52,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 167 remaining) [2022-11-02 20:17:52,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 167 remaining) [2022-11-02 20:17:52,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 167 remaining) [2022-11-02 20:17:52,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 167 remaining) [2022-11-02 20:17:52,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 167 remaining) [2022-11-02 20:17:52,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 167 remaining) [2022-11-02 20:17:52,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 167 remaining) [2022-11-02 20:17:52,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 167 remaining) [2022-11-02 20:17:52,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 167 remaining) [2022-11-02 20:17:52,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 167 remaining) [2022-11-02 20:17:52,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 167 remaining) [2022-11-02 20:17:52,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 167 remaining) [2022-11-02 20:17:52,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 167 remaining) [2022-11-02 20:17:52,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 167 remaining) [2022-11-02 20:17:52,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 167 remaining) [2022-11-02 20:17:52,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 167 remaining) [2022-11-02 20:17:52,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 167 remaining) [2022-11-02 20:17:52,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 167 remaining) [2022-11-02 20:17:52,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 167 remaining) [2022-11-02 20:17:52,919 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 167 remaining) [2022-11-02 20:17:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 167 remaining) [2022-11-02 20:17:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 167 remaining) [2022-11-02 20:17:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 167 remaining) [2022-11-02 20:17:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 167 remaining) [2022-11-02 20:17:52,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 167 remaining) [2022-11-02 20:17:52,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 167 remaining) [2022-11-02 20:17:52,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 167 remaining) [2022-11-02 20:17:52,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 167 remaining) [2022-11-02 20:17:52,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 167 remaining) [2022-11-02 20:17:52,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 167 remaining) [2022-11-02 20:17:52,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 167 remaining) [2022-11-02 20:17:52,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 167 remaining) [2022-11-02 20:17:52,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 167 remaining) [2022-11-02 20:17:52,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 167 remaining) [2022-11-02 20:17:52,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 167 remaining) [2022-11-02 20:17:52,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 167 remaining) [2022-11-02 20:17:52,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 167 remaining) [2022-11-02 20:17:52,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 167 remaining) [2022-11-02 20:17:52,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 167 remaining) [2022-11-02 20:17:52,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 167 remaining) [2022-11-02 20:17:52,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 167 remaining) [2022-11-02 20:17:52,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 167 remaining) [2022-11-02 20:17:52,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 167 remaining) [2022-11-02 20:17:52,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 167 remaining) [2022-11-02 20:17:52,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 167 remaining) [2022-11-02 20:17:52,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 167 remaining) [2022-11-02 20:17:52,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 167 remaining) [2022-11-02 20:17:52,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 167 remaining) [2022-11-02 20:17:52,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 167 remaining) [2022-11-02 20:17:52,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 167 remaining) [2022-11-02 20:17:52,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 167 remaining) [2022-11-02 20:17:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 167 remaining) [2022-11-02 20:17:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 167 remaining) [2022-11-02 20:17:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 167 remaining) [2022-11-02 20:17:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 167 remaining) [2022-11-02 20:17:52,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 167 remaining) [2022-11-02 20:17:52,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 167 remaining) [2022-11-02 20:17:52,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 167 remaining) [2022-11-02 20:17:52,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 167 remaining) [2022-11-02 20:17:52,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 167 remaining) [2022-11-02 20:17:52,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 167 remaining) [2022-11-02 20:17:52,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 167 remaining) [2022-11-02 20:17:52,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 167 remaining) [2022-11-02 20:17:52,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 167 remaining) [2022-11-02 20:17:52,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 167 remaining) [2022-11-02 20:17:52,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 167 remaining) [2022-11-02 20:17:52,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 167 remaining) [2022-11-02 20:17:52,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 167 remaining) [2022-11-02 20:17:52,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 167 remaining) [2022-11-02 20:17:52,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 167 remaining) [2022-11-02 20:17:52,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 167 remaining) [2022-11-02 20:17:52,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 167 remaining) [2022-11-02 20:17:52,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 167 remaining) [2022-11-02 20:17:52,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 167 remaining) [2022-11-02 20:17:52,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 167 remaining) [2022-11-02 20:17:52,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 167 remaining) [2022-11-02 20:17:52,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 167 remaining) [2022-11-02 20:17:52,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 167 remaining) [2022-11-02 20:17:52,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 167 remaining) [2022-11-02 20:17:52,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 167 remaining) [2022-11-02 20:17:52,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 167 remaining) [2022-11-02 20:17:52,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 167 remaining) [2022-11-02 20:17:52,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 167 remaining) [2022-11-02 20:17:52,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 167 remaining) [2022-11-02 20:17:52,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 167 remaining) [2022-11-02 20:17:52,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 167 remaining) [2022-11-02 20:17:52,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 167 remaining) [2022-11-02 20:17:52,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 167 remaining) [2022-11-02 20:17:52,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 167 remaining) [2022-11-02 20:17:52,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:17:52,933 INFO L444 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] [2022-11-02 20:17:52,941 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:17:52,941 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:17:52,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:17:52 BasicIcfg [2022-11-02 20:17:52,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:17:52,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:17:52,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:17:52,949 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:17:52,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:22" (3/4) ... [2022-11-02 20:17:52,953 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:17:52,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:17:52,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:17:52,959 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:17:52,960 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:17:52,967 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-11-02 20:17:52,967 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:17:52,968 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:17:52,969 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:17:53,023 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:17:53,023 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:17:53,024 INFO L158 Benchmark]: Toolchain (without parser) took 33390.00ms. Allocated memory was 115.3MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 77.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 644.2MB. Max. memory is 16.1GB. [2022-11-02 20:17:53,024 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 115.3MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:17:53,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.66ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 87.0MB in the end (delta: -9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:17:53,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.53ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 83.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:17:53,025 INFO L158 Benchmark]: Boogie Preprocessor took 105.29ms. Allocated memory is still 115.3MB. Free memory was 83.0MB in the beginning and 79.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:17:53,026 INFO L158 Benchmark]: RCFGBuilder took 2242.07ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 79.2MB in the beginning and 104.4MB in the end (delta: -25.2MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. [2022-11-02 20:17:53,026 INFO L158 Benchmark]: TraceAbstraction took 30426.36ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 104.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 622.2MB. Max. memory is 16.1GB. [2022-11-02 20:17:53,027 INFO L158 Benchmark]: Witness Printer took 74.54ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:17:53,029 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.38ms. Allocated memory is still 115.3MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.66ms. Allocated memory is still 115.3MB. Free memory was 77.3MB in the beginning and 87.0MB in the end (delta: -9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.53ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 83.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.29ms. Allocated memory is still 115.3MB. Free memory was 83.0MB in the beginning and 79.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2242.07ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 79.2MB in the beginning and 104.4MB in the end (delta: -25.2MB). Peak memory consumption was 53.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30426.36ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 104.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 622.2MB. Max. memory is 16.1GB. * Witness Printer took 74.54ms. Allocated memory is still 2.0GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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: 92]: 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: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: 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: 109]: 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: 109]: 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: 110]: 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: 110]: 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: 111]: 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: 114]: 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: 114]: 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 9 procedures, 498 locations, 167 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: 30.2s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 256 mSDsluCounter, 215 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 451 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1590 IncrementalHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 215 mSDtfsCounter, 1590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=0, InterpolantAutomatonStates: 81, 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, 4.5s InterpolantComputationTime, 2591 NumberOfCodeBlocks, 2591 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 3042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 93 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:17:53,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fa431ce-a5ed-4ea3-8923-e97caa7b4e3a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE