./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-exp-term-subst.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_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/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_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/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_57606923-181d-4477-8640-b63a735d2515/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 a4208e364fc80ce33bd799516b7b127a7314c394860a88240a88c2fb8dc1fa8b --- 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:05:52,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:05:52,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:05:52,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:05:52,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:05:52,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:05:52,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:05:52,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:05:52,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:05:52,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:05:52,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:05:52,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:05:52,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:05:52,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:05:52,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:05:52,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:05:52,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:05:52,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:05:52,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:05:52,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:05:52,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:05:52,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:05:52,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:05:52,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:05:52,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:05:52,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:05:52,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:05:52,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:05:52,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:05:52,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:05:52,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:05:52,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:05:52,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:05:52,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:05:52,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:05:52,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:05:52,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:05:52,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:05:52,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:05:52,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:05:52,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:05:52,606 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:05:52,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:05:52,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:05:52,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:05:52,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:05:52,646 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:05:52,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:05:52,647 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:05:52,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:05:52,647 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:05:52,648 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:05:52,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:05:52,648 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:05:52,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:05:52,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:05:52,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:05:52,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:05:52,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:05:52,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:05:52,650 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:05:52,650 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:05:52,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:05:52,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:05:52,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:05:52,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:05:52,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:05:52,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:05:52,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:05:52,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:05:52,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:05:52,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:05:52,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:05:52,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:05:52,654 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:05:52,654 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:05:52,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:05:52,655 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_57606923-181d-4477-8640-b63a735d2515/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_57606923-181d-4477-8640-b63a735d2515/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 -> a4208e364fc80ce33bd799516b7b127a7314c394860a88240a88c2fb8dc1fa8b [2022-11-02 20:05:53,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:05:53,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:05:53,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:05:53,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:05:53,037 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:05:53,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2022-11-02 20:05:53,120 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/data/703f001f3/43d7450ab48847408a0d66b7abb9d789/FLAG5229ec41f [2022-11-02 20:05:53,678 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:05:53,679 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2022-11-02 20:05:53,687 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/data/703f001f3/43d7450ab48847408a0d66b7abb9d789/FLAG5229ec41f [2022-11-02 20:05:53,994 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/data/703f001f3/43d7450ab48847408a0d66b7abb9d789 [2022-11-02 20:05:53,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:05:53,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:05:54,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:05:54,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:05:54,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:05:54,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:05:53" (1/1) ... [2022-11-02 20:05:54,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34389b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54, skipping insertion in model container [2022-11-02 20:05:54,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:05:53" (1/1) ... [2022-11-02 20:05:54,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:05:54,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:05:54,329 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_57606923-181d-4477-8640-b63a735d2515/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c[3072,3085] [2022-11-02 20:05:54,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:05:54,343 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:05:54,380 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_57606923-181d-4477-8640-b63a735d2515/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c[3072,3085] [2022-11-02 20:05:54,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:05:54,400 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:05:54,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54 WrapperNode [2022-11-02 20:05:54,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:05:54,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:05:54,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:05:54,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:05:54,412 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:05:54" (1/1) ... [2022-11-02 20:05:54,424 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:05:54" (1/1) ... [2022-11-02 20:05:54,466 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 337 [2022-11-02 20:05:54,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:05:54,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:05:54,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:05:54,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:05:54,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,514 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:05:54,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:05:54,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:05:54,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:05:54,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (1/1) ... [2022-11-02 20:05:54,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:05:54,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:05:54,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:05:54,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:05:54,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:05:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:05:54,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:05:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:05:54,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:05:54,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:05:54,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:05:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:05:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:05:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:05:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:05:54,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:05:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:05:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:05:54,620 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:05:54,768 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:05:54,771 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:05:55,579 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:05:55,595 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:05:55,611 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:05:55,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:05:55 BoogieIcfgContainer [2022-11-02 20:05:55,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:05:55,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:05:55,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:05:55,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:05:55,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:05:53" (1/3) ... [2022-11-02 20:05:55,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5361bc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:05:55, skipping insertion in model container [2022-11-02 20:05:55,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:05:54" (2/3) ... [2022-11-02 20:05:55,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5361bc22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:05:55, skipping insertion in model container [2022-11-02 20:05:55,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:05:55" (3/3) ... [2022-11-02 20:05:55,635 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2022-11-02 20:05:55,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:05:55,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:05:55,659 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-11-02 20:05:55,660 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:05:55,871 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:05:55,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 432 places, 449 transitions, 922 flow [2022-11-02 20:05:56,216 INFO L130 PetriNetUnfolder]: 27/446 cut-off events. [2022-11-02 20:05:56,216 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:05:56,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 446 events. 27/446 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1448 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 314. Up to 2 conditions per place. [2022-11-02 20:05:56,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 432 places, 449 transitions, 922 flow [2022-11-02 20:05:56,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 408 places, 423 transitions, 864 flow [2022-11-02 20:05:56,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:05:56,284 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;@56785186, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:05:56,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2022-11-02 20:05:56,295 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-11-02 20:05:56,298 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:05:56,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:05:56,300 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] [2022-11-02 20:05:56,301 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:05:56,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 189706616, now seen corresponding path program 1 times [2022-11-02 20:05:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:56,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289824645] [2022-11-02 20:05:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:56,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:56,657 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:05:56,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:56,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289824645] [2022-11-02 20:05:56,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289824645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:05:56,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:05:56,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:05:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173717184] [2022-11-02 20:05:56,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:05:56,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:05:56,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:56,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:05:56,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:05:56,731 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 449 [2022-11-02 20:05:56,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 423 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:05:56,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:05:56,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 449 [2022-11-02 20:05:56,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:05:57,887 INFO L130 PetriNetUnfolder]: 298/2863 cut-off events. [2022-11-02 20:05:57,887 INFO L131 PetriNetUnfolder]: For 108/116 co-relation queries the response was YES. [2022-11-02 20:05:57,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2863 events. 298/2863 cut-off events. For 108/116 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 27082 event pairs, 132 based on Foata normal form. 72/2388 useless extension candidates. Maximal degree in co-relation 3013. Up to 284 conditions per place. [2022-11-02 20:05:57,977 INFO L137 encePairwiseOnDemand]: 439/449 looper letters, 21 selfloop transitions, 2 changer transitions 1/415 dead transitions. [2022-11-02 20:05:57,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 415 transitions, 894 flow [2022-11-02 20:05:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:05:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:05:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1279 transitions. [2022-11-02 20:05:58,010 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.949517446176689 [2022-11-02 20:05:58,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1279 transitions. [2022-11-02 20:05:58,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1279 transitions. [2022-11-02 20:05:58,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:05:58,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1279 transitions. [2022-11-02 20:05:58,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 426.3333333333333) internal successors, (1279), 3 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:05:58,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:05:58,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:05:58,045 INFO L175 Difference]: Start difference. First operand has 408 places, 423 transitions, 864 flow. Second operand 3 states and 1279 transitions. [2022-11-02 20:05:58,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 415 transitions, 894 flow [2022-11-02 20:05:58,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 415 transitions, 882 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:05:58,125 INFO L231 Difference]: Finished difference. Result has 403 places, 414 transitions, 838 flow [2022-11-02 20:05:58,128 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=403, PETRI_TRANSITIONS=414} [2022-11-02 20:05:58,132 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -5 predicate places. [2022-11-02 20:05:58,132 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 414 transitions, 838 flow [2022-11-02 20:05:58,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:05:58,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:05:58,134 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] [2022-11-02 20:05:58,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:05:58,135 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:05:58,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:58,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1595255997, now seen corresponding path program 1 times [2022-11-02 20:05:58,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:58,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469521964] [2022-11-02 20:05:58,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:58,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:58,279 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:05:58,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:58,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469521964] [2022-11-02 20:05:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469521964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:05:58,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:05:58,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:05:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082367081] [2022-11-02 20:05:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:05:58,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:05:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:05:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:05:58,286 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 449 [2022-11-02 20:05:58,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 414 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:05:58,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:05:58,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 449 [2022-11-02 20:05:58,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:05:58,933 INFO L130 PetriNetUnfolder]: 154/1613 cut-off events. [2022-11-02 20:05:58,934 INFO L131 PetriNetUnfolder]: For 23/25 co-relation queries the response was YES. [2022-11-02 20:05:58,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 1613 events. 154/1613 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 11813 event pairs, 60 based on Foata normal form. 0/1311 useless extension candidates. Maximal degree in co-relation 1761. Up to 164 conditions per place. [2022-11-02 20:05:59,007 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 21 selfloop transitions, 2 changer transitions 0/413 dead transitions. [2022-11-02 20:05:59,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 413 transitions, 882 flow [2022-11-02 20:05:59,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:05:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:05:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2022-11-02 20:05:59,014 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9443207126948775 [2022-11-02 20:05:59,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1272 transitions. [2022-11-02 20:05:59,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1272 transitions. [2022-11-02 20:05:59,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:05:59,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1272 transitions. [2022-11-02 20:05:59,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:05:59,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:05:59,026 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:05:59,026 INFO L175 Difference]: Start difference. First operand has 403 places, 414 transitions, 838 flow. Second operand 3 states and 1272 transitions. [2022-11-02 20:05:59,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 413 transitions, 882 flow [2022-11-02 20:05:59,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 413 transitions, 878 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:05:59,039 INFO L231 Difference]: Finished difference. Result has 401 places, 413 transitions, 836 flow [2022-11-02 20:05:59,040 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=836, PETRI_PLACES=401, PETRI_TRANSITIONS=413} [2022-11-02 20:05:59,041 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -7 predicate places. [2022-11-02 20:05:59,042 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 413 transitions, 836 flow [2022-11-02 20:05:59,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:05:59,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:05:59,044 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] [2022-11-02 20:05:59,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:05:59,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:05:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:05:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash -492387691, now seen corresponding path program 1 times [2022-11-02 20:05:59,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:05:59,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666582891] [2022-11-02 20:05:59,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:05:59,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:05:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:05:59,177 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:05:59,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:05:59,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666582891] [2022-11-02 20:05:59,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666582891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:05:59,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:05:59,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:05:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917727941] [2022-11-02 20:05:59,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:05:59,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:05:59,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:05:59,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:05:59,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:05:59,184 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 449 [2022-11-02 20:05:59,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 413 transitions, 836 flow. Second operand has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:05:59,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:05:59,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 449 [2022-11-02 20:05:59,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:05:59,901 INFO L130 PetriNetUnfolder]: 250/2060 cut-off events. [2022-11-02 20:05:59,901 INFO L131 PetriNetUnfolder]: For 71/74 co-relation queries the response was YES. [2022-11-02 20:05:59,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2365 conditions, 2060 events. 250/2060 cut-off events. For 71/74 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 16140 event pairs, 132 based on Foata normal form. 0/1707 useless extension candidates. Maximal degree in co-relation 2321. Up to 290 conditions per place. [2022-11-02 20:05:59,970 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 21 selfloop transitions, 2 changer transitions 0/412 dead transitions. [2022-11-02 20:05:59,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 412 transitions, 880 flow [2022-11-02 20:05:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1272 transitions. [2022-11-02 20:06:00,060 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9443207126948775 [2022-11-02 20:06:00,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1272 transitions. [2022-11-02 20:06:00,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1272 transitions. [2022-11-02 20:06:00,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:00,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1272 transitions. [2022-11-02 20:06:00,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 0 states have call successors, (0), 0 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:06:00,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:00,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:00,076 INFO L175 Difference]: Start difference. First operand has 401 places, 413 transitions, 836 flow. Second operand 3 states and 1272 transitions. [2022-11-02 20:06:00,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 412 transitions, 880 flow [2022-11-02 20:06:00,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 412 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:00,086 INFO L231 Difference]: Finished difference. Result has 400 places, 412 transitions, 834 flow [2022-11-02 20:06:00,087 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=400, PETRI_TRANSITIONS=412} [2022-11-02 20:06:00,090 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -8 predicate places. [2022-11-02 20:06:00,090 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 412 transitions, 834 flow [2022-11-02 20:06:00,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.3333333333333) internal successors, (1252), 3 states have internal predecessors, (1252), 0 states have call successors, (0), 0 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:06:00,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:00,092 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] [2022-11-02 20:06:00,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:06:00,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1449413375, now seen corresponding path program 1 times [2022-11-02 20:06:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:00,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709066216] [2022-11-02 20:06:00,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:06:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:00,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709066216] [2022-11-02 20:06:00,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709066216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:00,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:00,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988365780] [2022-11-02 20:06:00,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:00,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:00,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:00,212 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 449 [2022-11-02 20:06:00,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 412 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:06:00,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:00,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 449 [2022-11-02 20:06:00,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:01,162 INFO L130 PetriNetUnfolder]: 482/3355 cut-off events. [2022-11-02 20:06:01,163 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-02 20:06:01,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 3355 events. 482/3355 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 32661 event pairs, 279 based on Foata normal form. 0/2678 useless extension candidates. Maximal degree in co-relation 3957. Up to 536 conditions per place. [2022-11-02 20:06:01,258 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 27 selfloop transitions, 2 changer transitions 0/411 dead transitions. [2022-11-02 20:06:01,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 411 transitions, 890 flow [2022-11-02 20:06:01,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2022-11-02 20:06:01,263 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9354120267260579 [2022-11-02 20:06:01,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1260 transitions. [2022-11-02 20:06:01,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1260 transitions. [2022-11-02 20:06:01,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:01,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1260 transitions. [2022-11-02 20:06:01,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:06:01,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:01,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:01,276 INFO L175 Difference]: Start difference. First operand has 400 places, 412 transitions, 834 flow. Second operand 3 states and 1260 transitions. [2022-11-02 20:06:01,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 411 transitions, 890 flow [2022-11-02 20:06:01,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 411 transitions, 886 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:01,288 INFO L231 Difference]: Finished difference. Result has 399 places, 411 transitions, 832 flow [2022-11-02 20:06:01,288 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=399, PETRI_TRANSITIONS=411} [2022-11-02 20:06:01,289 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -9 predicate places. [2022-11-02 20:06:01,290 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 411 transitions, 832 flow [2022-11-02 20:06:01,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:06:01,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:01,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:06:01,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:06:01,292 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -905471950, now seen corresponding path program 1 times [2022-11-02 20:06:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:01,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19176963] [2022-11-02 20:06:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:01,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:01,365 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:06:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19176963] [2022-11-02 20:06:01,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19176963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:01,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:01,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035748744] [2022-11-02 20:06:01,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:01,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:01,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:01,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:01,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:01,372 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 449 [2022-11-02 20:06:01,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 411 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:06:01,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:01,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 449 [2022-11-02 20:06:01,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:02,105 INFO L130 PetriNetUnfolder]: 213/1730 cut-off events. [2022-11-02 20:06:02,106 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-02 20:06:02,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 1730 events. 213/1730 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12916 event pairs, 117 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 1962. Up to 262 conditions per place. [2022-11-02 20:06:02,162 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 27 selfloop transitions, 2 changer transitions 0/410 dead transitions. [2022-11-02 20:06:02,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 410 transitions, 888 flow [2022-11-02 20:06:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2022-11-02 20:06:02,166 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9354120267260579 [2022-11-02 20:06:02,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1260 transitions. [2022-11-02 20:06:02,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1260 transitions. [2022-11-02 20:06:02,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:02,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1260 transitions. [2022-11-02 20:06:02,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:06:02,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:02,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:02,177 INFO L175 Difference]: Start difference. First operand has 399 places, 411 transitions, 832 flow. Second operand 3 states and 1260 transitions. [2022-11-02 20:06:02,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 410 transitions, 888 flow [2022-11-02 20:06:02,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 410 transitions, 884 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:02,193 INFO L231 Difference]: Finished difference. Result has 398 places, 410 transitions, 830 flow [2022-11-02 20:06:02,194 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=398, PETRI_TRANSITIONS=410} [2022-11-02 20:06:02,197 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -10 predicate places. [2022-11-02 20:06:02,198 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 410 transitions, 830 flow [2022-11-02 20:06:02,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:06:02,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:02,200 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] [2022-11-02 20:06:02,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:06:02,201 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:02,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:02,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1868796679, now seen corresponding path program 1 times [2022-11-02 20:06:02,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:02,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063391123] [2022-11-02 20:06:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:02,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:02,305 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:06:02,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063391123] [2022-11-02 20:06:02,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063391123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:02,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:02,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039554633] [2022-11-02 20:06:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:02,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:02,313 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 449 [2022-11-02 20:06:02,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 410 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:06:02,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:02,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 449 [2022-11-02 20:06:02,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:03,383 INFO L130 PetriNetUnfolder]: 489/3359 cut-off events. [2022-11-02 20:06:03,384 INFO L131 PetriNetUnfolder]: For 120/131 co-relation queries the response was YES. [2022-11-02 20:06:03,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 3359 events. 489/3359 cut-off events. For 120/131 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 31606 event pairs, 279 based on Foata normal form. 0/2681 useless extension candidates. Maximal degree in co-relation 3853. Up to 539 conditions per place. [2022-11-02 20:06:03,463 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 27 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2022-11-02 20:06:03,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 409 transitions, 886 flow [2022-11-02 20:06:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2022-11-02 20:06:03,467 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9354120267260579 [2022-11-02 20:06:03,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1260 transitions. [2022-11-02 20:06:03,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1260 transitions. [2022-11-02 20:06:03,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:03,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1260 transitions. [2022-11-02 20:06:03,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:06:03,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:03,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:03,477 INFO L175 Difference]: Start difference. First operand has 398 places, 410 transitions, 830 flow. Second operand 3 states and 1260 transitions. [2022-11-02 20:06:03,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 409 transitions, 886 flow [2022-11-02 20:06:03,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 409 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:03,487 INFO L231 Difference]: Finished difference. Result has 397 places, 409 transitions, 828 flow [2022-11-02 20:06:03,488 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=397, PETRI_TRANSITIONS=409} [2022-11-02 20:06:03,492 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -11 predicate places. [2022-11-02 20:06:03,493 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 409 transitions, 828 flow [2022-11-02 20:06:03,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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:06:03,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:03,495 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] [2022-11-02 20:06:03,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:06:03,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:03,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1738542537, now seen corresponding path program 1 times [2022-11-02 20:06:03,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:03,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793922068] [2022-11-02 20:06:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:03,575 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:06:03,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793922068] [2022-11-02 20:06:03,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793922068] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:03,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:03,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331397775] [2022-11-02 20:06:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:03,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:03,589 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 449 [2022-11-02 20:06:03,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 409 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:06:03,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:03,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 449 [2022-11-02 20:06:03,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:04,205 INFO L130 PetriNetUnfolder]: 298/2690 cut-off events. [2022-11-02 20:06:04,205 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-11-02 20:06:04,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3020 conditions, 2690 events. 298/2690 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 25094 event pairs, 117 based on Foata normal form. 0/2235 useless extension candidates. Maximal degree in co-relation 2950. Up to 263 conditions per place. [2022-11-02 20:06:04,273 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 22 selfloop transitions, 2 changer transitions 0/407 dead transitions. [2022-11-02 20:06:04,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 407 transitions, 874 flow [2022-11-02 20:06:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2022-11-02 20:06:04,277 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9420935412026726 [2022-11-02 20:06:04,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1269 transitions. [2022-11-02 20:06:04,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1269 transitions. [2022-11-02 20:06:04,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:04,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1269 transitions. [2022-11-02 20:06:04,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:04,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:04,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:04,289 INFO L175 Difference]: Start difference. First operand has 397 places, 409 transitions, 828 flow. Second operand 3 states and 1269 transitions. [2022-11-02 20:06:04,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 407 transitions, 874 flow [2022-11-02 20:06:04,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 407 transitions, 870 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:04,299 INFO L231 Difference]: Finished difference. Result has 392 places, 405 transitions, 826 flow [2022-11-02 20:06:04,300 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=392, PETRI_TRANSITIONS=405} [2022-11-02 20:06:04,302 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -16 predicate places. [2022-11-02 20:06:04,303 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 405 transitions, 826 flow [2022-11-02 20:06:04,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:06:04,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:04,304 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] [2022-11-02 20:06:04,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:06:04,305 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2933305, now seen corresponding path program 1 times [2022-11-02 20:06:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:04,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771768191] [2022-11-02 20:06:04,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:04,406 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:06:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771768191] [2022-11-02 20:06:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771768191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:04,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:04,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630137594] [2022-11-02 20:06:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:04,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:04,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:04,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:04,411 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 449 [2022-11-02 20:06:04,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 405 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:06:04,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:04,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 449 [2022-11-02 20:06:04,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:04,811 INFO L130 PetriNetUnfolder]: 151/1542 cut-off events. [2022-11-02 20:06:04,812 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-11-02 20:06:04,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1707 conditions, 1542 events. 151/1542 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 11085 event pairs, 52 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 1536. Up to 135 conditions per place. [2022-11-02 20:06:04,859 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 22 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2022-11-02 20:06:04,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 403 transitions, 872 flow [2022-11-02 20:06:04,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:04,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2022-11-02 20:06:04,863 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9420935412026726 [2022-11-02 20:06:04,864 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1269 transitions. [2022-11-02 20:06:04,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1269 transitions. [2022-11-02 20:06:04,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:04,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1269 transitions. [2022-11-02 20:06:04,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:04,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:04,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:04,873 INFO L175 Difference]: Start difference. First operand has 392 places, 405 transitions, 826 flow. Second operand 3 states and 1269 transitions. [2022-11-02 20:06:04,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 403 transitions, 872 flow [2022-11-02 20:06:04,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 403 transitions, 872 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:06:04,882 INFO L231 Difference]: Finished difference. Result has 389 places, 401 transitions, 828 flow [2022-11-02 20:06:04,883 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=828, PETRI_PLACES=389, PETRI_TRANSITIONS=401} [2022-11-02 20:06:04,886 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -19 predicate places. [2022-11-02 20:06:04,886 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 401 transitions, 828 flow [2022-11-02 20:06:04,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.6666666666667) internal successors, (1244), 3 states have internal predecessors, (1244), 0 states have call successors, (0), 0 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:06:04,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:04,887 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] [2022-11-02 20:06:04,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:06:04,888 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 152356134, now seen corresponding path program 1 times [2022-11-02 20:06:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:04,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925007798] [2022-11-02 20:06:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:04,970 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:06:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:04,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925007798] [2022-11-02 20:06:04,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925007798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:04,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:04,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843233416] [2022-11-02 20:06:04,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:04,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:04,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:04,976 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 449 [2022-11-02 20:06:04,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 401 transitions, 828 flow. Second operand has 3 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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:06:04,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:04,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 449 [2022-11-02 20:06:04,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:05,969 INFO L130 PetriNetUnfolder]: 506/4414 cut-off events. [2022-11-02 20:06:05,969 INFO L131 PetriNetUnfolder]: For 63/80 co-relation queries the response was YES. [2022-11-02 20:06:06,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4902 conditions, 4414 events. 506/4414 cut-off events. For 63/80 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 44938 event pairs, 182 based on Foata normal form. 0/3728 useless extension candidates. Maximal degree in co-relation 3697. Up to 445 conditions per place. [2022-11-02 20:06:06,073 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 22 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2022-11-02 20:06:06,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 399 transitions, 874 flow [2022-11-02 20:06:06,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1269 transitions. [2022-11-02 20:06:06,079 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9420935412026726 [2022-11-02 20:06:06,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1269 transitions. [2022-11-02 20:06:06,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1269 transitions. [2022-11-02 20:06:06,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:06,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1269 transitions. [2022-11-02 20:06:06,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:06,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:06,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:06,090 INFO L175 Difference]: Start difference. First operand has 389 places, 401 transitions, 828 flow. Second operand 3 states and 1269 transitions. [2022-11-02 20:06:06,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 399 transitions, 874 flow [2022-11-02 20:06:06,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 399 transitions, 874 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:06:06,102 INFO L231 Difference]: Finished difference. Result has 386 places, 397 transitions, 830 flow [2022-11-02 20:06:06,103 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=830, PETRI_PLACES=386, PETRI_TRANSITIONS=397} [2022-11-02 20:06:06,104 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -22 predicate places. [2022-11-02 20:06:06,104 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 397 transitions, 830 flow [2022-11-02 20:06:06,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.0) internal successors, (1245), 3 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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:06:06,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:06,106 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] [2022-11-02 20:06:06,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:06:06,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:06,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:06,108 INFO L85 PathProgramCache]: Analyzing trace with hash 387392908, now seen corresponding path program 1 times [2022-11-02 20:06:06,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:06,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586932004] [2022-11-02 20:06:06,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:06,162 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:06:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:06,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586932004] [2022-11-02 20:06:06,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586932004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:06,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:06,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:06:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055519670] [2022-11-02 20:06:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:06,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:06,168 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 449 [2022-11-02 20:06:06,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 397 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:06:06,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:06,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 449 [2022-11-02 20:06:06,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:06,489 INFO L130 PetriNetUnfolder]: 79/1032 cut-off events. [2022-11-02 20:06:06,490 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:06:06,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 1032 events. 79/1032 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6924 event pairs, 10 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 869. Up to 35 conditions per place. [2022-11-02 20:06:06,528 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 14 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2022-11-02 20:06:06,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 401 transitions, 874 flow [2022-11-02 20:06:06,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-02 20:06:06,533 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9643652561247216 [2022-11-02 20:06:06,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-02 20:06:06,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-02 20:06:06,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:06,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-02 20:06:06,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:06,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:06,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:06,544 INFO L175 Difference]: Start difference. First operand has 386 places, 397 transitions, 830 flow. Second operand 3 states and 1299 transitions. [2022-11-02 20:06:06,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 401 transitions, 874 flow [2022-11-02 20:06:06,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 401 transitions, 874 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:06:06,557 INFO L231 Difference]: Finished difference. Result has 390 places, 399 transitions, 852 flow [2022-11-02 20:06:06,558 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=390, PETRI_TRANSITIONS=399} [2022-11-02 20:06:06,559 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -18 predicate places. [2022-11-02 20:06:06,559 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 399 transitions, 852 flow [2022-11-02 20:06:06,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:06:06,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:06,560 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] [2022-11-02 20:06:06,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:06:06,561 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2064032366, now seen corresponding path program 1 times [2022-11-02 20:06:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:06,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63841265] [2022-11-02 20:06:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:06,616 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:06:06,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:06,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63841265] [2022-11-02 20:06:06,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63841265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:06,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:06,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194707223] [2022-11-02 20:06:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:06,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:06,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:06,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:06,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:06,622 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 449 [2022-11-02 20:06:06,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 399 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:06,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:06,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 449 [2022-11-02 20:06:06,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:07,355 INFO L130 PetriNetUnfolder]: 206/2257 cut-off events. [2022-11-02 20:06:07,355 INFO L131 PetriNetUnfolder]: For 32/38 co-relation queries the response was YES. [2022-11-02 20:06:07,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 2257 events. 206/2257 cut-off events. For 32/38 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 19555 event pairs, 18 based on Foata normal form. 0/1980 useless extension candidates. Maximal degree in co-relation 2168. Up to 166 conditions per place. [2022-11-02 20:06:07,429 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 21 selfloop transitions, 4 changer transitions 0/404 dead transitions. [2022-11-02 20:06:07,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 404 transitions, 917 flow [2022-11-02 20:06:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2022-11-02 20:06:07,435 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9547141796585004 [2022-11-02 20:06:07,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1286 transitions. [2022-11-02 20:06:07,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1286 transitions. [2022-11-02 20:06:07,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:07,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1286 transitions. [2022-11-02 20:06:07,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.6666666666667) internal successors, (1286), 3 states have internal predecessors, (1286), 0 states have call successors, (0), 0 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:06:07,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:07,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:07,446 INFO L175 Difference]: Start difference. First operand has 390 places, 399 transitions, 852 flow. Second operand 3 states and 1286 transitions. [2022-11-02 20:06:07,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 404 transitions, 917 flow [2022-11-02 20:06:07,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 404 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:07,460 INFO L231 Difference]: Finished difference. Result has 387 places, 399 transitions, 866 flow [2022-11-02 20:06:07,461 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=387, PETRI_TRANSITIONS=399} [2022-11-02 20:06:07,461 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -21 predicate places. [2022-11-02 20:06:07,462 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 399 transitions, 866 flow [2022-11-02 20:06:07,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:07,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:07,463 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] [2022-11-02 20:06:07,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:06:07,463 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -739752300, now seen corresponding path program 1 times [2022-11-02 20:06:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537984651] [2022-11-02 20:06:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:07,538 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:06:07,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:07,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537984651] [2022-11-02 20:06:07,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537984651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:07,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:07,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271178563] [2022-11-02 20:06:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:07,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:07,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:07,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:07,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:07,544 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 449 [2022-11-02 20:06:07,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 399 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:07,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:07,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 449 [2022-11-02 20:06:07,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:08,559 INFO L130 PetriNetUnfolder]: 265/3097 cut-off events. [2022-11-02 20:06:08,559 INFO L131 PetriNetUnfolder]: For 43/45 co-relation queries the response was YES. [2022-11-02 20:06:08,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3434 conditions, 3097 events. 265/3097 cut-off events. For 43/45 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 27465 event pairs, 36 based on Foata normal form. 0/2702 useless extension candidates. Maximal degree in co-relation 3102. Up to 198 conditions per place. [2022-11-02 20:06:08,632 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 21 selfloop transitions, 4 changer transitions 0/404 dead transitions. [2022-11-02 20:06:08,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 404 transitions, 931 flow [2022-11-02 20:06:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1286 transitions. [2022-11-02 20:06:08,637 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9547141796585004 [2022-11-02 20:06:08,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1286 transitions. [2022-11-02 20:06:08,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1286 transitions. [2022-11-02 20:06:08,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:08,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1286 transitions. [2022-11-02 20:06:08,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.6666666666667) internal successors, (1286), 3 states have internal predecessors, (1286), 0 states have call successors, (0), 0 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:06:08,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:08,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:08,647 INFO L175 Difference]: Start difference. First operand has 387 places, 399 transitions, 866 flow. Second operand 3 states and 1286 transitions. [2022-11-02 20:06:08,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 404 transitions, 931 flow [2022-11-02 20:06:08,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 404 transitions, 931 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:06:08,658 INFO L231 Difference]: Finished difference. Result has 386 places, 399 transitions, 886 flow [2022-11-02 20:06:08,659 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=386, PETRI_TRANSITIONS=399} [2022-11-02 20:06:08,660 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -22 predicate places. [2022-11-02 20:06:08,660 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 399 transitions, 886 flow [2022-11-02 20:06:08,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:08,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:08,661 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] [2022-11-02 20:06:08,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:06:08,662 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:08,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1436098520, now seen corresponding path program 1 times [2022-11-02 20:06:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:08,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029544870] [2022-11-02 20:06:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:08,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:08,707 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:06:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:08,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029544870] [2022-11-02 20:06:08,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029544870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:08,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:08,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:08,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42306212] [2022-11-02 20:06:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:08,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:08,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:08,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:08,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:08,712 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 449 [2022-11-02 20:06:08,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 399 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 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:06:08,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:08,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 449 [2022-11-02 20:06:08,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:09,364 INFO L130 PetriNetUnfolder]: 236/3040 cut-off events. [2022-11-02 20:06:09,364 INFO L131 PetriNetUnfolder]: For 10/18 co-relation queries the response was YES. [2022-11-02 20:06:09,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 3040 events. 236/3040 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 28574 event pairs, 14 based on Foata normal form. 1/2666 useless extension candidates. Maximal degree in co-relation 3045. Up to 62 conditions per place. [2022-11-02 20:06:09,432 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 13 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2022-11-02 20:06:09,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 400 transitions, 920 flow [2022-11-02 20:06:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1294 transitions. [2022-11-02 20:06:09,437 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9606533036377134 [2022-11-02 20:06:09,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1294 transitions. [2022-11-02 20:06:09,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1294 transitions. [2022-11-02 20:06:09,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:09,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1294 transitions. [2022-11-02 20:06:09,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 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:06:09,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:09,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:09,447 INFO L175 Difference]: Start difference. First operand has 386 places, 399 transitions, 886 flow. Second operand 3 states and 1294 transitions. [2022-11-02 20:06:09,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 400 transitions, 920 flow [2022-11-02 20:06:09,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 400 transitions, 920 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:06:09,457 INFO L231 Difference]: Finished difference. Result has 387 places, 398 transitions, 888 flow [2022-11-02 20:06:09,458 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=387, PETRI_TRANSITIONS=398} [2022-11-02 20:06:09,458 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -21 predicate places. [2022-11-02 20:06:09,458 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 398 transitions, 888 flow [2022-11-02 20:06:09,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 0 states have call successors, (0), 0 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:06:09,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:09,460 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] [2022-11-02 20:06:09,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:06:09,460 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:09,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1505446649, now seen corresponding path program 1 times [2022-11-02 20:06:09,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:09,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93962747] [2022-11-02 20:06:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:09,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:06:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93962747] [2022-11-02 20:06:09,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93962747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:09,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:09,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:06:09,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373530282] [2022-11-02 20:06:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:09,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:09,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:09,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:09,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:09,533 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 449 [2022-11-02 20:06:09,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 398 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 428.6666666666667) internal successors, (1286), 3 states have internal predecessors, (1286), 0 states have call successors, (0), 0 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:06:09,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:09,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 449 [2022-11-02 20:06:09,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:10,244 INFO L130 PetriNetUnfolder]: 221/2501 cut-off events. [2022-11-02 20:06:10,244 INFO L131 PetriNetUnfolder]: For 33/54 co-relation queries the response was YES. [2022-11-02 20:06:10,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 2501 events. 221/2501 cut-off events. For 33/54 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 22113 event pairs, 42 based on Foata normal form. 0/2184 useless extension candidates. Maximal degree in co-relation 2383. Up to 136 conditions per place. [2022-11-02 20:06:10,308 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 14 selfloop transitions, 3 changer transitions 0/402 dead transitions. [2022-11-02 20:06:10,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 402 transitions, 932 flow [2022-11-02 20:06:10,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:10,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-02 20:06:10,312 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9643652561247216 [2022-11-02 20:06:10,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-02 20:06:10,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-02 20:06:10,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:10,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-02 20:06:10,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:10,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:10,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:10,321 INFO L175 Difference]: Start difference. First operand has 387 places, 398 transitions, 888 flow. Second operand 3 states and 1299 transitions. [2022-11-02 20:06:10,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 402 transitions, 932 flow [2022-11-02 20:06:10,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 402 transitions, 928 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:10,331 INFO L231 Difference]: Finished difference. Result has 389 places, 400 transitions, 906 flow [2022-11-02 20:06:10,332 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=389, PETRI_TRANSITIONS=400} [2022-11-02 20:06:10,333 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -19 predicate places. [2022-11-02 20:06:10,333 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 400 transitions, 906 flow [2022-11-02 20:06:10,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.6666666666667) internal successors, (1286), 3 states have internal predecessors, (1286), 0 states have call successors, (0), 0 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:06:10,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:10,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:06:10,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:06:10,334 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:10,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash 218922719, now seen corresponding path program 1 times [2022-11-02 20:06:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:10,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958630696] [2022-11-02 20:06:10,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:10,978 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:06:10,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958630696] [2022-11-02 20:06:10,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958630696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:10,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:10,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:06:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236249840] [2022-11-02 20:06:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:10,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:06:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:06:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:06:10,983 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 449 [2022-11-02 20:06:10,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 400 transitions, 906 flow. Second operand has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 0 states have call successors, (0), 0 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:06:10,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:10,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 449 [2022-11-02 20:06:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:11,672 INFO L130 PetriNetUnfolder]: 118/1731 cut-off events. [2022-11-02 20:06:11,672 INFO L131 PetriNetUnfolder]: For 18/34 co-relation queries the response was YES. [2022-11-02 20:06:11,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 1731 events. 118/1731 cut-off events. For 18/34 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13256 event pairs, 2 based on Foata normal form. 8/1536 useless extension candidates. Maximal degree in co-relation 1670. Up to 44 conditions per place. [2022-11-02 20:06:11,723 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 23 selfloop transitions, 4 changer transitions 0/399 dead transitions. [2022-11-02 20:06:11,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 399 transitions, 958 flow [2022-11-02 20:06:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:06:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:06:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2488 transitions. [2022-11-02 20:06:11,731 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9235337787676318 [2022-11-02 20:06:11,731 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2488 transitions. [2022-11-02 20:06:11,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2488 transitions. [2022-11-02 20:06:11,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:11,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2488 transitions. [2022-11-02 20:06:11,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 414.6666666666667) internal successors, (2488), 6 states have internal predecessors, (2488), 0 states have call successors, (0), 0 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:06:11,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 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:06:11,747 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 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:06:11,748 INFO L175 Difference]: Start difference. First operand has 389 places, 400 transitions, 906 flow. Second operand 6 states and 2488 transitions. [2022-11-02 20:06:11,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 399 transitions, 958 flow [2022-11-02 20:06:11,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 399 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:11,758 INFO L231 Difference]: Finished difference. Result has 391 places, 399 transitions, 906 flow [2022-11-02 20:06:11,759 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=391, PETRI_TRANSITIONS=399} [2022-11-02 20:06:11,760 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -17 predicate places. [2022-11-02 20:06:11,760 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 399 transitions, 906 flow [2022-11-02 20:06:11,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 412.0) internal successors, (2472), 6 states have internal predecessors, (2472), 0 states have call successors, (0), 0 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:06:11,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:11,762 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] [2022-11-02 20:06:11,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:06:11,762 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1244699003, now seen corresponding path program 1 times [2022-11-02 20:06:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:11,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968531007] [2022-11-02 20:06:11,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:11,832 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:06:11,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:11,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968531007] [2022-11-02 20:06:11,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968531007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:11,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:11,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256909730] [2022-11-02 20:06:11,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:11,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:11,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:11,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:11,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:11,840 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 449 [2022-11-02 20:06:11,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 399 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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:06:11,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:11,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 449 [2022-11-02 20:06:11,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:12,829 INFO L130 PetriNetUnfolder]: 390/4359 cut-off events. [2022-11-02 20:06:12,829 INFO L131 PetriNetUnfolder]: For 39/62 co-relation queries the response was YES. [2022-11-02 20:06:12,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5059 conditions, 4359 events. 390/4359 cut-off events. For 39/62 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 44603 event pairs, 32 based on Foata normal form. 2/3846 useless extension candidates. Maximal degree in co-relation 4544. Up to 132 conditions per place. [2022-11-02 20:06:12,945 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 16 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2022-11-02 20:06:12,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 400 transitions, 946 flow [2022-11-02 20:06:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2022-11-02 20:06:12,950 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9561989606533037 [2022-11-02 20:06:12,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1288 transitions. [2022-11-02 20:06:12,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1288 transitions. [2022-11-02 20:06:12,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:12,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1288 transitions. [2022-11-02 20:06:12,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 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:06:12,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:12,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:12,960 INFO L175 Difference]: Start difference. First operand has 391 places, 399 transitions, 906 flow. Second operand 3 states and 1288 transitions. [2022-11-02 20:06:12,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 400 transitions, 946 flow [2022-11-02 20:06:12,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 400 transitions, 939 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:06:12,971 INFO L231 Difference]: Finished difference. Result has 388 places, 398 transitions, 901 flow [2022-11-02 20:06:12,972 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=388, PETRI_TRANSITIONS=398} [2022-11-02 20:06:12,972 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -20 predicate places. [2022-11-02 20:06:12,973 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 398 transitions, 901 flow [2022-11-02 20:06:12,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.6666666666667) internal successors, (1274), 3 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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:06:12,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:12,974 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] [2022-11-02 20:06:12,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:06:12,974 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:12,975 INFO L85 PathProgramCache]: Analyzing trace with hash 874417473, now seen corresponding path program 1 times [2022-11-02 20:06:12,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:12,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939876136] [2022-11-02 20:06:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:13,029 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:06:13,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:13,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939876136] [2022-11-02 20:06:13,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939876136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:13,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:13,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:13,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081956656] [2022-11-02 20:06:13,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:13,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:13,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:13,033 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 419 out of 449 [2022-11-02 20:06:13,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 398 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:13,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:13,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 419 of 449 [2022-11-02 20:06:13,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:14,377 INFO L130 PetriNetUnfolder]: 648/5890 cut-off events. [2022-11-02 20:06:14,377 INFO L131 PetriNetUnfolder]: For 80/89 co-relation queries the response was YES. [2022-11-02 20:06:14,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6925 conditions, 5890 events. 648/5890 cut-off events. For 80/89 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 64448 event pairs, 68 based on Foata normal form. 2/5310 useless extension candidates. Maximal degree in co-relation 6339. Up to 585 conditions per place. [2022-11-02 20:06:14,453 INFO L137 encePairwiseOnDemand]: 441/449 looper letters, 20 selfloop transitions, 4 changer transitions 0/402 dead transitions. [2022-11-02 20:06:14,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 402 transitions, 961 flow [2022-11-02 20:06:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1285 transitions. [2022-11-02 20:06:14,458 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9539717891610987 [2022-11-02 20:06:14,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1285 transitions. [2022-11-02 20:06:14,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1285 transitions. [2022-11-02 20:06:14,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:14,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1285 transitions. [2022-11-02 20:06:14,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:06:14,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:14,468 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:14,468 INFO L175 Difference]: Start difference. First operand has 388 places, 398 transitions, 901 flow. Second operand 3 states and 1285 transitions. [2022-11-02 20:06:14,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 402 transitions, 961 flow [2022-11-02 20:06:14,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 402 transitions, 957 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:14,480 INFO L231 Difference]: Finished difference. Result has 385 places, 398 transitions, 917 flow [2022-11-02 20:06:14,481 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=385, PETRI_TRANSITIONS=398} [2022-11-02 20:06:14,481 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -23 predicate places. [2022-11-02 20:06:14,482 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 398 transitions, 917 flow [2022-11-02 20:06:14,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 421.0) internal successors, (1263), 3 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:14,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:14,483 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] [2022-11-02 20:06:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:06:14,483 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:14,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash -322835034, now seen corresponding path program 1 times [2022-11-02 20:06:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:14,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75446754] [2022-11-02 20:06:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:14,560 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:06:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:14,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75446754] [2022-11-02 20:06:14,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75446754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:14,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:14,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:06:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409551426] [2022-11-02 20:06:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:14,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:14,564 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 449 [2022-11-02 20:06:14,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 398 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 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:06:14,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:14,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 449 [2022-11-02 20:06:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:15,625 INFO L130 PetriNetUnfolder]: 414/4047 cut-off events. [2022-11-02 20:06:15,626 INFO L131 PetriNetUnfolder]: For 111/131 co-relation queries the response was YES. [2022-11-02 20:06:15,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4865 conditions, 4047 events. 414/4047 cut-off events. For 111/131 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 39602 event pairs, 64 based on Foata normal form. 2/3595 useless extension candidates. Maximal degree in co-relation 4762. Up to 286 conditions per place. [2022-11-02 20:06:15,714 INFO L137 encePairwiseOnDemand]: 445/449 looper letters, 14 selfloop transitions, 3 changer transitions 0/402 dead transitions. [2022-11-02 20:06:15,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 402 transitions, 961 flow [2022-11-02 20:06:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:15,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2022-11-02 20:06:15,719 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9643652561247216 [2022-11-02 20:06:15,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1299 transitions. [2022-11-02 20:06:15,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1299 transitions. [2022-11-02 20:06:15,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:15,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1299 transitions. [2022-11-02 20:06:15,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:15,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:15,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:15,729 INFO L175 Difference]: Start difference. First operand has 385 places, 398 transitions, 917 flow. Second operand 3 states and 1299 transitions. [2022-11-02 20:06:15,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 402 transitions, 961 flow [2022-11-02 20:06:15,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 402 transitions, 961 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:06:15,740 INFO L231 Difference]: Finished difference. Result has 389 places, 400 transitions, 939 flow [2022-11-02 20:06:15,741 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=939, PETRI_PLACES=389, PETRI_TRANSITIONS=400} [2022-11-02 20:06:15,741 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -19 predicate places. [2022-11-02 20:06:15,742 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 400 transitions, 939 flow [2022-11-02 20:06:15,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 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:06:15,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:15,743 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] [2022-11-02 20:06:15,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:06:15,743 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:15,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:15,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1248299634, now seen corresponding path program 1 times [2022-11-02 20:06:15,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:15,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466442261] [2022-11-02 20:06:15,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:15,797 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:06:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:15,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466442261] [2022-11-02 20:06:15,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466442261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:15,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:15,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763563736] [2022-11-02 20:06:15,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:15,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:15,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:15,802 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 449 [2022-11-02 20:06:15,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 400 transitions, 939 flow. Second operand has 3 states, 3 states have (on average 425.0) internal successors, (1275), 3 states have internal predecessors, (1275), 0 states have call successors, (0), 0 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:06:15,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:15,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 449 [2022-11-02 20:06:15,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:16,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L56-50-->L56-51: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet24#1][255], [120#L56-51true, Black: 511#true, Black: 480#true, Black: 516#true, 522#true, Black: 485#true, 276#L76-7true, Black: 459#true, 461#(= |#race~sort_label_is_null_1~0| 0), 513#(= |#race~sort_label_4~0| 0), 466#(= |#race~sort_label_is_null_3~0| 0), Black: 496#(not |thread2Thread1of1ForFork2_#t~short11#1|), 487#(= |#race~sort_label_2~0| 0), Black: 464#true, 482#(= |#race~sort_label_0~0| 0), 505#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 471#(= |#race~sort_label_is_null_5~0| 0), Black: 469#true, 518#(not |thread3Thread1of1ForFork0_#t~short19#1|), Black: 476#(not |thread1Thread1of1ForFork1_#t~short3#1|)]) [2022-11-02 20:06:16,864 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is not cut-off event [2022-11-02 20:06:16,864 INFO L386 tUnfolder$Statistics]: existing Event has 190 ancestors and is not cut-off event [2022-11-02 20:06:16,865 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-11-02 20:06:16,865 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-11-02 20:06:16,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1217] L56-50-->L56-51: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet24#1][255], [120#L56-51true, Black: 511#true, Black: 480#true, 522#true, Black: 485#true, Black: 518#(not |thread3Thread1of1ForFork0_#t~short19#1|), 276#L76-7true, Black: 459#true, 516#true, 461#(= |#race~sort_label_is_null_1~0| 0), Black: 496#(not |thread2Thread1of1ForFork2_#t~short11#1|), 466#(= |#race~sort_label_is_null_3~0| 0), 513#(= |#race~sort_label_4~0| 0), 487#(= |#race~sort_label_2~0| 0), Black: 464#true, 482#(= |#race~sort_label_0~0| 0), 505#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 471#(= |#race~sort_label_is_null_5~0| 0), Black: 469#true, Black: 476#(not |thread1Thread1of1ForFork1_#t~short3#1|)]) [2022-11-02 20:06:16,866 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is not cut-off event [2022-11-02 20:06:16,866 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is not cut-off event [2022-11-02 20:06:16,867 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is not cut-off event [2022-11-02 20:06:16,867 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is not cut-off event [2022-11-02 20:06:16,914 INFO L130 PetriNetUnfolder]: 392/3435 cut-off events. [2022-11-02 20:06:16,915 INFO L131 PetriNetUnfolder]: For 220/224 co-relation queries the response was YES. [2022-11-02 20:06:16,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 3435 events. 392/3435 cut-off events. For 220/224 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 33490 event pairs, 48 based on Foata normal form. 0/3142 useless extension candidates. Maximal degree in co-relation 4398. Up to 248 conditions per place. [2022-11-02 20:06:16,988 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 15 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2022-11-02 20:06:16,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 401 transitions, 977 flow [2022-11-02 20:06:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1287 transitions. [2022-11-02 20:06:16,994 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.955456570155902 [2022-11-02 20:06:16,994 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1287 transitions. [2022-11-02 20:06:16,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1287 transitions. [2022-11-02 20:06:16,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:16,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1287 transitions. [2022-11-02 20:06:16,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.0) internal successors, (1287), 3 states have internal predecessors, (1287), 0 states have call successors, (0), 0 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:06:17,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:17,004 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:17,005 INFO L175 Difference]: Start difference. First operand has 389 places, 400 transitions, 939 flow. Second operand 3 states and 1287 transitions. [2022-11-02 20:06:17,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 401 transitions, 977 flow [2022-11-02 20:06:17,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 401 transitions, 971 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:17,018 INFO L231 Difference]: Finished difference. Result has 388 places, 399 transitions, 935 flow [2022-11-02 20:06:17,019 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=935, PETRI_PLACES=388, PETRI_TRANSITIONS=399} [2022-11-02 20:06:17,020 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -20 predicate places. [2022-11-02 20:06:17,020 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 399 transitions, 935 flow [2022-11-02 20:06:17,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 425.0) internal successors, (1275), 3 states have internal predecessors, (1275), 0 states have call successors, (0), 0 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:06:17,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:17,021 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] [2022-11-02 20:06:17,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:06:17,022 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash 345419326, now seen corresponding path program 1 times [2022-11-02 20:06:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:17,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044326610] [2022-11-02 20:06:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:17,900 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:06:17,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:17,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044326610] [2022-11-02 20:06:17,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044326610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:17,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:17,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:06:17,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051192647] [2022-11-02 20:06:17,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:17,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:06:17,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:17,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:06:17,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:06:17,908 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 449 [2022-11-02 20:06:17,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 399 transitions, 935 flow. Second operand has 6 states, 6 states have (on average 413.0) internal successors, (2478), 6 states have internal predecessors, (2478), 0 states have call successors, (0), 0 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:06:17,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:17,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 449 [2022-11-02 20:06:17,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:18,789 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1298] thread3EXIT-->L77-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][374], [Black: 511#true, Black: 480#true, 522#true, Black: 518#(not |thread3Thread1of1ForFork0_#t~short19#1|), Black: 485#true, Black: 459#true, 461#(= |#race~sort_label_is_null_1~0| 0), 51#L77-7true, 466#(= |#race~sort_label_is_null_3~0| 0), 513#(= |#race~sort_label_4~0| 0), Black: 496#(not |thread2Thread1of1ForFork2_#t~short11#1|), 487#(= |#race~sort_label_2~0| 0), Black: 464#true, 482#(= |#race~sort_label_0~0| 0), 505#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 471#(= |#race~sort_label_is_null_5~0| 0), Black: 469#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 476#(not |thread1Thread1of1ForFork1_#t~short3#1|)]) [2022-11-02 20:06:18,789 INFO L383 tUnfolder$Statistics]: this new event has 198 ancestors and is not cut-off event [2022-11-02 20:06:18,789 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-02 20:06:18,789 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-02 20:06:18,789 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-02 20:06:18,800 INFO L130 PetriNetUnfolder]: 237/2880 cut-off events. [2022-11-02 20:06:18,801 INFO L131 PetriNetUnfolder]: For 2/18 co-relation queries the response was YES. [2022-11-02 20:06:18,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 2880 events. 237/2880 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 25919 event pairs, 3 based on Foata normal form. 0/2640 useless extension candidates. Maximal degree in co-relation 3392. Up to 134 conditions per place. [2022-11-02 20:06:18,876 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 22 selfloop transitions, 4 changer transitions 0/398 dead transitions. [2022-11-02 20:06:18,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 398 transitions, 985 flow [2022-11-02 20:06:18,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:06:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:06:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2022-11-02 20:06:18,884 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.923162583518931 [2022-11-02 20:06:18,884 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2487 transitions. [2022-11-02 20:06:18,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2487 transitions. [2022-11-02 20:06:18,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:18,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2487 transitions. [2022-11-02 20:06:18,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 414.5) internal successors, (2487), 6 states have internal predecessors, (2487), 0 states have call successors, (0), 0 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:06:18,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 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:06:18,902 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 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:06:18,903 INFO L175 Difference]: Start difference. First operand has 388 places, 399 transitions, 935 flow. Second operand 6 states and 2487 transitions. [2022-11-02 20:06:18,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 398 transitions, 985 flow [2022-11-02 20:06:18,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 398 transitions, 981 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:06:18,918 INFO L231 Difference]: Finished difference. Result has 390 places, 398 transitions, 937 flow [2022-11-02 20:06:18,919 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=390, PETRI_TRANSITIONS=398} [2022-11-02 20:06:18,920 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -18 predicate places. [2022-11-02 20:06:18,920 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 398 transitions, 937 flow [2022-11-02 20:06:18,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 413.0) internal successors, (2478), 6 states have internal predecessors, (2478), 0 states have call successors, (0), 0 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:06:18,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:18,922 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] [2022-11-02 20:06:18,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:06:18,922 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1278589377, now seen corresponding path program 1 times [2022-11-02 20:06:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731485593] [2022-11-02 20:06:18,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:18,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:19,750 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:06:19,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:19,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731485593] [2022-11-02 20:06:19,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731485593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:19,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:19,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:06:19,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358631891] [2022-11-02 20:06:19,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:19,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:06:19,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:19,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:06:19,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:06:19,765 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 449 [2022-11-02 20:06:19,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 398 transitions, 937 flow. Second operand has 6 states, 6 states have (on average 414.0) internal successors, (2484), 6 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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:06:19,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:19,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 449 [2022-11-02 20:06:19,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:20,540 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1298] thread3EXIT-->L77-7: Formula: (and (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_5|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][373], [Black: 511#true, Black: 480#true, Black: 485#true, Black: 518#(not |thread3Thread1of1ForFork0_#t~short19#1|), Black: 459#true, 461#(= |#race~sort_label_is_null_1~0| 0), 51#L77-7true, 466#(= |#race~sort_label_is_null_3~0| 0), Black: 496#(not |thread2Thread1of1ForFork2_#t~short11#1|), 513#(= |#race~sort_label_4~0| 0), 487#(= |#race~sort_label_2~0| 0), Black: 464#true, 538#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), 482#(= |#race~sort_label_0~0| 0), 505#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 471#(= |#race~sort_label_is_null_5~0| 0), Black: 469#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 476#(not |thread1Thread1of1ForFork1_#t~short3#1|)]) [2022-11-02 20:06:20,541 INFO L383 tUnfolder$Statistics]: this new event has 198 ancestors and is not cut-off event [2022-11-02 20:06:20,541 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-02 20:06:20,541 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is not cut-off event [2022-11-02 20:06:20,541 INFO L386 tUnfolder$Statistics]: existing Event has 198 ancestors and is not cut-off event [2022-11-02 20:06:20,554 INFO L130 PetriNetUnfolder]: 237/2876 cut-off events. [2022-11-02 20:06:20,554 INFO L131 PetriNetUnfolder]: For 4/20 co-relation queries the response was YES. [2022-11-02 20:06:20,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 2876 events. 237/2876 cut-off events. For 4/20 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 25911 event pairs, 3 based on Foata normal form. 0/2640 useless extension candidates. Maximal degree in co-relation 3310. Up to 134 conditions per place. [2022-11-02 20:06:20,640 INFO L137 encePairwiseOnDemand]: 444/449 looper letters, 21 selfloop transitions, 4 changer transitions 0/397 dead transitions. [2022-11-02 20:06:20,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 397 transitions, 985 flow [2022-11-02 20:06:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:06:20,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:06:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2486 transitions. [2022-11-02 20:06:20,647 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9227913882702301 [2022-11-02 20:06:20,647 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2486 transitions. [2022-11-02 20:06:20,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2486 transitions. [2022-11-02 20:06:20,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:20,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2486 transitions. [2022-11-02 20:06:20,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 414.3333333333333) internal successors, (2486), 6 states have internal predecessors, (2486), 0 states have call successors, (0), 0 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:06:20,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 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:06:20,661 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 449.0) internal successors, (3143), 7 states have internal predecessors, (3143), 0 states have call successors, (0), 0 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:06:20,661 INFO L175 Difference]: Start difference. First operand has 390 places, 398 transitions, 937 flow. Second operand 6 states and 2486 transitions. [2022-11-02 20:06:20,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 397 transitions, 985 flow [2022-11-02 20:06:20,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 397 transitions, 978 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:06:20,671 INFO L231 Difference]: Finished difference. Result has 390 places, 397 transitions, 936 flow [2022-11-02 20:06:20,672 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=936, PETRI_PLACES=390, PETRI_TRANSITIONS=397} [2022-11-02 20:06:20,673 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -18 predicate places. [2022-11-02 20:06:20,673 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 397 transitions, 936 flow [2022-11-02 20:06:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 414.0) internal successors, (2484), 6 states have internal predecessors, (2484), 0 states have call successors, (0), 0 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:06:20,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:20,675 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] [2022-11-02 20:06:20,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:06:20,676 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:20,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2078696486, now seen corresponding path program 1 times [2022-11-02 20:06:20,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:20,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187189254] [2022-11-02 20:06:20,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:20,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:20,779 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:06:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:20,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187189254] [2022-11-02 20:06:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187189254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:20,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:20,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869319543] [2022-11-02 20:06:20,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:20,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:20,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:20,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:20,784 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 449 [2022-11-02 20:06:20,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 397 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 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:06:20,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:20,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 449 [2022-11-02 20:06:20,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:21,972 INFO L130 PetriNetUnfolder]: 400/4870 cut-off events. [2022-11-02 20:06:21,972 INFO L131 PetriNetUnfolder]: For 13/21 co-relation queries the response was YES. [2022-11-02 20:06:22,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 4870 events. 400/4870 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51884 event pairs, 19 based on Foata normal form. 0/4482 useless extension candidates. Maximal degree in co-relation 5599. Up to 210 conditions per place. [2022-11-02 20:06:22,086 INFO L137 encePairwiseOnDemand]: 447/449 looper letters, 9 selfloop transitions, 1 changer transitions 0/396 dead transitions. [2022-11-02 20:06:22,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 396 transitions, 954 flow [2022-11-02 20:06:22,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1295 transitions. [2022-11-02 20:06:22,090 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.961395694135115 [2022-11-02 20:06:22,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1295 transitions. [2022-11-02 20:06:22,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1295 transitions. [2022-11-02 20:06:22,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:22,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1295 transitions. [2022-11-02 20:06:22,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:06:22,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:22,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:22,099 INFO L175 Difference]: Start difference. First operand has 390 places, 397 transitions, 936 flow. Second operand 3 states and 1295 transitions. [2022-11-02 20:06:22,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 396 transitions, 954 flow [2022-11-02 20:06:22,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 396 transitions, 947 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:06:22,110 INFO L231 Difference]: Finished difference. Result has 387 places, 396 transitions, 929 flow [2022-11-02 20:06:22,110 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=929, PETRI_PLACES=387, PETRI_TRANSITIONS=396} [2022-11-02 20:06:22,111 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -21 predicate places. [2022-11-02 20:06:22,111 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 396 transitions, 929 flow [2022-11-02 20:06:22,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 0 states have call successors, (0), 0 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:06:22,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:22,112 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] [2022-11-02 20:06:22,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:06:22,113 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:22,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash -329191748, now seen corresponding path program 1 times [2022-11-02 20:06:22,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:22,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038859204] [2022-11-02 20:06:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:22,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:22,198 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:06:22,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:22,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038859204] [2022-11-02 20:06:22,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038859204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:22,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:22,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:22,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028320872] [2022-11-02 20:06:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:22,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:22,203 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2022-11-02 20:06:22,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 396 transitions, 929 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:06:22,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:22,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2022-11-02 20:06:22,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:23,440 INFO L130 PetriNetUnfolder]: 479/5699 cut-off events. [2022-11-02 20:06:23,440 INFO L131 PetriNetUnfolder]: For 29/45 co-relation queries the response was YES. [2022-11-02 20:06:23,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6841 conditions, 5699 events. 479/5699 cut-off events. For 29/45 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 63639 event pairs, 47 based on Foata normal form. 0/5263 useless extension candidates. Maximal degree in co-relation 6709. Up to 193 conditions per place. [2022-11-02 20:06:23,567 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 11 selfloop transitions, 1 changer transitions 0/394 dead transitions. [2022-11-02 20:06:23,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 394 transitions, 949 flow [2022-11-02 20:06:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2022-11-02 20:06:23,569 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9569413511507052 [2022-11-02 20:06:23,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1289 transitions. [2022-11-02 20:06:23,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1289 transitions. [2022-11-02 20:06:23,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:23,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1289 transitions. [2022-11-02 20:06:23,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.6666666666667) internal successors, (1289), 3 states have internal predecessors, (1289), 0 states have call successors, (0), 0 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:06:23,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:23,576 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:23,576 INFO L175 Difference]: Start difference. First operand has 387 places, 396 transitions, 929 flow. Second operand 3 states and 1289 transitions. [2022-11-02 20:06:23,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 394 transitions, 949 flow [2022-11-02 20:06:23,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 394 transitions, 948 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:06:23,588 INFO L231 Difference]: Finished difference. Result has 386 places, 394 transitions, 926 flow [2022-11-02 20:06:23,589 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=386, PETRI_TRANSITIONS=394} [2022-11-02 20:06:23,590 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -22 predicate places. [2022-11-02 20:06:23,590 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 394 transitions, 926 flow [2022-11-02 20:06:23,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:06:23,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:06:23,591 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] [2022-11-02 20:06:23,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:06:23,592 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2022-11-02 20:06:23,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:06:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash 446661139, now seen corresponding path program 1 times [2022-11-02 20:06:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:06:23,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436782037] [2022-11-02 20:06:23,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:06:23,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:06:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:06:23,674 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:06:23,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:06:23,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436782037] [2022-11-02 20:06:23,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436782037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:06:23,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:06:23,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:06:23,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746726502] [2022-11-02 20:06:23,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:06:23,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:06:23,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:06:23,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:06:23,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:06:23,678 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 425 out of 449 [2022-11-02 20:06:23,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 394 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:06:23,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:06:23,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 425 of 449 [2022-11-02 20:06:23,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:06:24,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1222] L56-51-->L56-52: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork0_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][264], [Black: 511#true, Black: 480#true, Black: 516#true, Black: 485#true, 276#L76-7true, 548#true, Black: 459#true, 461#(= |#race~sort_label_is_null_1~0| 0), 177#L56-52true, 466#(= |#race~sort_label_is_null_3~0| 0), Black: 496#(not |thread2Thread1of1ForFork2_#t~short11#1|), 513#(= |#race~sort_label_4~0| 0), 487#(= |#race~sort_label_2~0| 0), Black: 464#true, 544#true, 482#(= |#race~sort_label_0~0| 0), 505#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 471#(= |#race~sort_label_is_null_5~0| 0), Black: 469#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 476#(not |thread1Thread1of1ForFork1_#t~short3#1|)]) [2022-11-02 20:06:24,428 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is not cut-off event [2022-11-02 20:06:24,428 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is not cut-off event [2022-11-02 20:06:24,428 INFO L386 tUnfolder$Statistics]: existing Event has 191 ancestors and is not cut-off event [2022-11-02 20:06:24,428 INFO L386 tUnfolder$Statistics]: existing Event has 183 ancestors and is not cut-off event [2022-11-02 20:06:24,429 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1222] L56-51-->L56-52: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork0_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork0_#t~nondet24#1=|v_thread3Thread1of1ForFork0_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][264], [Black: 511#true, Black: 480#true, Black: 518#(not |thread3Thread1of1ForFork0_#t~short19#1|), 276#L76-7true, Black: 485#true, 548#true, Black: 459#true, 461#(= |#race~sort_label_is_null_1~0| 0), 177#L56-52true, Black: 496#(not |thread2Thread1of1ForFork2_#t~short11#1|), 466#(= |#race~sort_label_is_null_3~0| 0), 513#(= |#race~sort_label_4~0| 0), 487#(= |#race~sort_label_2~0| 0), Black: 464#true, 544#true, 482#(= |#race~sort_label_0~0| 0), 505#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 471#(= |#race~sort_label_is_null_5~0| 0), Black: 469#true, 531#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 476#(not |thread1Thread1of1ForFork1_#t~short3#1|)]) [2022-11-02 20:06:24,429 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is not cut-off event [2022-11-02 20:06:24,429 INFO L386 tUnfolder$Statistics]: existing Event has 179 ancestors and is not cut-off event [2022-11-02 20:06:24,429 INFO L386 tUnfolder$Statistics]: existing Event has 182 ancestors and is not cut-off event [2022-11-02 20:06:24,429 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is not cut-off event [2022-11-02 20:06:24,453 INFO L130 PetriNetUnfolder]: 335/3301 cut-off events. [2022-11-02 20:06:24,453 INFO L131 PetriNetUnfolder]: For 87/91 co-relation queries the response was YES. [2022-11-02 20:06:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4129 conditions, 3301 events. 335/3301 cut-off events. For 87/91 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 31480 event pairs, 63 based on Foata normal form. 5/3038 useless extension candidates. Maximal degree in co-relation 4052. Up to 273 conditions per place. [2022-11-02 20:06:24,517 INFO L137 encePairwiseOnDemand]: 446/449 looper letters, 0 selfloop transitions, 0 changer transitions 392/392 dead transitions. [2022-11-02 20:06:24,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 392 transitions, 944 flow [2022-11-02 20:06:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:06:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:06:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1288 transitions. [2022-11-02 20:06:24,522 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9561989606533037 [2022-11-02 20:06:24,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1288 transitions. [2022-11-02 20:06:24,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1288 transitions. [2022-11-02 20:06:24,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:06:24,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1288 transitions. [2022-11-02 20:06:24,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 0 states have call successors, (0), 0 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:06:24,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:24,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 449.0) internal successors, (1796), 4 states have internal predecessors, (1796), 0 states have call successors, (0), 0 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:06:24,527 INFO L175 Difference]: Start difference. First operand has 386 places, 394 transitions, 926 flow. Second operand 3 states and 1288 transitions. [2022-11-02 20:06:24,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 392 transitions, 944 flow [2022-11-02 20:06:24,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 392 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:06:24,534 INFO L231 Difference]: Finished difference. Result has 385 places, 0 transitions, 0 flow [2022-11-02 20:06:24,534 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=449, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=385, PETRI_TRANSITIONS=0} [2022-11-02 20:06:24,535 INFO L287 CegarLoopForPetriNet]: 408 programPoint places, -23 predicate places. [2022-11-02 20:06:24,535 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 0 transitions, 0 flow [2022-11-02 20:06:24,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 0 states have call successors, (0), 0 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:06:24,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2022-11-02 20:06:24,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2022-11-02 20:06:24,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2022-11-02 20:06:24,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2022-11-02 20:06:24,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2022-11-02 20:06:24,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2022-11-02 20:06:24,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2022-11-02 20:06:24,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2022-11-02 20:06:24,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2022-11-02 20:06:24,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2022-11-02 20:06:24,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2022-11-02 20:06:24,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2022-11-02 20:06:24,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2022-11-02 20:06:24,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2022-11-02 20:06:24,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2022-11-02 20:06:24,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2022-11-02 20:06:24,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2022-11-02 20:06:24,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2022-11-02 20:06:24,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2022-11-02 20:06:24,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2022-11-02 20:06:24,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2022-11-02 20:06:24,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2022-11-02 20:06:24,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2022-11-02 20:06:24,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2022-11-02 20:06:24,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2022-11-02 20:06:24,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2022-11-02 20:06:24,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2022-11-02 20:06:24,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2022-11-02 20:06:24,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2022-11-02 20:06:24,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2022-11-02 20:06:24,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2022-11-02 20:06:24,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2022-11-02 20:06:24,546 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2022-11-02 20:06:24,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2022-11-02 20:06:24,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2022-11-02 20:06:24,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2022-11-02 20:06:24,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2022-11-02 20:06:24,547 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2022-11-02 20:06:24,548 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2022-11-02 20:06:24,548 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (43 of 83 remaining) [2022-11-02 20:06:24,548 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (42 of 83 remaining) [2022-11-02 20:06:24,548 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (41 of 83 remaining) [2022-11-02 20:06:24,548 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (40 of 83 remaining) [2022-11-02 20:06:24,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2022-11-02 20:06:24,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2022-11-02 20:06:24,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2022-11-02 20:06:24,549 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2022-11-02 20:06:24,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2022-11-02 20:06:24,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2022-11-02 20:06:24,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2022-11-02 20:06:24,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2022-11-02 20:06:24,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2022-11-02 20:06:24,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2022-11-02 20:06:24,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2022-11-02 20:06:24,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2022-11-02 20:06:24,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2022-11-02 20:06:24,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2022-11-02 20:06:24,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2022-11-02 20:06:24,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2022-11-02 20:06:24,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2022-11-02 20:06:24,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2022-11-02 20:06:24,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2022-11-02 20:06:24,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2022-11-02 20:06:24,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2022-11-02 20:06:24,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2022-11-02 20:06:24,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2022-11-02 20:06:24,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2022-11-02 20:06:24,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2022-11-02 20:06:24,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2022-11-02 20:06:24,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2022-11-02 20:06:24,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2022-11-02 20:06:24,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2022-11-02 20:06:24,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2022-11-02 20:06:24,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2022-11-02 20:06:24,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2022-11-02 20:06:24,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2022-11-02 20:06:24,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2022-11-02 20:06:24,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2022-11-02 20:06:24,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2022-11-02 20:06:24,556 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2022-11-02 20:06:24,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2022-11-02 20:06:24,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2022-11-02 20:06:24,557 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2022-11-02 20:06:24,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:06:24,558 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:06:24,565 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:06:24,566 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:06:24,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:06:24 BasicIcfg [2022-11-02 20:06:24,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:06:24,573 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:06:24,573 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:06:24,573 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:06:24,574 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:05:55" (3/4) ... [2022-11-02 20:06:24,577 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:06:24,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:06:24,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:06:24,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:06:24,592 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-02 20:06:24,592 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:06:24,593 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:06:24,593 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:06:24,643 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:06:24,643 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:06:24,644 INFO L158 Benchmark]: Toolchain (without parser) took 30645.75ms. Allocated memory was 92.3MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 65.4MB in the beginning and 714.3MB in the end (delta: -648.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-02 20:06:24,644 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 92.3MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:06:24,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.40ms. Allocated memory is still 92.3MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 78.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:06:24,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.25ms. Allocated memory is still 92.3MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:06:24,646 INFO L158 Benchmark]: Boogie Preprocessor took 53.58ms. Allocated memory is still 92.3MB. Free memory was 62.6MB in the beginning and 60.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:06:24,646 INFO L158 Benchmark]: RCFGBuilder took 1093.58ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 60.3MB in the beginning and 99.6MB in the end (delta: -39.3MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2022-11-02 20:06:24,647 INFO L158 Benchmark]: TraceAbstraction took 28954.69ms. Allocated memory was 125.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 98.9MB in the beginning and 717.5MB in the end (delta: -618.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-02 20:06:24,647 INFO L158 Benchmark]: Witness Printer took 70.52ms. Allocated memory is still 1.9GB. Free memory was 717.5MB in the beginning and 714.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:06:24,649 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.34ms. Allocated memory is still 92.3MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.40ms. Allocated memory is still 92.3MB. Free memory was 65.4MB in the beginning and 65.4MB in the end (delta: 78.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.25ms. Allocated memory is still 92.3MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.58ms. Allocated memory is still 92.3MB. Free memory was 62.6MB in the beginning and 60.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1093.58ms. Allocated memory was 92.3MB in the beginning and 125.8MB in the end (delta: 33.6MB). Free memory was 60.3MB in the beginning and 99.6MB in the end (delta: -39.3MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28954.69ms. Allocated memory was 125.8MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 98.9MB in the beginning and 717.5MB in the end (delta: -618.5MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 70.52ms. Allocated memory is still 1.9GB. Free memory was 717.5MB in the beginning and 714.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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, 690 locations, 83 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: 28.6s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 612 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 256 mSDtfsCounter, 612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=939occurred in iteration=18, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2201 NumberOfCodeBlocks, 2201 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2177 ConstructedInterpolants, 0 QuantifiedInterpolants, 2459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:06:24,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57606923-181d-4477-8640-b63a735d2515/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