./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/parallel-lamport.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/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_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-lamport.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/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_31edc597-1638-4492-88e8-d79c2ac71d6c/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 dda4e60b50ccb96ce521fa11aa956967863397082d82b1fb589f74967fe28a7c --- 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:51:24,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:24,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:24,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:24,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:24,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:24,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:24,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:24,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:24,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:24,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:24,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:24,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:24,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:24,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:24,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:24,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:24,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:24,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:24,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:24,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:24,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:24,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:24,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:24,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:24,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:24,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:24,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:24,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:24,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:24,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:24,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:24,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:24,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:24,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:24,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:24,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:24,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:24,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:24,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:24,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:24,398 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:51:24,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:24,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:24,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:24,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:24,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:24,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:24,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:24,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:24,433 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:24,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:24,434 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:51:24,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:51:24,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:24,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:51:24,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:24,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:24,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:24,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:24,436 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:51:24,436 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:51:24,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:24,437 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:24,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:24,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:24,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:24,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:24,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:24,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:24,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:24,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:24,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:24,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:24,441 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:24,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:24,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:24,442 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_31edc597-1638-4492-88e8-d79c2ac71d6c/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_31edc597-1638-4492-88e8-d79c2ac71d6c/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 -> dda4e60b50ccb96ce521fa11aa956967863397082d82b1fb589f74967fe28a7c [2022-11-02 20:51:24,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:24,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:24,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:24,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:24,802 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:24,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2022-11-02 20:51:24,888 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/data/90ef69c2c/4ef201d9c4a84884a0e9622e9ad356dc/FLAG89d36fb07 [2022-11-02 20:51:25,426 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:25,427 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2022-11-02 20:51:25,434 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/data/90ef69c2c/4ef201d9c4a84884a0e9622e9ad356dc/FLAG89d36fb07 [2022-11-02 20:51:25,786 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/data/90ef69c2c/4ef201d9c4a84884a0e9622e9ad356dc [2022-11-02 20:51:25,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:25,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:25,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:25,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:25,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:25,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:25" (1/1) ... [2022-11-02 20:51:25,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@462e0dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:25, skipping insertion in model container [2022-11-02 20:51:25,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:25" (1/1) ... [2022-11-02 20:51:25,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:25,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:26,143 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_31edc597-1638-4492-88e8-d79c2ac71d6c/sv-benchmarks/c/weaver/parallel-lamport.wvr.c[4210,4223] [2022-11-02 20:51:26,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:26,171 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:26,228 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_31edc597-1638-4492-88e8-d79c2ac71d6c/sv-benchmarks/c/weaver/parallel-lamport.wvr.c[4210,4223] [2022-11-02 20:51:26,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:26,247 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:26,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26 WrapperNode [2022-11-02 20:51:26,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:26,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:26,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:26,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:26,257 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:51:26" (1/1) ... [2022-11-02 20:51:26,268 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:51:26" (1/1) ... [2022-11-02 20:51:26,307 INFO L138 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 491 [2022-11-02 20:51:26,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:26,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:26,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:26,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:26,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,345 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:26,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:26,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:26,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:26,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (1/1) ... [2022-11-02 20:51:26,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:26,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:26,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:51:26,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:51:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:51:26,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:51:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:51:26,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:51:26,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:51:26,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:51:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:51:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:51:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:51:26,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:26,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:26,450 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:51:26,626 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:26,628 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:27,493 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:27,808 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:27,808 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:51:27,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:27 BoogieIcfgContainer [2022-11-02 20:51:27,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:27,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:27,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:27,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:27,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:25" (1/3) ... [2022-11-02 20:51:27,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b900b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:27, skipping insertion in model container [2022-11-02 20:51:27,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:26" (2/3) ... [2022-11-02 20:51:27,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b900b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:27, skipping insertion in model container [2022-11-02 20:51:27,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:27" (3/3) ... [2022-11-02 20:51:27,824 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2022-11-02 20:51:27,834 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:51:27,844 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:27,845 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2022-11-02 20:51:27,845 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:51:28,012 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:51:28,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 353 places, 351 transitions, 726 flow [2022-11-02 20:51:28,185 INFO L130 PetriNetUnfolder]: 8/348 cut-off events. [2022-11-02 20:51:28,185 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:51:28,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 348 events. 8/348 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 435 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 281. Up to 2 conditions per place. [2022-11-02 20:51:28,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 353 places, 351 transitions, 726 flow [2022-11-02 20:51:28,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 328 transitions, 674 flow [2022-11-02 20:51:28,206 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:28,213 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;@493d6a2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:28,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 129 error locations. [2022-11-02 20:51:28,220 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-11-02 20:51:28,220 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:51:28,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:28,221 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] [2022-11-02 20:51:28,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash -841308087, now seen corresponding path program 1 times [2022-11-02 20:51:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:28,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289766819] [2022-11-02 20:51:28,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:28,498 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:51:28,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289766819] [2022-11-02 20:51:28,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289766819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:28,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:28,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:28,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731473558] [2022-11-02 20:51:28,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:28,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:28,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:28,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:28,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:28,543 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:28,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 328 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:28,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:28,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:28,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:29,529 INFO L130 PetriNetUnfolder]: 1068/2403 cut-off events. [2022-11-02 20:51:29,530 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-11-02 20:51:29,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4459 conditions, 2403 events. 1068/2403 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14105 event pairs, 1066 based on Foata normal form. 5/2341 useless extension candidates. Maximal degree in co-relation 4120. Up to 1735 conditions per place. [2022-11-02 20:51:29,553 INFO L137 encePairwiseOnDemand]: 292/351 looper letters, 32 selfloop transitions, 2 changer transitions 4/271 dead transitions. [2022-11-02 20:51:29,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 271 transitions, 628 flow [2022-11-02 20:51:29,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2022-11-02 20:51:29,570 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8214624881291548 [2022-11-02 20:51:29,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 865 transitions. [2022-11-02 20:51:29,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 865 transitions. [2022-11-02 20:51:29,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:29,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 865 transitions. [2022-11-02 20:51:29,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 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:51:29,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:29,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:29,591 INFO L175 Difference]: Start difference. First operand has 331 places, 328 transitions, 674 flow. Second operand 3 states and 865 transitions. [2022-11-02 20:51:29,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 271 transitions, 628 flow [2022-11-02 20:51:29,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 271 transitions, 616 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:51:29,603 INFO L231 Difference]: Finished difference. Result has 275 places, 267 transitions, 544 flow [2022-11-02 20:51:29,606 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=275, PETRI_TRANSITIONS=267} [2022-11-02 20:51:29,609 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -56 predicate places. [2022-11-02 20:51:29,610 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 267 transitions, 544 flow [2022-11-02 20:51:29,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:29,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:29,611 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] [2022-11-02 20:51:29,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:29,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash -161869856, now seen corresponding path program 1 times [2022-11-02 20:51:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:29,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837478101] [2022-11-02 20:51:29,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:29,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:29,682 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:51:29,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:29,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837478101] [2022-11-02 20:51:29,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837478101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:29,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:29,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:29,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70664661] [2022-11-02 20:51:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:29,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:29,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:29,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:29,687 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:29,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 267 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:29,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:29,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:29,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:30,389 INFO L130 PetriNetUnfolder]: 1068/2398 cut-off events. [2022-11-02 20:51:30,389 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:51:30,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4272 conditions, 2398 events. 1068/2398 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14114 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4232. Up to 1735 conditions per place. [2022-11-02 20:51:30,410 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 32 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2022-11-02 20:51:30,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 266 transitions, 610 flow [2022-11-02 20:51:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-11-02 20:51:30,414 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.768281101614435 [2022-11-02 20:51:30,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2022-11-02 20:51:30,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2022-11-02 20:51:30,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:30,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2022-11-02 20:51:30,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 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:51:30,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:30,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:30,424 INFO L175 Difference]: Start difference. First operand has 275 places, 267 transitions, 544 flow. Second operand 3 states and 809 transitions. [2022-11-02 20:51:30,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 266 transitions, 610 flow [2022-11-02 20:51:30,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 266 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:30,434 INFO L231 Difference]: Finished difference. Result has 270 places, 266 transitions, 542 flow [2022-11-02 20:51:30,435 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=270, PETRI_TRANSITIONS=266} [2022-11-02 20:51:30,436 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -61 predicate places. [2022-11-02 20:51:30,437 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 266 transitions, 542 flow [2022-11-02 20:51:30,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:30,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:30,438 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] [2022-11-02 20:51:30,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:30,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1836775930, now seen corresponding path program 1 times [2022-11-02 20:51:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:30,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884042776] [2022-11-02 20:51:30,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:30,528 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:51:30,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:30,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884042776] [2022-11-02 20:51:30,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884042776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:30,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:30,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:30,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249162583] [2022-11-02 20:51:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:30,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:30,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:30,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:30,532 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 351 [2022-11-02 20:51:30,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 266 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 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:51:30,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:30,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 351 [2022-11-02 20:51:30,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:31,175 INFO L130 PetriNetUnfolder]: 1068/2397 cut-off events. [2022-11-02 20:51:31,175 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:51:31,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 2397 events. 1068/2397 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14117 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4236. Up to 1747 conditions per place. [2022-11-02 20:51:31,198 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 44 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2022-11-02 20:51:31,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 265 transitions, 632 flow [2022-11-02 20:51:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 785 transitions. [2022-11-02 20:51:31,262 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7454890788224121 [2022-11-02 20:51:31,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 785 transitions. [2022-11-02 20:51:31,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 785 transitions. [2022-11-02 20:51:31,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:31,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 785 transitions. [2022-11-02 20:51:31,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 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:51:31,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:31,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:31,268 INFO L175 Difference]: Start difference. First operand has 270 places, 266 transitions, 542 flow. Second operand 3 states and 785 transitions. [2022-11-02 20:51:31,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 265 transitions, 632 flow [2022-11-02 20:51:31,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 265 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:31,274 INFO L231 Difference]: Finished difference. Result has 269 places, 265 transitions, 540 flow [2022-11-02 20:51:31,274 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=269, PETRI_TRANSITIONS=265} [2022-11-02 20:51:31,277 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -62 predicate places. [2022-11-02 20:51:31,277 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 265 transitions, 540 flow [2022-11-02 20:51:31,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 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:51:31,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:31,278 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] [2022-11-02 20:51:31,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:31,279 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1734955022, now seen corresponding path program 1 times [2022-11-02 20:51:31,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:31,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905229033] [2022-11-02 20:51:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:31,393 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:51:31,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:31,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905229033] [2022-11-02 20:51:31,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905229033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:31,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:31,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300248892] [2022-11-02 20:51:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:31,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:31,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:31,400 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 351 [2022-11-02 20:51:31,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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:51:31,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:31,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 351 [2022-11-02 20:51:31,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:31,981 INFO L130 PetriNetUnfolder]: 1068/2396 cut-off events. [2022-11-02 20:51:31,981 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:51:31,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 2396 events. 1068/2396 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14120 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4221. Up to 1740 conditions per place. [2022-11-02 20:51:32,002 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 37 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2022-11-02 20:51:32,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 264 transitions, 616 flow [2022-11-02 20:51:32,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:32,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions. [2022-11-02 20:51:32,006 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7559354226020892 [2022-11-02 20:51:32,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 796 transitions. [2022-11-02 20:51:32,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 796 transitions. [2022-11-02 20:51:32,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:32,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 796 transitions. [2022-11-02 20:51:32,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 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:51:32,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:32,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:32,017 INFO L175 Difference]: Start difference. First operand has 269 places, 265 transitions, 540 flow. Second operand 3 states and 796 transitions. [2022-11-02 20:51:32,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 264 transitions, 616 flow [2022-11-02 20:51:32,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 264 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:32,028 INFO L231 Difference]: Finished difference. Result has 268 places, 264 transitions, 538 flow [2022-11-02 20:51:32,029 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=268, PETRI_TRANSITIONS=264} [2022-11-02 20:51:32,030 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -63 predicate places. [2022-11-02 20:51:32,030 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 264 transitions, 538 flow [2022-11-02 20:51:32,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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:51:32,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:32,031 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] [2022-11-02 20:51:32,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:32,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash -400530242, now seen corresponding path program 1 times [2022-11-02 20:51:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:32,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970754527] [2022-11-02 20:51:32,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:32,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:32,186 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:51:32,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:32,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970754527] [2022-11-02 20:51:32,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970754527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:32,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:32,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657417743] [2022-11-02 20:51:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:32,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:32,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:32,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:32,191 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:32,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 264 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:32,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:32,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:32,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:32,839 INFO L130 PetriNetUnfolder]: 1068/2395 cut-off events. [2022-11-02 20:51:32,840 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:51:32,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4269 conditions, 2395 events. 1068/2395 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14111 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4208. Up to 1735 conditions per place. [2022-11-02 20:51:32,861 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 32 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2022-11-02 20:51:32,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 263 transitions, 604 flow [2022-11-02 20:51:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-11-02 20:51:32,864 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.768281101614435 [2022-11-02 20:51:32,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2022-11-02 20:51:32,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2022-11-02 20:51:32,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:32,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2022-11-02 20:51:32,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 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:51:32,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:32,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:32,871 INFO L175 Difference]: Start difference. First operand has 268 places, 264 transitions, 538 flow. Second operand 3 states and 809 transitions. [2022-11-02 20:51:32,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 263 transitions, 604 flow [2022-11-02 20:51:32,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 263 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:32,878 INFO L231 Difference]: Finished difference. Result has 267 places, 263 transitions, 536 flow [2022-11-02 20:51:32,879 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=267, PETRI_TRANSITIONS=263} [2022-11-02 20:51:32,880 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -64 predicate places. [2022-11-02 20:51:32,880 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 263 transitions, 536 flow [2022-11-02 20:51:32,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:32,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:32,881 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] [2022-11-02 20:51:32,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:32,883 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1481568992, now seen corresponding path program 1 times [2022-11-02 20:51:32,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:32,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219965809] [2022-11-02 20:51:32,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:32,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:32,992 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:51:32,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:32,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219965809] [2022-11-02 20:51:32,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219965809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:32,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:32,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:32,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516181146] [2022-11-02 20:51:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:32,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:32,999 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:33,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 263 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:33,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:33,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:33,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:33,495 INFO L130 PetriNetUnfolder]: 1068/2394 cut-off events. [2022-11-02 20:51:33,495 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:51:33,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4268 conditions, 2394 events. 1068/2394 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14150 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4200. Up to 1735 conditions per place. [2022-11-02 20:51:33,514 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 32 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2022-11-02 20:51:33,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 262 transitions, 602 flow [2022-11-02 20:51:33,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-11-02 20:51:33,516 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.768281101614435 [2022-11-02 20:51:33,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2022-11-02 20:51:33,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2022-11-02 20:51:33,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:33,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2022-11-02 20:51:33,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 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:51:33,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:33,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:33,523 INFO L175 Difference]: Start difference. First operand has 267 places, 263 transitions, 536 flow. Second operand 3 states and 809 transitions. [2022-11-02 20:51:33,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 262 transitions, 602 flow [2022-11-02 20:51:33,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 262 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:33,529 INFO L231 Difference]: Finished difference. Result has 266 places, 262 transitions, 534 flow [2022-11-02 20:51:33,529 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=266, PETRI_TRANSITIONS=262} [2022-11-02 20:51:33,533 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -65 predicate places. [2022-11-02 20:51:33,533 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 262 transitions, 534 flow [2022-11-02 20:51:33,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:33,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:33,535 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] [2022-11-02 20:51:33,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:33,536 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash 933682583, now seen corresponding path program 1 times [2022-11-02 20:51:33,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:33,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042744331] [2022-11-02 20:51:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:33,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:33,630 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:51:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:33,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042744331] [2022-11-02 20:51:33,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042744331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:33,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:33,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956994989] [2022-11-02 20:51:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:33,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:33,634 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 351 [2022-11-02 20:51:33,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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:51:33,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:33,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 351 [2022-11-02 20:51:33,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:34,182 INFO L130 PetriNetUnfolder]: 1068/2393 cut-off events. [2022-11-02 20:51:34,182 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:51:34,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4273 conditions, 2393 events. 1068/2393 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14114 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4198. Up to 1741 conditions per place. [2022-11-02 20:51:34,205 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 38 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2022-11-02 20:51:34,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 261 transitions, 612 flow [2022-11-02 20:51:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-11-02 20:51:34,208 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7568850902184235 [2022-11-02 20:51:34,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-11-02 20:51:34,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-11-02 20:51:34,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:34,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-11-02 20:51:34,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 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:51:34,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:34,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:34,214 INFO L175 Difference]: Start difference. First operand has 266 places, 262 transitions, 534 flow. Second operand 3 states and 797 transitions. [2022-11-02 20:51:34,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 261 transitions, 612 flow [2022-11-02 20:51:34,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 261 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:34,221 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 532 flow [2022-11-02 20:51:34,222 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2022-11-02 20:51:34,222 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -66 predicate places. [2022-11-02 20:51:34,223 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 532 flow [2022-11-02 20:51:34,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 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:51:34,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:34,223 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] [2022-11-02 20:51:34,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:34,224 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash 694785808, now seen corresponding path program 1 times [2022-11-02 20:51:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:34,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073643171] [2022-11-02 20:51:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:34,262 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:51:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:34,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073643171] [2022-11-02 20:51:34,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073643171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:34,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:34,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393048053] [2022-11-02 20:51:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:34,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:34,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:34,266 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 351 [2022-11-02 20:51:34,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 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:51:34,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:34,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 351 [2022-11-02 20:51:34,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:34,760 INFO L130 PetriNetUnfolder]: 1068/2391 cut-off events. [2022-11-02 20:51:34,761 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-11-02 20:51:34,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 2391 events. 1068/2391 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14077 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4183. Up to 1735 conditions per place. [2022-11-02 20:51:34,780 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 34 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2022-11-02 20:51:34,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 259 transitions, 598 flow [2022-11-02 20:51:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2022-11-02 20:51:34,784 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.761633428300095 [2022-11-02 20:51:34,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2022-11-02 20:51:34,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2022-11-02 20:51:34,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:34,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2022-11-02 20:51:34,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 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:51:34,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:34,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:34,790 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 532 flow. Second operand 3 states and 802 transitions. [2022-11-02 20:51:34,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 259 transitions, 598 flow [2022-11-02 20:51:34,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 259 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:34,797 INFO L231 Difference]: Finished difference. Result has 263 places, 259 transitions, 526 flow [2022-11-02 20:51:34,798 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=263, PETRI_TRANSITIONS=259} [2022-11-02 20:51:34,798 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -68 predicate places. [2022-11-02 20:51:34,799 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 259 transitions, 526 flow [2022-11-02 20:51:34,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 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:51:34,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:34,800 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] [2022-11-02 20:51:34,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:34,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:34,801 INFO L85 PathProgramCache]: Analyzing trace with hash 149414708, now seen corresponding path program 1 times [2022-11-02 20:51:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:34,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502326566] [2022-11-02 20:51:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:34,860 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:51:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:34,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502326566] [2022-11-02 20:51:34,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502326566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:34,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845143020] [2022-11-02 20:51:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:34,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:34,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:34,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:34,865 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:34,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 259 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:34,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:34,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:34,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:35,323 INFO L130 PetriNetUnfolder]: 1068/2390 cut-off events. [2022-11-02 20:51:35,324 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-11-02 20:51:35,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4263 conditions, 2390 events. 1068/2390 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 14052 event pairs, 1066 based on Foata normal form. 0/2336 useless extension candidates. Maximal degree in co-relation 4181. Up to 1735 conditions per place. [2022-11-02 20:51:35,340 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 32 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2022-11-02 20:51:35,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 258 transitions, 592 flow [2022-11-02 20:51:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:35,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 809 transitions. [2022-11-02 20:51:35,342 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.768281101614435 [2022-11-02 20:51:35,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 809 transitions. [2022-11-02 20:51:35,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 809 transitions. [2022-11-02 20:51:35,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:35,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 809 transitions. [2022-11-02 20:51:35,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.6666666666667) internal successors, (809), 3 states have internal predecessors, (809), 0 states have call successors, (0), 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:51:35,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:35,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:35,348 INFO L175 Difference]: Start difference. First operand has 263 places, 259 transitions, 526 flow. Second operand 3 states and 809 transitions. [2022-11-02 20:51:35,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 258 transitions, 592 flow [2022-11-02 20:51:35,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 258 transitions, 591 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:35,353 INFO L231 Difference]: Finished difference. Result has 263 places, 258 transitions, 527 flow [2022-11-02 20:51:35,353 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=263, PETRI_TRANSITIONS=258} [2022-11-02 20:51:35,354 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -68 predicate places. [2022-11-02 20:51:35,354 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 258 transitions, 527 flow [2022-11-02 20:51:35,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:35,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:35,355 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] [2022-11-02 20:51:35,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:51:35,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:35,356 INFO L85 PathProgramCache]: Analyzing trace with hash -916184774, now seen corresponding path program 1 times [2022-11-02 20:51:35,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:35,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812609861] [2022-11-02 20:51:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:35,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:35,838 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:51:35,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812609861] [2022-11-02 20:51:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812609861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:35,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297024975] [2022-11-02 20:51:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:35,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:35,843 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 351 [2022-11-02 20:51:35,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 258 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 230.83333333333334) internal successors, (1385), 6 states have internal predecessors, (1385), 0 states have call successors, (0), 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:51:35,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:35,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 351 [2022-11-02 20:51:35,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:38,999 INFO L130 PetriNetUnfolder]: 8982/13803 cut-off events. [2022-11-02 20:51:38,999 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:51:39,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26795 conditions, 13803 events. 8982/13803 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 79190 event pairs, 8980 based on Foata normal form. 0/13218 useless extension candidates. Maximal degree in co-relation 26714. Up to 12849 conditions per place. [2022-11-02 20:51:39,069 INFO L137 encePairwiseOnDemand]: 345/351 looper letters, 58 selfloop transitions, 5 changer transitions 0/257 dead transitions. [2022-11-02 20:51:39,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 257 transitions, 651 flow [2022-11-02 20:51:39,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1438 transitions. [2022-11-02 20:51:39,073 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6828110161443495 [2022-11-02 20:51:39,073 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1438 transitions. [2022-11-02 20:51:39,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1438 transitions. [2022-11-02 20:51:39,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:39,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1438 transitions. [2022-11-02 20:51:39,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 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:51:39,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:39,082 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:39,082 INFO L175 Difference]: Start difference. First operand has 263 places, 258 transitions, 527 flow. Second operand 6 states and 1438 transitions. [2022-11-02 20:51:39,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 257 transitions, 651 flow [2022-11-02 20:51:39,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 257 transitions, 647 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:39,088 INFO L231 Difference]: Finished difference. Result has 265 places, 257 transitions, 531 flow [2022-11-02 20:51:39,088 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=265, PETRI_TRANSITIONS=257} [2022-11-02 20:51:39,089 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -66 predicate places. [2022-11-02 20:51:39,089 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 257 transitions, 531 flow [2022-11-02 20:51:39,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.83333333333334) internal successors, (1385), 6 states have internal predecessors, (1385), 0 states have call successors, (0), 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:51:39,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:39,090 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] [2022-11-02 20:51:39,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:51:39,091 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:39,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:39,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1049849359, now seen corresponding path program 1 times [2022-11-02 20:51:39,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:39,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717469708] [2022-11-02 20:51:39,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:39,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,146 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:51:39,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:39,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717469708] [2022-11-02 20:51:39,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717469708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:39,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:39,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:39,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950000464] [2022-11-02 20:51:39,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:39,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:39,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:39,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:39,150 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 351 [2022-11-02 20:51:39,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 257 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 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:51:39,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:39,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 351 [2022-11-02 20:51:39,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:39,703 INFO L130 PetriNetUnfolder]: 1119/2452 cut-off events. [2022-11-02 20:51:39,703 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-11-02 20:51:39,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 2452 events. 1119/2452 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14600 event pairs, 906 based on Foata normal form. 0/2401 useless extension candidates. Maximal degree in co-relation 4408. Up to 1537 conditions per place. [2022-11-02 20:51:39,717 INFO L137 encePairwiseOnDemand]: 340/351 looper letters, 58 selfloop transitions, 7 changer transitions 0/279 dead transitions. [2022-11-02 20:51:39,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 279 transitions, 708 flow [2022-11-02 20:51:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2022-11-02 20:51:39,720 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7749287749287749 [2022-11-02 20:51:39,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 816 transitions. [2022-11-02 20:51:39,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 816 transitions. [2022-11-02 20:51:39,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:39,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 816 transitions. [2022-11-02 20:51:39,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 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:51:39,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:39,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:39,726 INFO L175 Difference]: Start difference. First operand has 265 places, 257 transitions, 531 flow. Second operand 3 states and 816 transitions. [2022-11-02 20:51:39,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 279 transitions, 708 flow [2022-11-02 20:51:39,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 279 transitions, 698 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:51:39,731 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 565 flow [2022-11-02 20:51:39,732 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2022-11-02 20:51:39,732 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -71 predicate places. [2022-11-02 20:51:39,733 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 565 flow [2022-11-02 20:51:39,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 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:51:39,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:39,733 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] [2022-11-02 20:51:39,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:51:39,734 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:39,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash 412114643, now seen corresponding path program 1 times [2022-11-02 20:51:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:39,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485610272] [2022-11-02 20:51:39,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:39,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,777 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:51:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485610272] [2022-11-02 20:51:39,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485610272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:39,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:39,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928831098] [2022-11-02 20:51:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:39,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:39,781 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 351 [2022-11-02 20:51:39,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 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:51:39,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:39,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 351 [2022-11-02 20:51:39,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:40,413 INFO L130 PetriNetUnfolder]: 1119/2472 cut-off events. [2022-11-02 20:51:40,414 INFO L131 PetriNetUnfolder]: For 608/609 co-relation queries the response was YES. [2022-11-02 20:51:40,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5068 conditions, 2472 events. 1119/2472 cut-off events. For 608/609 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14869 event pairs, 580 based on Foata normal form. 2/2431 useless extension candidates. Maximal degree in co-relation 4984. Up to 1030 conditions per place. [2022-11-02 20:51:40,432 INFO L137 encePairwiseOnDemand]: 344/351 looper letters, 62 selfloop transitions, 4 changer transitions 5/285 dead transitions. [2022-11-02 20:51:40,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 285 transitions, 791 flow [2022-11-02 20:51:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 823 transitions. [2022-11-02 20:51:40,435 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7815764482431149 [2022-11-02 20:51:40,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 823 transitions. [2022-11-02 20:51:40,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 823 transitions. [2022-11-02 20:51:40,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:40,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 823 transitions. [2022-11-02 20:51:40,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 274.3333333333333) internal successors, (823), 3 states have internal predecessors, (823), 0 states have call successors, (0), 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:51:40,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:40,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:40,442 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 565 flow. Second operand 3 states and 823 transitions. [2022-11-02 20:51:40,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 285 transitions, 791 flow [2022-11-02 20:51:40,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 285 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:40,450 INFO L231 Difference]: Finished difference. Result has 258 places, 252 transitions, 544 flow [2022-11-02 20:51:40,450 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=258, PETRI_TRANSITIONS=252} [2022-11-02 20:51:40,452 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -73 predicate places. [2022-11-02 20:51:40,452 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 252 transitions, 544 flow [2022-11-02 20:51:40,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 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:51:40,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:40,453 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] [2022-11-02 20:51:40,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:51:40,454 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:40,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1185973510, now seen corresponding path program 1 times [2022-11-02 20:51:40,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:40,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456706495] [2022-11-02 20:51:40,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:40,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:40,513 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:51:40,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:40,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456706495] [2022-11-02 20:51:40,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456706495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:40,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:40,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905103489] [2022-11-02 20:51:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:40,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:40,522 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:40,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 252 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:40,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:40,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:40,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:41,152 INFO L130 PetriNetUnfolder]: 1119/2512 cut-off events. [2022-11-02 20:51:41,153 INFO L131 PetriNetUnfolder]: For 500/500 co-relation queries the response was YES. [2022-11-02 20:51:41,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5287 conditions, 2512 events. 1119/2512 cut-off events. For 500/500 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 15150 event pairs, 1068 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 5204. Up to 1819 conditions per place. [2022-11-02 20:51:41,170 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 37 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2022-11-02 20:51:41,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 251 transitions, 620 flow [2022-11-02 20:51:41,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2022-11-02 20:51:41,173 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7673314339981007 [2022-11-02 20:51:41,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2022-11-02 20:51:41,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2022-11-02 20:51:41,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:41,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2022-11-02 20:51:41,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 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:51:41,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:41,195 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:41,196 INFO L175 Difference]: Start difference. First operand has 258 places, 252 transitions, 544 flow. Second operand 3 states and 808 transitions. [2022-11-02 20:51:41,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 251 transitions, 620 flow [2022-11-02 20:51:41,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 251 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:41,203 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 538 flow [2022-11-02 20:51:41,203 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2022-11-02 20:51:41,204 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -79 predicate places. [2022-11-02 20:51:41,205 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 538 flow [2022-11-02 20:51:41,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:41,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:41,205 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] [2022-11-02 20:51:41,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:51:41,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:41,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:41,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1310845516, now seen corresponding path program 1 times [2022-11-02 20:51:41,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:41,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972230331] [2022-11-02 20:51:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:41,269 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:51:41,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:41,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972230331] [2022-11-02 20:51:41,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972230331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:41,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:41,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61086700] [2022-11-02 20:51:41,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:41,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:41,273 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:41,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:41,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:41,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:41,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:41,807 INFO L130 PetriNetUnfolder]: 1119/2511 cut-off events. [2022-11-02 20:51:41,807 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2022-11-02 20:51:41,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 2511 events. 1119/2511 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 15176 event pairs, 1068 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 4784. Up to 1819 conditions per place. [2022-11-02 20:51:41,827 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 37 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2022-11-02 20:51:41,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 614 flow [2022-11-02 20:51:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:41,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2022-11-02 20:51:41,830 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7673314339981007 [2022-11-02 20:51:41,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2022-11-02 20:51:41,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2022-11-02 20:51:41,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:41,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2022-11-02 20:51:41,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 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:51:41,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:41,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:41,836 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 538 flow. Second operand 3 states and 808 transitions. [2022-11-02 20:51:41,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 614 flow [2022-11-02 20:51:41,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 250 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:41,841 INFO L231 Difference]: Finished difference. Result has 251 places, 250 transitions, 536 flow [2022-11-02 20:51:41,842 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=251, PETRI_TRANSITIONS=250} [2022-11-02 20:51:41,843 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -80 predicate places. [2022-11-02 20:51:41,843 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 250 transitions, 536 flow [2022-11-02 20:51:41,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:41,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:41,844 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] [2022-11-02 20:51:41,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:51:41,844 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 323104572, now seen corresponding path program 1 times [2022-11-02 20:51:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:41,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012158676] [2022-11-02 20:51:41,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:41,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:41,911 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:51:41,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:41,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012158676] [2022-11-02 20:51:41,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012158676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:41,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:41,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:41,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222257708] [2022-11-02 20:51:41,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:41,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:41,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:41,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:41,914 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:41,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 250 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:41,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:41,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:41,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:42,466 INFO L130 PetriNetUnfolder]: 1119/2510 cut-off events. [2022-11-02 20:51:42,466 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2022-11-02 20:51:42,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 2510 events. 1119/2510 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 15187 event pairs, 1068 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 4783. Up to 1819 conditions per place. [2022-11-02 20:51:42,482 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 37 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2022-11-02 20:51:42,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 612 flow [2022-11-02 20:51:42,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2022-11-02 20:51:42,486 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7673314339981007 [2022-11-02 20:51:42,486 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2022-11-02 20:51:42,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2022-11-02 20:51:42,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:42,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2022-11-02 20:51:42,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 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:51:42,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:42,493 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:42,493 INFO L175 Difference]: Start difference. First operand has 251 places, 250 transitions, 536 flow. Second operand 3 states and 808 transitions. [2022-11-02 20:51:42,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 612 flow [2022-11-02 20:51:42,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 249 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:42,498 INFO L231 Difference]: Finished difference. Result has 250 places, 249 transitions, 534 flow [2022-11-02 20:51:42,499 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=250, PETRI_TRANSITIONS=249} [2022-11-02 20:51:42,500 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -81 predicate places. [2022-11-02 20:51:42,500 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 249 transitions, 534 flow [2022-11-02 20:51:42,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:42,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:42,501 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:51:42,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:51:42,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2123337712, now seen corresponding path program 1 times [2022-11-02 20:51:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:42,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447926938] [2022-11-02 20:51:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,578 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:51:42,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:42,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447926938] [2022-11-02 20:51:42,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447926938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:42,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:42,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:42,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876557593] [2022-11-02 20:51:42,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:42,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:42,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:42,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:42,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:42,586 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 351 [2022-11-02 20:51:42,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 249 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:42,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:42,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 351 [2022-11-02 20:51:42,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:42,994 INFO L130 PetriNetUnfolder]: 1119/2509 cut-off events. [2022-11-02 20:51:42,994 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2022-11-02 20:51:43,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4865 conditions, 2509 events. 1119/2509 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 15206 event pairs, 1068 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 4782. Up to 1819 conditions per place. [2022-11-02 20:51:43,013 INFO L137 encePairwiseOnDemand]: 348/351 looper letters, 37 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2022-11-02 20:51:43,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 248 transitions, 610 flow [2022-11-02 20:51:43,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 808 transitions. [2022-11-02 20:51:43,016 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7673314339981007 [2022-11-02 20:51:43,016 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 808 transitions. [2022-11-02 20:51:43,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 808 transitions. [2022-11-02 20:51:43,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:43,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 808 transitions. [2022-11-02 20:51:43,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 0 states have call successors, (0), 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:51:43,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:43,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 351.0) internal successors, (1404), 4 states have internal predecessors, (1404), 0 states have call successors, (0), 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:51:43,022 INFO L175 Difference]: Start difference. First operand has 250 places, 249 transitions, 534 flow. Second operand 3 states and 808 transitions. [2022-11-02 20:51:43,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 248 transitions, 610 flow [2022-11-02 20:51:43,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 248 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:43,028 INFO L231 Difference]: Finished difference. Result has 249 places, 248 transitions, 532 flow [2022-11-02 20:51:43,028 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=249, PETRI_TRANSITIONS=248} [2022-11-02 20:51:43,028 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -82 predicate places. [2022-11-02 20:51:43,029 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 248 transitions, 532 flow [2022-11-02 20:51:43,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 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:51:43,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:43,030 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] [2022-11-02 20:51:43,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:51:43,030 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:43,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1267955816, now seen corresponding path program 1 times [2022-11-02 20:51:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:43,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269924615] [2022-11-02 20:51:43,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:43,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:43,709 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:51:43,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:43,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269924615] [2022-11-02 20:51:43,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269924615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:43,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:43,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632466624] [2022-11-02 20:51:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:43,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:43,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:43,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:43,714 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 351 [2022-11-02 20:51:43,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 248 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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:51:43,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:43,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 351 [2022-11-02 20:51:43,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:46,263 INFO L130 PetriNetUnfolder]: 9423/14470 cut-off events. [2022-11-02 20:51:46,264 INFO L131 PetriNetUnfolder]: For 2012/2012 co-relation queries the response was YES. [2022-11-02 20:51:46,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30365 conditions, 14470 events. 9423/14470 cut-off events. For 2012/2012 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 83159 event pairs, 2254 based on Foata normal form. 0/14384 useless extension candidates. Maximal degree in co-relation 30281. Up to 4563 conditions per place. [2022-11-02 20:51:46,331 INFO L137 encePairwiseOnDemand]: 346/351 looper letters, 171 selfloop transitions, 4 changer transitions 1/363 dead transitions. [2022-11-02 20:51:46,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 363 transitions, 1210 flow [2022-11-02 20:51:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1551 transitions. [2022-11-02 20:51:46,335 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7364672364672364 [2022-11-02 20:51:46,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1551 transitions. [2022-11-02 20:51:46,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1551 transitions. [2022-11-02 20:51:46,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:46,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1551 transitions. [2022-11-02 20:51:46,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 0 states have call successors, (0), 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:51:46,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:46,343 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:46,344 INFO L175 Difference]: Start difference. First operand has 249 places, 248 transitions, 532 flow. Second operand 6 states and 1551 transitions. [2022-11-02 20:51:46,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 363 transitions, 1210 flow [2022-11-02 20:51:46,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 363 transitions, 1206 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:46,351 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 532 flow [2022-11-02 20:51:46,351 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2022-11-02 20:51:46,352 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -80 predicate places. [2022-11-02 20:51:46,352 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 532 flow [2022-11-02 20:51:46,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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:51:46,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:46,353 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] [2022-11-02 20:51:46,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:51:46,353 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:46,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1058166245, now seen corresponding path program 1 times [2022-11-02 20:51:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:46,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108830584] [2022-11-02 20:51:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:46,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:46,887 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:51:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108830584] [2022-11-02 20:51:46,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108830584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:46,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:46,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024971175] [2022-11-02 20:51:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:46,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:46,891 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 351 [2022-11-02 20:51:46,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 238.66666666666666) internal successors, (1432), 6 states have internal predecessors, (1432), 0 states have call successors, (0), 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:51:46,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:46,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 351 [2022-11-02 20:51:46,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:49,495 INFO L130 PetriNetUnfolder]: 8129/12733 cut-off events. [2022-11-02 20:51:49,496 INFO L131 PetriNetUnfolder]: For 2658/2658 co-relation queries the response was YES. [2022-11-02 20:51:49,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28569 conditions, 12733 events. 8129/12733 cut-off events. For 2658/2658 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 74413 event pairs, 7476 based on Foata normal form. 0/12625 useless extension candidates. Maximal degree in co-relation 28485. Up to 11010 conditions per place. [2022-11-02 20:51:49,561 INFO L137 encePairwiseOnDemand]: 346/351 looper letters, 110 selfloop transitions, 4 changer transitions 0/301 dead transitions. [2022-11-02 20:51:49,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 301 transitions, 902 flow [2022-11-02 20:51:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1509 transitions. [2022-11-02 20:51:49,566 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7165242165242165 [2022-11-02 20:51:49,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1509 transitions. [2022-11-02 20:51:49,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1509 transitions. [2022-11-02 20:51:49,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:49,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1509 transitions. [2022-11-02 20:51:49,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.5) internal successors, (1509), 6 states have internal predecessors, (1509), 0 states have call successors, (0), 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:51:49,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:49,576 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:49,576 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 532 flow. Second operand 6 states and 1509 transitions. [2022-11-02 20:51:49,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 301 transitions, 902 flow [2022-11-02 20:51:49,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 301 transitions, 895 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:51:49,587 INFO L231 Difference]: Finished difference. Result has 250 places, 245 transitions, 531 flow [2022-11-02 20:51:49,588 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=250, PETRI_TRANSITIONS=245} [2022-11-02 20:51:49,588 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -81 predicate places. [2022-11-02 20:51:49,588 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 245 transitions, 531 flow [2022-11-02 20:51:49,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.66666666666666) internal successors, (1432), 6 states have internal predecessors, (1432), 0 states have call successors, (0), 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:51:49,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:49,590 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] [2022-11-02 20:51:49,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:51:49,590 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2022-11-02 20:51:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:49,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1310049587, now seen corresponding path program 1 times [2022-11-02 20:51:49,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:49,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172833695] [2022-11-02 20:51:49,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:50,481 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:51:50,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:50,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172833695] [2022-11-02 20:51:50,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172833695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:50,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:50,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:51:50,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105904979] [2022-11-02 20:51:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:50,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:50,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:50,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:50,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:50,487 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 351 [2022-11-02 20:51:50,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 245 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 241.33333333333334) internal successors, (1448), 6 states have internal predecessors, (1448), 0 states have call successors, (0), 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:51:50,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:50,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 351 [2022-11-02 20:51:50,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:52,739 INFO L130 PetriNetUnfolder]: 8269/13187 cut-off events. [2022-11-02 20:51:52,739 INFO L131 PetriNetUnfolder]: For 1678/1678 co-relation queries the response was YES. [2022-11-02 20:51:52,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27954 conditions, 13187 events. 8269/13187 cut-off events. For 1678/1678 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 78996 event pairs, 7997 based on Foata normal form. 4/12951 useless extension candidates. Maximal degree in co-relation 27870. Up to 11872 conditions per place. [2022-11-02 20:51:52,766 INFO L137 encePairwiseOnDemand]: 346/351 looper letters, 0 selfloop transitions, 0 changer transitions 256/256 dead transitions. [2022-11-02 20:51:52,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 256 transitions, 691 flow [2022-11-02 20:51:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:51:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:51:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1468 transitions. [2022-11-02 20:51:52,771 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6970560303893637 [2022-11-02 20:51:52,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1468 transitions. [2022-11-02 20:51:52,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1468 transitions. [2022-11-02 20:51:52,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:52,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1468 transitions. [2022-11-02 20:51:52,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 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:51:52,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:52,782 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 351.0) internal successors, (2457), 7 states have internal predecessors, (2457), 0 states have call successors, (0), 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:51:52,782 INFO L175 Difference]: Start difference. First operand has 250 places, 245 transitions, 531 flow. Second operand 6 states and 1468 transitions. [2022-11-02 20:51:52,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 256 transitions, 691 flow [2022-11-02 20:51:52,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 684 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:51:52,790 INFO L231 Difference]: Finished difference. Result has 250 places, 0 transitions, 0 flow [2022-11-02 20:51:52,790 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=351, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=250, PETRI_TRANSITIONS=0} [2022-11-02 20:51:52,790 INFO L287 CegarLoopForPetriNet]: 331 programPoint places, -81 predicate places. [2022-11-02 20:51:52,791 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 0 transitions, 0 flow [2022-11-02 20:51:52,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.33333333333334) internal successors, (1448), 6 states have internal predecessors, (1448), 0 states have call successors, (0), 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:51:52,794 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (128 of 129 remaining) [2022-11-02 20:51:52,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 129 remaining) [2022-11-02 20:51:52,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (126 of 129 remaining) [2022-11-02 20:51:52,795 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (125 of 129 remaining) [2022-11-02 20:51:52,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (124 of 129 remaining) [2022-11-02 20:51:52,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (123 of 129 remaining) [2022-11-02 20:51:52,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (122 of 129 remaining) [2022-11-02 20:51:52,796 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (121 of 129 remaining) [2022-11-02 20:51:52,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (120 of 129 remaining) [2022-11-02 20:51:52,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (119 of 129 remaining) [2022-11-02 20:51:52,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (118 of 129 remaining) [2022-11-02 20:51:52,797 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (117 of 129 remaining) [2022-11-02 20:51:52,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (116 of 129 remaining) [2022-11-02 20:51:52,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (115 of 129 remaining) [2022-11-02 20:51:52,798 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (114 of 129 remaining) [2022-11-02 20:51:52,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (113 of 129 remaining) [2022-11-02 20:51:52,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (112 of 129 remaining) [2022-11-02 20:51:52,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (111 of 129 remaining) [2022-11-02 20:51:52,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (110 of 129 remaining) [2022-11-02 20:51:52,799 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (109 of 129 remaining) [2022-11-02 20:51:52,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (108 of 129 remaining) [2022-11-02 20:51:52,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (107 of 129 remaining) [2022-11-02 20:51:52,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (106 of 129 remaining) [2022-11-02 20:51:52,800 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (105 of 129 remaining) [2022-11-02 20:51:52,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (104 of 129 remaining) [2022-11-02 20:51:52,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (103 of 129 remaining) [2022-11-02 20:51:52,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (102 of 129 remaining) [2022-11-02 20:51:52,801 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (101 of 129 remaining) [2022-11-02 20:51:52,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (100 of 129 remaining) [2022-11-02 20:51:52,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (99 of 129 remaining) [2022-11-02 20:51:52,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (98 of 129 remaining) [2022-11-02 20:51:52,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (97 of 129 remaining) [2022-11-02 20:51:52,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (96 of 129 remaining) [2022-11-02 20:51:52,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (95 of 129 remaining) [2022-11-02 20:51:52,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (94 of 129 remaining) [2022-11-02 20:51:52,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (93 of 129 remaining) [2022-11-02 20:51:52,803 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (92 of 129 remaining) [2022-11-02 20:51:52,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (91 of 129 remaining) [2022-11-02 20:51:52,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (90 of 129 remaining) [2022-11-02 20:51:52,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (89 of 129 remaining) [2022-11-02 20:51:52,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (88 of 129 remaining) [2022-11-02 20:51:52,804 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (87 of 129 remaining) [2022-11-02 20:51:52,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (86 of 129 remaining) [2022-11-02 20:51:52,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (85 of 129 remaining) [2022-11-02 20:51:52,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (84 of 129 remaining) [2022-11-02 20:51:52,805 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (83 of 129 remaining) [2022-11-02 20:51:52,806 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (82 of 129 remaining) [2022-11-02 20:51:52,806 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (81 of 129 remaining) [2022-11-02 20:51:52,806 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (80 of 129 remaining) [2022-11-02 20:51:52,806 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (79 of 129 remaining) [2022-11-02 20:51:52,806 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (78 of 129 remaining) [2022-11-02 20:51:52,807 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (77 of 129 remaining) [2022-11-02 20:51:52,807 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (76 of 129 remaining) [2022-11-02 20:51:52,807 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (75 of 129 remaining) [2022-11-02 20:51:52,807 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (74 of 129 remaining) [2022-11-02 20:51:52,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (73 of 129 remaining) [2022-11-02 20:51:52,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (72 of 129 remaining) [2022-11-02 20:51:52,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (71 of 129 remaining) [2022-11-02 20:51:52,808 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (70 of 129 remaining) [2022-11-02 20:51:52,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 129 remaining) [2022-11-02 20:51:52,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 129 remaining) [2022-11-02 20:51:52,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (67 of 129 remaining) [2022-11-02 20:51:52,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (66 of 129 remaining) [2022-11-02 20:51:52,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (65 of 129 remaining) [2022-11-02 20:51:52,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (64 of 129 remaining) [2022-11-02 20:51:52,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (63 of 129 remaining) [2022-11-02 20:51:52,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (62 of 129 remaining) [2022-11-02 20:51:52,810 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (61 of 129 remaining) [2022-11-02 20:51:52,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (60 of 129 remaining) [2022-11-02 20:51:52,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (59 of 129 remaining) [2022-11-02 20:51:52,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (58 of 129 remaining) [2022-11-02 20:51:52,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (57 of 129 remaining) [2022-11-02 20:51:52,811 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (56 of 129 remaining) [2022-11-02 20:51:52,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (55 of 129 remaining) [2022-11-02 20:51:52,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (54 of 129 remaining) [2022-11-02 20:51:52,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 129 remaining) [2022-11-02 20:51:52,812 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 129 remaining) [2022-11-02 20:51:52,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 129 remaining) [2022-11-02 20:51:52,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (50 of 129 remaining) [2022-11-02 20:51:52,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 129 remaining) [2022-11-02 20:51:52,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (48 of 129 remaining) [2022-11-02 20:51:52,813 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (47 of 129 remaining) [2022-11-02 20:51:52,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 129 remaining) [2022-11-02 20:51:52,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 129 remaining) [2022-11-02 20:51:52,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 129 remaining) [2022-11-02 20:51:52,814 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 129 remaining) [2022-11-02 20:51:52,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (42 of 129 remaining) [2022-11-02 20:51:52,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (41 of 129 remaining) [2022-11-02 20:51:52,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (40 of 129 remaining) [2022-11-02 20:51:52,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 129 remaining) [2022-11-02 20:51:52,815 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 129 remaining) [2022-11-02 20:51:52,816 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (37 of 129 remaining) [2022-11-02 20:51:52,816 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (36 of 129 remaining) [2022-11-02 20:51:52,816 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (35 of 129 remaining) [2022-11-02 20:51:52,816 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (34 of 129 remaining) [2022-11-02 20:51:52,817 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (33 of 129 remaining) [2022-11-02 20:51:52,817 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (32 of 129 remaining) [2022-11-02 20:51:52,817 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (31 of 129 remaining) [2022-11-02 20:51:52,817 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (30 of 129 remaining) [2022-11-02 20:51:52,817 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 129 remaining) [2022-11-02 20:51:52,818 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 129 remaining) [2022-11-02 20:51:52,818 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (27 of 129 remaining) [2022-11-02 20:51:52,818 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (26 of 129 remaining) [2022-11-02 20:51:52,818 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (25 of 129 remaining) [2022-11-02 20:51:52,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (24 of 129 remaining) [2022-11-02 20:51:52,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 129 remaining) [2022-11-02 20:51:52,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (22 of 129 remaining) [2022-11-02 20:51:52,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 129 remaining) [2022-11-02 20:51:52,819 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (20 of 129 remaining) [2022-11-02 20:51:52,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (19 of 129 remaining) [2022-11-02 20:51:52,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (18 of 129 remaining) [2022-11-02 20:51:52,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (17 of 129 remaining) [2022-11-02 20:51:52,820 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (16 of 129 remaining) [2022-11-02 20:51:52,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 129 remaining) [2022-11-02 20:51:52,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (14 of 129 remaining) [2022-11-02 20:51:52,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (13 of 129 remaining) [2022-11-02 20:51:52,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (12 of 129 remaining) [2022-11-02 20:51:52,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (11 of 129 remaining) [2022-11-02 20:51:52,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 129 remaining) [2022-11-02 20:51:52,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 129 remaining) [2022-11-02 20:51:52,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 129 remaining) [2022-11-02 20:51:52,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 129 remaining) [2022-11-02 20:51:52,822 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (6 of 129 remaining) [2022-11-02 20:51:52,823 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 129 remaining) [2022-11-02 20:51:52,823 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 129 remaining) [2022-11-02 20:51:52,823 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (3 of 129 remaining) [2022-11-02 20:51:52,823 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 129 remaining) [2022-11-02 20:51:52,824 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (1 of 129 remaining) [2022-11-02 20:51:52,824 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (0 of 129 remaining) [2022-11-02 20:51:52,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:51:52,824 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] [2022-11-02 20:51:52,831 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:51:52,831 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:51:52,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:51:52 BasicIcfg [2022-11-02 20:51:52,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:51:52,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:51:52,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:51:52,837 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:51:52,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:27" (3/4) ... [2022-11-02 20:51:52,840 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:51:52,845 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:51:52,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:51:52,846 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:51:52,852 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-02 20:51:52,853 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:51:52,853 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:51:52,853 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:51:52,901 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:51:52,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:51:52,902 INFO L158 Benchmark]: Toolchain (without parser) took 27111.75ms. Allocated memory was 107.0MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 66.7MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-02 20:51:52,902 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 107.0MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:51:52,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.54ms. Allocated memory is still 107.0MB. Free memory was 66.4MB in the beginning and 78.6MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:51:52,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.47ms. Allocated memory is still 107.0MB. Free memory was 78.6MB in the beginning and 75.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:51:52,903 INFO L158 Benchmark]: Boogie Preprocessor took 44.40ms. Allocated memory is still 107.0MB. Free memory was 75.3MB in the beginning and 72.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:52,903 INFO L158 Benchmark]: RCFGBuilder took 1458.90ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 72.3MB in the beginning and 60.0MB in the end (delta: 12.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2022-11-02 20:51:52,904 INFO L158 Benchmark]: TraceAbstraction took 25020.37ms. Allocated memory was 130.0MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 59.3MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2022-11-02 20:51:52,904 INFO L158 Benchmark]: Witness Printer took 64.10ms. Allocated memory is still 9.1GB. Free memory was 7.9GB in the beginning and 7.9GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:51:52,906 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.27ms. Allocated memory is still 107.0MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.54ms. Allocated memory is still 107.0MB. Free memory was 66.4MB in the beginning and 78.6MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.47ms. Allocated memory is still 107.0MB. Free memory was 78.6MB in the beginning and 75.3MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.40ms. Allocated memory is still 107.0MB. Free memory was 75.3MB in the beginning and 72.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1458.90ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 72.3MB in the beginning and 60.0MB in the end (delta: 12.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 25020.37ms. Allocated memory was 130.0MB in the beginning and 9.1GB in the end (delta: 9.0GB). Free memory was 59.3MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 64.10ms. Allocated memory is still 9.1GB. Free memory was 7.9GB in the beginning and 7.9GB 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: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - 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: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: 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: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: 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: 125]: 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: 125]: 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: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: 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: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 172]: 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: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 430 locations, 129 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: 24.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 243 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 633 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1707 IncrementalHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 160 mSDtfsCounter, 1707 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674occurred in iteration=0, InterpolantAutomatonStates: 69, 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, 3.3s InterpolantComputationTime, 2036 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2017 ConstructedInterpolants, 0 QuantifiedInterpolants, 2405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 75 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:51:52,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31edc597-1638-4492-88e8-d79c2ac71d6c/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