./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.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_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/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_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/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_4c02873c-6c18-43bb-85dd-dc0a00a11f93/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 5fedede1a0cf545b0a275694256164e3eb4f49b22c80042adac647157728b27d --- 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:30:54,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:30:54,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:30:54,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:30:54,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:30:54,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:30:54,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:30:54,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:30:54,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:30:54,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:30:54,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:30:54,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:30:54,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:30:54,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:30:54,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:30:54,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:30:54,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:30:54,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:30:54,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:30:54,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:30:54,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:30:54,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:30:54,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:30:54,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:30:54,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:30:54,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:30:54,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:30:54,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:30:54,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:30:54,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:30:54,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:30:54,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:30:54,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:30:54,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:30:54,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:30:54,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:30:54,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:30:54,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:30:54,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:30:54,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:30:54,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:30:54,587 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:30:54,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:30:54,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:30:54,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:30:54,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:30:54,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:30:54,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:30:54,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:30:54,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:30:54,612 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:30:54,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:30:54,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:30:54,613 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:30:54,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:30:54,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:30:54,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:30:54,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:30:54,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:30:54,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:30:54,615 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:30:54,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:30:54,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:30:54,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:30:54,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:30:54,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:30:54,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:30:54,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:30:54,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:54,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:30:54,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:30:54,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:30:54,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:30:54,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:30:54,617 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:30:54,618 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:30:54,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:30:54,618 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_4c02873c-6c18-43bb-85dd-dc0a00a11f93/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_4c02873c-6c18-43bb-85dd-dc0a00a11f93/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 -> 5fedede1a0cf545b0a275694256164e3eb4f49b22c80042adac647157728b27d [2022-11-02 20:30:54,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:30:54,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:30:54,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:30:54,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:30:54,968 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:30:54,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2022-11-02 20:30:55,057 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/data/a7e0812ea/24b7ad9b81b646139efc33c3e4ef87b0/FLAG1fd29db91 [2022-11-02 20:30:55,510 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:30:55,511 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c [2022-11-02 20:30:55,523 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/data/a7e0812ea/24b7ad9b81b646139efc33c3e4ef87b0/FLAG1fd29db91 [2022-11-02 20:30:55,885 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/data/a7e0812ea/24b7ad9b81b646139efc33c3e4ef87b0 [2022-11-02 20:30:55,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:30:55,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:30:55,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:55,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:30:55,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:30:55,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:55" (1/1) ... [2022-11-02 20:30:55,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a6e43fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:55, skipping insertion in model container [2022-11-02 20:30:55,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:55" (1/1) ... [2022-11-02 20:30:55,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:30:55,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:30:56,161 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_4c02873c-6c18-43bb-85dd-dc0a00a11f93/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c[4085,4098] [2022-11-02 20:30:56,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:56,175 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:30:56,247 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_4c02873c-6c18-43bb-85dd-dc0a00a11f93/sv-benchmarks/c/weaver/popl20-bad-ring-nondet.wvr.c[4085,4098] [2022-11-02 20:30:56,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:56,277 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:30:56,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56 WrapperNode [2022-11-02 20:30:56,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:56,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:56,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:30:56,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:30:56,286 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:30:56" (1/1) ... [2022-11-02 20:30:56,310 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:30:56" (1/1) ... [2022-11-02 20:30:56,362 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 628 [2022-11-02 20:30:56,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:56,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:30:56,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:30:56,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:30:56,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,462 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:30:56,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:30:56,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:30:56,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:30:56,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (1/1) ... [2022-11-02 20:30:56,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:56,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:56,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:30:56,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:30:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:30:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:30:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:30:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:30:56,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:30:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:30:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:30:56,597 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:30:56,597 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:30:56,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:30:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:30:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:30:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:30:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:30:56,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:30:56,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:30:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:30:56,601 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:30:56,733 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:30:56,735 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:30:57,891 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:30:58,447 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:30:58,447 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:30:58,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:58 BoogieIcfgContainer [2022-11-02 20:30:58,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:30:58,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:30:58,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:30:58,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:30:58,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:30:55" (1/3) ... [2022-11-02 20:30:58,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c99e21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:58, skipping insertion in model container [2022-11-02 20:30:58,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:56" (2/3) ... [2022-11-02 20:30:58,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c99e21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:58, skipping insertion in model container [2022-11-02 20:30:58,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:58" (3/3) ... [2022-11-02 20:30:58,459 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2022-11-02 20:30:58,468 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:30:58,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:30:58,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 93 error locations. [2022-11-02 20:30:58,479 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:30:58,684 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:30:58,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 485 places, 501 transitions, 1026 flow [2022-11-02 20:30:58,979 INFO L130 PetriNetUnfolder]: 26/498 cut-off events. [2022-11-02 20:30:58,979 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:30:58,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 498 events. 26/498 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 781 event pairs, 0 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 420. Up to 4 conditions per place. [2022-11-02 20:30:58,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 485 places, 501 transitions, 1026 flow [2022-11-02 20:30:59,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 463 places, 478 transitions, 974 flow [2022-11-02 20:30:59,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:30:59,029 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;@4678aaa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:30:59,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 162 error locations. [2022-11-02 20:30:59,039 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-11-02 20:30:59,039 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:30:59,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:59,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:59,041 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:30:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash -937126247, now seen corresponding path program 1 times [2022-11-02 20:30:59,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:59,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969419656] [2022-11-02 20:30:59,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:59,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:59,247 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:30:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:59,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969419656] [2022-11-02 20:30:59,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969419656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:59,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:59,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:59,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14453618] [2022-11-02 20:30:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:59,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:59,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:59,291 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 501 [2022-11-02 20:30:59,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 478 transitions, 974 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:59,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:59,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 501 [2022-11-02 20:30:59,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:59,981 INFO L130 PetriNetUnfolder]: 222/1168 cut-off events. [2022-11-02 20:30:59,982 INFO L131 PetriNetUnfolder]: For 65/84 co-relation queries the response was YES. [2022-11-02 20:30:59,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 1168 events. 222/1168 cut-off events. For 65/84 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5850 event pairs, 119 based on Foata normal form. 107/1063 useless extension candidates. Maximal degree in co-relation 1105. Up to 315 conditions per place. [2022-11-02 20:30:59,994 INFO L137 encePairwiseOnDemand]: 424/501 looper letters, 23 selfloop transitions, 2 changer transitions 7/403 dead transitions. [2022-11-02 20:30:59,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 403 transitions, 874 flow [2022-11-02 20:30:59,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1297 transitions. [2022-11-02 20:31:00,018 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8629407850964738 [2022-11-02 20:31:00,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1297 transitions. [2022-11-02 20:31:00,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1297 transitions. [2022-11-02 20:31:00,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:00,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1297 transitions. [2022-11-02 20:31:00,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,049 INFO L175 Difference]: Start difference. First operand has 463 places, 478 transitions, 974 flow. Second operand 3 states and 1297 transitions. [2022-11-02 20:31:00,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 403 transitions, 874 flow [2022-11-02 20:31:00,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 403 transitions, 862 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:31:00,074 INFO L231 Difference]: Finished difference. Result has 400 places, 396 transitions, 802 flow [2022-11-02 20:31:00,077 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=400, PETRI_TRANSITIONS=396} [2022-11-02 20:31:00,081 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -63 predicate places. [2022-11-02 20:31:00,081 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 396 transitions, 802 flow [2022-11-02 20:31:00,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:00,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:00,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:31:00,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1526265235, now seen corresponding path program 1 times [2022-11-02 20:31:00,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:00,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101475851] [2022-11-02 20:31:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:00,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:00,208 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:31:00,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:00,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101475851] [2022-11-02 20:31:00,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101475851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:00,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:00,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471079550] [2022-11-02 20:31:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:00,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:00,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:00,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:00,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:00,214 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 501 [2022-11-02 20:31:00,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 396 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:00,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 501 [2022-11-02 20:31:00,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:00,712 INFO L130 PetriNetUnfolder]: 235/1094 cut-off events. [2022-11-02 20:31:00,712 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:00,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 1094 events. 235/1094 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5667 event pairs, 127 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1414. Up to 328 conditions per place. [2022-11-02 20:31:00,723 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 23 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2022-11-02 20:31:00,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 395 transitions, 850 flow [2022-11-02 20:31:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1223 transitions. [2022-11-02 20:31:00,726 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8137059214903526 [2022-11-02 20:31:00,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1223 transitions. [2022-11-02 20:31:00,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1223 transitions. [2022-11-02 20:31:00,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:00,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1223 transitions. [2022-11-02 20:31:00,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,735 INFO L175 Difference]: Start difference. First operand has 400 places, 396 transitions, 802 flow. Second operand 3 states and 1223 transitions. [2022-11-02 20:31:00,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 395 transitions, 850 flow [2022-11-02 20:31:00,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 395 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:00,744 INFO L231 Difference]: Finished difference. Result has 392 places, 395 transitions, 800 flow [2022-11-02 20:31:00,744 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=392, PETRI_TRANSITIONS=395} [2022-11-02 20:31:00,745 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -71 predicate places. [2022-11-02 20:31:00,745 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 395 transitions, 800 flow [2022-11-02 20:31:00,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.3333333333333) internal successors, (1201), 3 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:00,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:00,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:31:00,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:00,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash -92856137, now seen corresponding path program 1 times [2022-11-02 20:31:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:00,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022117610] [2022-11-02 20:31:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:00,854 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:31:00,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:00,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022117610] [2022-11-02 20:31:00,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022117610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:00,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:00,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148935225] [2022-11-02 20:31:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:00,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:00,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:00,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:00,859 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:00,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:00,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:00,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:00,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:01,228 INFO L130 PetriNetUnfolder]: 152/826 cut-off events. [2022-11-02 20:31:01,228 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:01,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 826 events. 152/826 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3315 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1007. Up to 208 conditions per place. [2022-11-02 20:31:01,235 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 20 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2022-11-02 20:31:01,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 394 transitions, 842 flow [2022-11-02 20:31:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2022-11-02 20:31:01,239 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176979374584165 [2022-11-02 20:31:01,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1229 transitions. [2022-11-02 20:31:01,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1229 transitions. [2022-11-02 20:31:01,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:01,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1229 transitions. [2022-11-02 20:31:01,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,248 INFO L175 Difference]: Start difference. First operand has 392 places, 395 transitions, 800 flow. Second operand 3 states and 1229 transitions. [2022-11-02 20:31:01,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 394 transitions, 842 flow [2022-11-02 20:31:01,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 394 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:01,256 INFO L231 Difference]: Finished difference. Result has 391 places, 394 transitions, 798 flow [2022-11-02 20:31:01,257 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=391, PETRI_TRANSITIONS=394} [2022-11-02 20:31:01,258 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -72 predicate places. [2022-11-02 20:31:01,258 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 394 transitions, 798 flow [2022-11-02 20:31:01,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:01,260 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:31:01,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:31:01,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:01,261 INFO L85 PathProgramCache]: Analyzing trace with hash 833465110, now seen corresponding path program 1 times [2022-11-02 20:31:01,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:01,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302774762] [2022-11-02 20:31:01,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:01,309 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:31:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:01,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302774762] [2022-11-02 20:31:01,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302774762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:01,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:01,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:01,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939920492] [2022-11-02 20:31:01,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:01,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:01,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:01,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:01,314 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:01,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:01,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:01,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:01,640 INFO L130 PetriNetUnfolder]: 152/825 cut-off events. [2022-11-02 20:31:01,640 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:01,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 825 events. 152/825 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3312 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 999. Up to 208 conditions per place. [2022-11-02 20:31:01,649 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 20 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2022-11-02 20:31:01,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 393 transitions, 840 flow [2022-11-02 20:31:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2022-11-02 20:31:01,654 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176979374584165 [2022-11-02 20:31:01,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1229 transitions. [2022-11-02 20:31:01,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1229 transitions. [2022-11-02 20:31:01,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:01,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1229 transitions. [2022-11-02 20:31:01,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,665 INFO L175 Difference]: Start difference. First operand has 391 places, 394 transitions, 798 flow. Second operand 3 states and 1229 transitions. [2022-11-02 20:31:01,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 393 transitions, 840 flow [2022-11-02 20:31:01,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 393 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:01,676 INFO L231 Difference]: Finished difference. Result has 390 places, 393 transitions, 796 flow [2022-11-02 20:31:01,677 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=390, PETRI_TRANSITIONS=393} [2022-11-02 20:31:01,677 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -73 predicate places. [2022-11-02 20:31:01,678 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 393 transitions, 796 flow [2022-11-02 20:31:01,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:01,679 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] [2022-11-02 20:31:01,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:31:01,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash 18964724, now seen corresponding path program 1 times [2022-11-02 20:31:01,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:01,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722933195] [2022-11-02 20:31:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:01,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:01,734 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:31:01,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:01,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722933195] [2022-11-02 20:31:01,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722933195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:01,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:01,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81417538] [2022-11-02 20:31:01,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:01,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:01,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:01,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:01,740 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:01,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:01,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:01,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:01,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:02,121 INFO L130 PetriNetUnfolder]: 212/1055 cut-off events. [2022-11-02 20:31:02,122 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:02,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1055 events. 212/1055 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5441 event pairs, 109 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 1309. Up to 287 conditions per place. [2022-11-02 20:31:02,131 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 19 selfloop transitions, 1 changer transitions 0/391 dead transitions. [2022-11-02 20:31:02,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 391 transitions, 832 flow [2022-11-02 20:31:02,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2022-11-02 20:31:02,135 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8170326014637392 [2022-11-02 20:31:02,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1228 transitions. [2022-11-02 20:31:02,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1228 transitions. [2022-11-02 20:31:02,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:02,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1228 transitions. [2022-11-02 20:31:02,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,143 INFO L175 Difference]: Start difference. First operand has 390 places, 393 transitions, 796 flow. Second operand 3 states and 1228 transitions. [2022-11-02 20:31:02,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 391 transitions, 832 flow [2022-11-02 20:31:02,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 391 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:02,156 INFO L231 Difference]: Finished difference. Result has 388 places, 391 transitions, 790 flow [2022-11-02 20:31:02,157 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=388, PETRI_TRANSITIONS=391} [2022-11-02 20:31:02,159 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -75 predicate places. [2022-11-02 20:31:02,160 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 391 transitions, 790 flow [2022-11-02 20:31:02,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:02,161 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] [2022-11-02 20:31:02,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:31:02,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:02,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 919831977, now seen corresponding path program 1 times [2022-11-02 20:31:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:02,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119079304] [2022-11-02 20:31:02,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:02,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:02,258 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:31:02,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:02,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119079304] [2022-11-02 20:31:02,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119079304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:02,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:02,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116042449] [2022-11-02 20:31:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:02,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:02,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:02,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:02,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:02,263 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:02,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 391 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:02,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:02,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:02,650 INFO L130 PetriNetUnfolder]: 220/1315 cut-off events. [2022-11-02 20:31:02,650 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:02,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 1315 events. 220/1315 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7133 event pairs, 110 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 1574. Up to 292 conditions per place. [2022-11-02 20:31:02,662 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 20 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2022-11-02 20:31:02,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 390 transitions, 832 flow [2022-11-02 20:31:02,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2022-11-02 20:31:02,666 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176979374584165 [2022-11-02 20:31:02,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1229 transitions. [2022-11-02 20:31:02,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1229 transitions. [2022-11-02 20:31:02,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:02,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1229 transitions. [2022-11-02 20:31:02,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,675 INFO L175 Difference]: Start difference. First operand has 388 places, 391 transitions, 790 flow. Second operand 3 states and 1229 transitions. [2022-11-02 20:31:02,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 390 transitions, 832 flow [2022-11-02 20:31:02,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 390 transitions, 831 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:31:02,684 INFO L231 Difference]: Finished difference. Result has 388 places, 390 transitions, 791 flow [2022-11-02 20:31:02,685 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=791, PETRI_PLACES=388, PETRI_TRANSITIONS=390} [2022-11-02 20:31:02,687 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -75 predicate places. [2022-11-02 20:31:02,687 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 390 transitions, 791 flow [2022-11-02 20:31:02,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:02,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:02,690 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:31:02,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:31:02,690 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:02,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:02,691 INFO L85 PathProgramCache]: Analyzing trace with hash -154468341, now seen corresponding path program 1 times [2022-11-02 20:31:02,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:02,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477255561] [2022-11-02 20:31:02,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:03,207 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:31:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:03,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477255561] [2022-11-02 20:31:03,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477255561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:03,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:03,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918459486] [2022-11-02 20:31:03,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:03,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:03,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:03,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:03,213 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 501 [2022-11-02 20:31:03,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 390 transitions, 791 flow. Second operand has 6 states, 6 states have (on average 337.8333333333333) internal successors, (2027), 6 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:03,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:03,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 501 [2022-11-02 20:31:03,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:05,355 INFO L130 PetriNetUnfolder]: 2091/5451 cut-off events. [2022-11-02 20:31:05,355 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:31:05,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8242 conditions, 5451 events. 2091/5451 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 42643 event pairs, 1328 based on Foata normal form. 0/4582 useless extension candidates. Maximal degree in co-relation 8180. Up to 2734 conditions per place. [2022-11-02 20:31:05,449 INFO L137 encePairwiseOnDemand]: 483/501 looper letters, 71 selfloop transitions, 15 changer transitions 0/387 dead transitions. [2022-11-02 20:31:05,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 387 transitions, 957 flow [2022-11-02 20:31:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:05,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2105 transitions. [2022-11-02 20:31:05,454 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7002661343978709 [2022-11-02 20:31:05,454 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2105 transitions. [2022-11-02 20:31:05,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2105 transitions. [2022-11-02 20:31:05,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:05,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2105 transitions. [2022-11-02 20:31:05,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 350.8333333333333) internal successors, (2105), 6 states have internal predecessors, (2105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,469 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,469 INFO L175 Difference]: Start difference. First operand has 388 places, 390 transitions, 791 flow. Second operand 6 states and 2105 transitions. [2022-11-02 20:31:05,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 387 transitions, 957 flow [2022-11-02 20:31:05,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 387 transitions, 953 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:05,477 INFO L231 Difference]: Finished difference. Result has 388 places, 387 transitions, 811 flow [2022-11-02 20:31:05,478 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=811, PETRI_PLACES=388, PETRI_TRANSITIONS=387} [2022-11-02 20:31:05,479 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -75 predicate places. [2022-11-02 20:31:05,479 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 387 transitions, 811 flow [2022-11-02 20:31:05,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 337.8333333333333) internal successors, (2027), 6 states have internal predecessors, (2027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:05,481 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] [2022-11-02 20:31:05,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:31:05,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash -197985190, now seen corresponding path program 1 times [2022-11-02 20:31:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:05,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510426815] [2022-11-02 20:31:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:05,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:05,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510426815] [2022-11-02 20:31:05,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510426815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:05,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:05,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:05,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228350984] [2022-11-02 20:31:05,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:05,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:05,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:05,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:05,530 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:05,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 387 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:05,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:05,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:05,752 INFO L130 PetriNetUnfolder]: 152/817 cut-off events. [2022-11-02 20:31:05,753 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:05,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 817 events. 152/817 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3271 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 1009. Up to 203 conditions per place. [2022-11-02 20:31:05,760 INFO L137 encePairwiseOnDemand]: 499/501 looper letters, 17 selfloop transitions, 1 changer transitions 0/386 dead transitions. [2022-11-02 20:31:05,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 386 transitions, 845 flow [2022-11-02 20:31:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2022-11-02 20:31:05,764 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8210246174318031 [2022-11-02 20:31:05,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1234 transitions. [2022-11-02 20:31:05,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1234 transitions. [2022-11-02 20:31:05,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:05,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1234 transitions. [2022-11-02 20:31:05,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:31:05,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,772 INFO L175 Difference]: Start difference. First operand has 388 places, 387 transitions, 811 flow. Second operand 3 states and 1234 transitions. [2022-11-02 20:31:05,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 386 transitions, 845 flow [2022-11-02 20:31:05,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 386 transitions, 815 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:31:05,780 INFO L231 Difference]: Finished difference. Result has 384 places, 386 transitions, 781 flow [2022-11-02 20:31:05,781 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=384, PETRI_TRANSITIONS=386} [2022-11-02 20:31:05,781 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -79 predicate places. [2022-11-02 20:31:05,782 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 386 transitions, 781 flow [2022-11-02 20:31:05,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:05,783 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:31:05,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:31:05,783 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2027387833, now seen corresponding path program 1 times [2022-11-02 20:31:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:05,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273281740] [2022-11-02 20:31:05,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:05,833 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:31:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:05,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273281740] [2022-11-02 20:31:05,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273281740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:05,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:05,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:05,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117375191] [2022-11-02 20:31:05,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:05,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:05,837 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:05,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 386 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:05,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:05,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:05,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:06,137 INFO L130 PetriNetUnfolder]: 152/816 cut-off events. [2022-11-02 20:31:06,138 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:06,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 816 events. 152/816 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3234 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 980. Up to 205 conditions per place. [2022-11-02 20:31:06,145 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 17 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2022-11-02 20:31:06,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 385 transitions, 817 flow [2022-11-02 20:31:06,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2022-11-02 20:31:06,149 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8216899534264803 [2022-11-02 20:31:06,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2022-11-02 20:31:06,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2022-11-02 20:31:06,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:06,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2022-11-02 20:31:06,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,159 INFO L175 Difference]: Start difference. First operand has 384 places, 386 transitions, 781 flow. Second operand 3 states and 1235 transitions. [2022-11-02 20:31:06,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 385 transitions, 817 flow [2022-11-02 20:31:06,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 385 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:31:06,169 INFO L231 Difference]: Finished difference. Result has 384 places, 385 transitions, 782 flow [2022-11-02 20:31:06,170 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=384, PETRI_TRANSITIONS=385} [2022-11-02 20:31:06,171 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -79 predicate places. [2022-11-02 20:31:06,171 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 385 transitions, 782 flow [2022-11-02 20:31:06,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:06,172 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] [2022-11-02 20:31:06,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:31:06,173 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:06,174 INFO L85 PathProgramCache]: Analyzing trace with hash 137316523, now seen corresponding path program 1 times [2022-11-02 20:31:06,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:06,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625797970] [2022-11-02 20:31:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:06,233 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:31:06,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:06,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625797970] [2022-11-02 20:31:06,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625797970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:06,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:06,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:06,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822589386] [2022-11-02 20:31:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:06,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:06,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:06,239 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:06,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 385 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:06,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:06,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:06,525 INFO L130 PetriNetUnfolder]: 152/815 cut-off events. [2022-11-02 20:31:06,525 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:06,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 815 events. 152/815 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3251 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 979. Up to 203 conditions per place. [2022-11-02 20:31:06,534 INFO L137 encePairwiseOnDemand]: 499/501 looper letters, 17 selfloop transitions, 1 changer transitions 0/384 dead transitions. [2022-11-02 20:31:06,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 384 transitions, 816 flow [2022-11-02 20:31:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2022-11-02 20:31:06,538 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8210246174318031 [2022-11-02 20:31:06,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1234 transitions. [2022-11-02 20:31:06,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1234 transitions. [2022-11-02 20:31:06,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:06,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1234 transitions. [2022-11-02 20:31:06,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:31:06,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,547 INFO L175 Difference]: Start difference. First operand has 384 places, 385 transitions, 782 flow. Second operand 3 states and 1234 transitions. [2022-11-02 20:31:06,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 384 transitions, 816 flow [2022-11-02 20:31:06,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 384 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:06,556 INFO L231 Difference]: Finished difference. Result has 383 places, 384 transitions, 778 flow [2022-11-02 20:31:06,557 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=383, PETRI_TRANSITIONS=384} [2022-11-02 20:31:06,558 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -80 predicate places. [2022-11-02 20:31:06,558 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 384 transitions, 778 flow [2022-11-02 20:31:06,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:06,559 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] [2022-11-02 20:31:06,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:31:06,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1473717602, now seen corresponding path program 1 times [2022-11-02 20:31:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:06,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158605291] [2022-11-02 20:31:06,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:06,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:06,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158605291] [2022-11-02 20:31:06,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158605291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:06,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:06,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375825376] [2022-11-02 20:31:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:06,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:06,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:06,636 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:06,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 384 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:06,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:06,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:06,927 INFO L130 PetriNetUnfolder]: 152/814 cut-off events. [2022-11-02 20:31:06,927 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:06,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 814 events. 152/814 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3247 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 979. Up to 205 conditions per place. [2022-11-02 20:31:06,937 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 17 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2022-11-02 20:31:06,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 383 transitions, 814 flow [2022-11-02 20:31:06,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:06,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2022-11-02 20:31:06,948 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8216899534264803 [2022-11-02 20:31:06,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2022-11-02 20:31:06,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2022-11-02 20:31:06,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:06,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2022-11-02 20:31:06,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,960 INFO L175 Difference]: Start difference. First operand has 383 places, 384 transitions, 778 flow. Second operand 3 states and 1235 transitions. [2022-11-02 20:31:06,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 383 transitions, 814 flow [2022-11-02 20:31:06,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 383 transitions, 813 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:31:06,971 INFO L231 Difference]: Finished difference. Result has 383 places, 383 transitions, 779 flow [2022-11-02 20:31:06,971 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=383, PETRI_TRANSITIONS=383} [2022-11-02 20:31:06,972 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -80 predicate places. [2022-11-02 20:31:06,972 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 383 transitions, 779 flow [2022-11-02 20:31:06,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:06,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:06,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:06,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:31:06,974 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:06,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1875088679, now seen corresponding path program 1 times [2022-11-02 20:31:06,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:06,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289763655] [2022-11-02 20:31:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:06,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:07,056 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:31:07,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:07,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289763655] [2022-11-02 20:31:07,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289763655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:07,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:07,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061319649] [2022-11-02 20:31:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:07,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:07,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:07,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:07,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:07,061 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:07,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 383 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:07,064 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:07,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:07,328 INFO L130 PetriNetUnfolder]: 152/813 cut-off events. [2022-11-02 20:31:07,328 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:07,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 813 events. 152/813 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3239 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 983. Up to 208 conditions per place. [2022-11-02 20:31:07,335 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 20 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2022-11-02 20:31:07,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 382 transitions, 821 flow [2022-11-02 20:31:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:07,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2022-11-02 20:31:07,339 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176979374584165 [2022-11-02 20:31:07,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1229 transitions. [2022-11-02 20:31:07,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1229 transitions. [2022-11-02 20:31:07,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:07,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1229 transitions. [2022-11-02 20:31:07,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,348 INFO L175 Difference]: Start difference. First operand has 383 places, 383 transitions, 779 flow. Second operand 3 states and 1229 transitions. [2022-11-02 20:31:07,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 382 transitions, 821 flow [2022-11-02 20:31:07,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 382 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:07,355 INFO L231 Difference]: Finished difference. Result has 382 places, 382 transitions, 777 flow [2022-11-02 20:31:07,356 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=382, PETRI_TRANSITIONS=382} [2022-11-02 20:31:07,357 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -81 predicate places. [2022-11-02 20:31:07,357 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 382 transitions, 777 flow [2022-11-02 20:31:07,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:07,358 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] [2022-11-02 20:31:07,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:31:07,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash -134106418, now seen corresponding path program 1 times [2022-11-02 20:31:07,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:07,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050163158] [2022-11-02 20:31:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:07,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:07,419 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:31:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:07,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050163158] [2022-11-02 20:31:07,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050163158] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:07,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:07,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945467710] [2022-11-02 20:31:07,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:07,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:07,423 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:07,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 382 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:07,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:07,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:07,661 INFO L130 PetriNetUnfolder]: 152/812 cut-off events. [2022-11-02 20:31:07,661 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:07,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 812 events. 152/812 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3245 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 982. Up to 208 conditions per place. [2022-11-02 20:31:07,668 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 20 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2022-11-02 20:31:07,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 381 transitions, 819 flow [2022-11-02 20:31:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2022-11-02 20:31:07,672 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176979374584165 [2022-11-02 20:31:07,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1229 transitions. [2022-11-02 20:31:07,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1229 transitions. [2022-11-02 20:31:07,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:07,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1229 transitions. [2022-11-02 20:31:07,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,680 INFO L175 Difference]: Start difference. First operand has 382 places, 382 transitions, 777 flow. Second operand 3 states and 1229 transitions. [2022-11-02 20:31:07,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 381 transitions, 819 flow [2022-11-02 20:31:07,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 381 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:07,688 INFO L231 Difference]: Finished difference. Result has 381 places, 381 transitions, 775 flow [2022-11-02 20:31:07,689 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=381, PETRI_TRANSITIONS=381} [2022-11-02 20:31:07,690 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -82 predicate places. [2022-11-02 20:31:07,690 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 381 transitions, 775 flow [2022-11-02 20:31:07,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:07,691 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] [2022-11-02 20:31:07,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:31:07,692 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash -236139500, now seen corresponding path program 1 times [2022-11-02 20:31:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:07,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393231204] [2022-11-02 20:31:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:07,758 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:31:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:07,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393231204] [2022-11-02 20:31:07,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393231204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:07,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:07,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166101960] [2022-11-02 20:31:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:07,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:07,762 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:07,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 381 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:07,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:07,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:07,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:07,994 INFO L130 PetriNetUnfolder]: 152/811 cut-off events. [2022-11-02 20:31:07,994 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-11-02 20:31:07,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 811 events. 152/811 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3242 event pairs, 73 based on Foata normal form. 0/708 useless extension candidates. Maximal degree in co-relation 981. Up to 208 conditions per place. [2022-11-02 20:31:08,001 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 20 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2022-11-02 20:31:08,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 380 transitions, 817 flow [2022-11-02 20:31:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2022-11-02 20:31:08,006 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176979374584165 [2022-11-02 20:31:08,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1229 transitions. [2022-11-02 20:31:08,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1229 transitions. [2022-11-02 20:31:08,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:08,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1229 transitions. [2022-11-02 20:31:08,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,013 INFO L175 Difference]: Start difference. First operand has 381 places, 381 transitions, 775 flow. Second operand 3 states and 1229 transitions. [2022-11-02 20:31:08,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 380 transitions, 817 flow [2022-11-02 20:31:08,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 380 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:08,020 INFO L231 Difference]: Finished difference. Result has 380 places, 380 transitions, 773 flow [2022-11-02 20:31:08,021 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=380, PETRI_TRANSITIONS=380} [2022-11-02 20:31:08,022 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -83 predicate places. [2022-11-02 20:31:08,022 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 380 transitions, 773 flow [2022-11-02 20:31:08,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:08,023 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] [2022-11-02 20:31:08,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:31:08,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:08,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1529021287, now seen corresponding path program 1 times [2022-11-02 20:31:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:08,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454158083] [2022-11-02 20:31:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:08,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:08,101 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:31:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:08,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454158083] [2022-11-02 20:31:08,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454158083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:08,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:08,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269932074] [2022-11-02 20:31:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:08,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:08,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:08,105 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:08,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 380 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:08,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:08,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:08,419 INFO L130 PetriNetUnfolder]: 168/942 cut-off events. [2022-11-02 20:31:08,419 INFO L131 PetriNetUnfolder]: For 13/16 co-relation queries the response was YES. [2022-11-02 20:31:08,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1182 conditions, 942 events. 168/942 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4169 event pairs, 46 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 1120. Up to 166 conditions per place. [2022-11-02 20:31:08,428 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 25 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2022-11-02 20:31:08,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 388 transitions, 845 flow [2022-11-02 20:31:08,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2022-11-02 20:31:08,431 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8270126413838988 [2022-11-02 20:31:08,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1243 transitions. [2022-11-02 20:31:08,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1243 transitions. [2022-11-02 20:31:08,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:08,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1243 transitions. [2022-11-02 20:31:08,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,440 INFO L175 Difference]: Start difference. First operand has 380 places, 380 transitions, 773 flow. Second operand 3 states and 1243 transitions. [2022-11-02 20:31:08,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 388 transitions, 845 flow [2022-11-02 20:31:08,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 388 transitions, 841 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:08,453 INFO L231 Difference]: Finished difference. Result has 380 places, 380 transitions, 777 flow [2022-11-02 20:31:08,454 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=380, PETRI_TRANSITIONS=380} [2022-11-02 20:31:08,454 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -83 predicate places. [2022-11-02 20:31:08,455 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 380 transitions, 777 flow [2022-11-02 20:31:08,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:08,456 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] [2022-11-02 20:31:08,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:31:08,456 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:08,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1160402788, now seen corresponding path program 1 times [2022-11-02 20:31:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:08,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285309943] [2022-11-02 20:31:08,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:08,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:08,536 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:31:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:08,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285309943] [2022-11-02 20:31:08,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285309943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:08,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:08,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:08,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795793679] [2022-11-02 20:31:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:08,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:08,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:08,543 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 501 [2022-11-02 20:31:08,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 380 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:08,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:08,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 501 [2022-11-02 20:31:08,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:08,981 INFO L130 PetriNetUnfolder]: 373/1540 cut-off events. [2022-11-02 20:31:08,981 INFO L131 PetriNetUnfolder]: For 116/116 co-relation queries the response was YES. [2022-11-02 20:31:08,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2280 conditions, 1540 events. 373/1540 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9077 event pairs, 218 based on Foata normal form. 0/1300 useless extension candidates. Maximal degree in co-relation 2216. Up to 529 conditions per place. [2022-11-02 20:31:08,994 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 27 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-11-02 20:31:08,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 379 transitions, 833 flow [2022-11-02 20:31:08,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:08,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2022-11-02 20:31:08,999 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8097139055222887 [2022-11-02 20:31:08,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1217 transitions. [2022-11-02 20:31:08,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1217 transitions. [2022-11-02 20:31:09,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:09,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1217 transitions. [2022-11-02 20:31:09,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,008 INFO L175 Difference]: Start difference. First operand has 380 places, 380 transitions, 777 flow. Second operand 3 states and 1217 transitions. [2022-11-02 20:31:09,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 379 transitions, 833 flow [2022-11-02 20:31:09,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 379 transitions, 831 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:31:09,016 INFO L231 Difference]: Finished difference. Result has 380 places, 379 transitions, 777 flow [2022-11-02 20:31:09,016 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=380, PETRI_TRANSITIONS=379} [2022-11-02 20:31:09,017 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -83 predicate places. [2022-11-02 20:31:09,017 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 379 transitions, 777 flow [2022-11-02 20:31:09,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:09,018 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] [2022-11-02 20:31:09,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:31:09,019 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:09,019 INFO L85 PathProgramCache]: Analyzing trace with hash -630622702, now seen corresponding path program 1 times [2022-11-02 20:31:09,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:09,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875523545] [2022-11-02 20:31:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:09,095 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:31:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:09,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875523545] [2022-11-02 20:31:09,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875523545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:09,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:09,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201615594] [2022-11-02 20:31:09,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:09,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:09,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:09,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:09,100 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:09,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:09,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:09,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:09,369 INFO L130 PetriNetUnfolder]: 158/972 cut-off events. [2022-11-02 20:31:09,369 INFO L131 PetriNetUnfolder]: For 51/52 co-relation queries the response was YES. [2022-11-02 20:31:09,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 972 events. 158/972 cut-off events. For 51/52 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4276 event pairs, 37 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1187. Up to 126 conditions per place. [2022-11-02 20:31:09,378 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 27 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2022-11-02 20:31:09,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 388 transitions, 859 flow [2022-11-02 20:31:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2022-11-02 20:31:09,382 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8270126413838988 [2022-11-02 20:31:09,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1243 transitions. [2022-11-02 20:31:09,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1243 transitions. [2022-11-02 20:31:09,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:09,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1243 transitions. [2022-11-02 20:31:09,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 414.3333333333333) internal successors, (1243), 3 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,391 INFO L175 Difference]: Start difference. First operand has 380 places, 379 transitions, 777 flow. Second operand 3 states and 1243 transitions. [2022-11-02 20:31:09,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 388 transitions, 859 flow [2022-11-02 20:31:09,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 388 transitions, 855 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:09,400 INFO L231 Difference]: Finished difference. Result has 380 places, 379 transitions, 781 flow [2022-11-02 20:31:09,401 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=380, PETRI_TRANSITIONS=379} [2022-11-02 20:31:09,401 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -83 predicate places. [2022-11-02 20:31:09,402 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 379 transitions, 781 flow [2022-11-02 20:31:09,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:09,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:09,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:31:09,403 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash 17704102, now seen corresponding path program 1 times [2022-11-02 20:31:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:09,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727202844] [2022-11-02 20:31:09,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:09,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:09,472 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:31:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:09,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727202844] [2022-11-02 20:31:09,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727202844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:09,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:09,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:09,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101742569] [2022-11-02 20:31:09,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:09,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:09,476 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:09,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:09,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:09,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:09,720 INFO L130 PetriNetUnfolder]: 152/825 cut-off events. [2022-11-02 20:31:09,720 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-02 20:31:09,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 825 events. 152/825 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3406 event pairs, 73 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1087. Up to 214 conditions per place. [2022-11-02 20:31:09,728 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 19 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2022-11-02 20:31:09,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 378 transitions, 821 flow [2022-11-02 20:31:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:09,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2022-11-02 20:31:09,732 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8216899534264803 [2022-11-02 20:31:09,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2022-11-02 20:31:09,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2022-11-02 20:31:09,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:09,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2022-11-02 20:31:09,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,740 INFO L175 Difference]: Start difference. First operand has 380 places, 379 transitions, 781 flow. Second operand 3 states and 1235 transitions. [2022-11-02 20:31:09,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 378 transitions, 821 flow [2022-11-02 20:31:09,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 378 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:31:09,749 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 781 flow [2022-11-02 20:31:09,750 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=380, PETRI_TRANSITIONS=378} [2022-11-02 20:31:09,750 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -83 predicate places. [2022-11-02 20:31:09,750 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 781 flow [2022-11-02 20:31:09,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:09,751 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:31:09,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:31:09,752 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -856432899, now seen corresponding path program 1 times [2022-11-02 20:31:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834033231] [2022-11-02 20:31:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:09,816 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:31:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:09,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834033231] [2022-11-02 20:31:09,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834033231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:09,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:09,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488058192] [2022-11-02 20:31:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:09,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:09,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:09,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:09,821 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:09,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 378 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:09,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:09,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:09,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:10,206 INFO L130 PetriNetUnfolder]: 236/1384 cut-off events. [2022-11-02 20:31:10,206 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-11-02 20:31:10,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 1384 events. 236/1384 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7763 event pairs, 73 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 1792. Up to 212 conditions per place. [2022-11-02 20:31:10,219 INFO L137 encePairwiseOnDemand]: 497/501 looper letters, 30 selfloop transitions, 3 changer transitions 0/390 dead transitions. [2022-11-02 20:31:10,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 390 transitions, 884 flow [2022-11-02 20:31:10,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2022-11-02 20:31:10,223 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8283433133732535 [2022-11-02 20:31:10,223 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1245 transitions. [2022-11-02 20:31:10,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1245 transitions. [2022-11-02 20:31:10,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:10,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1245 transitions. [2022-11-02 20:31:10,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:31:10,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,230 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 781 flow. Second operand 3 states and 1245 transitions. [2022-11-02 20:31:10,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 390 transitions, 884 flow [2022-11-02 20:31:10,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 390 transitions, 880 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:10,238 INFO L231 Difference]: Finished difference. Result has 380 places, 378 transitions, 788 flow [2022-11-02 20:31:10,239 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=380, PETRI_TRANSITIONS=378} [2022-11-02 20:31:10,239 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -83 predicate places. [2022-11-02 20:31:10,240 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 378 transitions, 788 flow [2022-11-02 20:31:10,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:10,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:31:10,241 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1685882573, now seen corresponding path program 1 times [2022-11-02 20:31:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:10,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325993229] [2022-11-02 20:31:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:10,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:10,303 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:31:10,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:10,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325993229] [2022-11-02 20:31:10,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325993229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:10,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:10,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413820696] [2022-11-02 20:31:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:10,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:10,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:10,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:10,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:10,307 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:10,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 378 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:10,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:10,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:10,658 INFO L130 PetriNetUnfolder]: 224/1121 cut-off events. [2022-11-02 20:31:10,658 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2022-11-02 20:31:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1121 events. 224/1121 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5603 event pairs, 123 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1593. Up to 324 conditions per place. [2022-11-02 20:31:10,670 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 20 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2022-11-02 20:31:10,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 377 transitions, 830 flow [2022-11-02 20:31:10,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2022-11-02 20:31:10,674 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8216899534264803 [2022-11-02 20:31:10,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1235 transitions. [2022-11-02 20:31:10,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1235 transitions. [2022-11-02 20:31:10,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:10,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1235 transitions. [2022-11-02 20:31:10,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.6666666666667) internal successors, (1235), 3 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,681 INFO L175 Difference]: Start difference. First operand has 380 places, 378 transitions, 788 flow. Second operand 3 states and 1235 transitions. [2022-11-02 20:31:10,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 377 transitions, 830 flow [2022-11-02 20:31:10,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 377 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:31:10,691 INFO L231 Difference]: Finished difference. Result has 380 places, 377 transitions, 787 flow [2022-11-02 20:31:10,691 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=787, PETRI_PLACES=380, PETRI_TRANSITIONS=377} [2022-11-02 20:31:10,692 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -83 predicate places. [2022-11-02 20:31:10,692 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 377 transitions, 787 flow [2022-11-02 20:31:10,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:10,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:10,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:31:10,693 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:10,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1218225490, now seen corresponding path program 1 times [2022-11-02 20:31:10,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092925589] [2022-11-02 20:31:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:10,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:10,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092925589] [2022-11-02 20:31:10,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092925589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:10,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:10,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982233736] [2022-11-02 20:31:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:10,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:10,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:10,781 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 501 [2022-11-02 20:31:10,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 377 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:10,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:10,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 501 [2022-11-02 20:31:10,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:11,243 INFO L130 PetriNetUnfolder]: 323/1589 cut-off events. [2022-11-02 20:31:11,243 INFO L131 PetriNetUnfolder]: For 229/244 co-relation queries the response was YES. [2022-11-02 20:31:11,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2308 conditions, 1589 events. 323/1589 cut-off events. For 229/244 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 9086 event pairs, 187 based on Foata normal form. 0/1361 useless extension candidates. Maximal degree in co-relation 2241. Up to 462 conditions per place. [2022-11-02 20:31:11,256 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 22 selfloop transitions, 1 changer transitions 0/375 dead transitions. [2022-11-02 20:31:11,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 375 transitions, 829 flow [2022-11-02 20:31:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:11,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:11,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2022-11-02 20:31:11,264 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8170326014637392 [2022-11-02 20:31:11,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1228 transitions. [2022-11-02 20:31:11,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1228 transitions. [2022-11-02 20:31:11,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:11,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1228 transitions. [2022-11-02 20:31:11,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,273 INFO L175 Difference]: Start difference. First operand has 380 places, 377 transitions, 787 flow. Second operand 3 states and 1228 transitions. [2022-11-02 20:31:11,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 375 transitions, 829 flow [2022-11-02 20:31:11,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 375 transitions, 825 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:11,284 INFO L231 Difference]: Finished difference. Result has 378 places, 375 transitions, 781 flow [2022-11-02 20:31:11,285 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=378, PETRI_TRANSITIONS=375} [2022-11-02 20:31:11,285 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -85 predicate places. [2022-11-02 20:31:11,285 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 375 transitions, 781 flow [2022-11-02 20:31:11,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:11,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:11,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:31:11,289 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash -723039148, now seen corresponding path program 1 times [2022-11-02 20:31:11,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:11,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821109267] [2022-11-02 20:31:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:11,367 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:31:11,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:11,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821109267] [2022-11-02 20:31:11,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821109267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:11,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:11,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065894131] [2022-11-02 20:31:11,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:11,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:11,372 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 501 [2022-11-02 20:31:11,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 375 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:11,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 501 [2022-11-02 20:31:11,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:11,917 INFO L130 PetriNetUnfolder]: 327/1608 cut-off events. [2022-11-02 20:31:11,917 INFO L131 PetriNetUnfolder]: For 237/239 co-relation queries the response was YES. [2022-11-02 20:31:11,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2330 conditions, 1608 events. 327/1608 cut-off events. For 237/239 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9145 event pairs, 151 based on Foata normal form. 0/1369 useless extension candidates. Maximal degree in co-relation 2265. Up to 385 conditions per place. [2022-11-02 20:31:11,932 INFO L137 encePairwiseOnDemand]: 498/501 looper letters, 29 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2022-11-02 20:31:11,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 382 transitions, 867 flow [2022-11-02 20:31:11,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2022-11-02 20:31:11,935 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8223552894211577 [2022-11-02 20:31:11,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1236 transitions. [2022-11-02 20:31:11,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1236 transitions. [2022-11-02 20:31:11,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:11,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1236 transitions. [2022-11-02 20:31:11,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 412.0) internal successors, (1236), 3 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,942 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,943 INFO L175 Difference]: Start difference. First operand has 378 places, 375 transitions, 781 flow. Second operand 3 states and 1236 transitions. [2022-11-02 20:31:11,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 382 transitions, 867 flow [2022-11-02 20:31:11,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 382 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:31:11,950 INFO L231 Difference]: Finished difference. Result has 378 places, 374 transitions, 782 flow [2022-11-02 20:31:11,952 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=378, PETRI_TRANSITIONS=374} [2022-11-02 20:31:11,952 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -85 predicate places. [2022-11-02 20:31:11,953 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 374 transitions, 782 flow [2022-11-02 20:31:11,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:11,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:11,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:11,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:31:11,954 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:11,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1704499415, now seen corresponding path program 1 times [2022-11-02 20:31:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:11,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139244400] [2022-11-02 20:31:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:11,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:12,024 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:31:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:12,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139244400] [2022-11-02 20:31:12,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139244400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:12,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:12,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507973718] [2022-11-02 20:31:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:12,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:12,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:12,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:12,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:12,031 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 501 [2022-11-02 20:31:12,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 374 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:12,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 501 [2022-11-02 20:31:12,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:12,618 INFO L130 PetriNetUnfolder]: 584/2295 cut-off events. [2022-11-02 20:31:12,618 INFO L131 PetriNetUnfolder]: For 379/381 co-relation queries the response was YES. [2022-11-02 20:31:12,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 2295 events. 584/2295 cut-off events. For 379/381 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 14777 event pairs, 93 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 3474. Up to 648 conditions per place. [2022-11-02 20:31:12,637 INFO L137 encePairwiseOnDemand]: 494/501 looper letters, 33 selfloop transitions, 5 changer transitions 0/384 dead transitions. [2022-11-02 20:31:12,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 384 transitions, 891 flow [2022-11-02 20:31:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2022-11-02 20:31:12,641 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8203592814371258 [2022-11-02 20:31:12,641 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1233 transitions. [2022-11-02 20:31:12,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1233 transitions. [2022-11-02 20:31:12,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:12,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1233 transitions. [2022-11-02 20:31:12,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,648 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,648 INFO L175 Difference]: Start difference. First operand has 378 places, 374 transitions, 782 flow. Second operand 3 states and 1233 transitions. [2022-11-02 20:31:12,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 384 transitions, 891 flow [2022-11-02 20:31:12,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 384 transitions, 887 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:12,657 INFO L231 Difference]: Finished difference. Result has 377 places, 375 transitions, 812 flow [2022-11-02 20:31:12,657 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=377, PETRI_TRANSITIONS=375} [2022-11-02 20:31:12,658 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -86 predicate places. [2022-11-02 20:31:12,658 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 375 transitions, 812 flow [2022-11-02 20:31:12,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:12,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:12,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:12,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:31:12,659 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -81291629, now seen corresponding path program 1 times [2022-11-02 20:31:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:12,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031697092] [2022-11-02 20:31:12,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:13,357 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:31:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:13,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031697092] [2022-11-02 20:31:13,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031697092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:13,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:13,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:13,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296104317] [2022-11-02 20:31:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:13,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:13,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:13,361 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 501 [2022-11-02 20:31:13,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 375 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:13,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:13,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 501 [2022-11-02 20:31:13,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:16,068 INFO L130 PetriNetUnfolder]: 3539/6706 cut-off events. [2022-11-02 20:31:16,068 INFO L131 PetriNetUnfolder]: For 5124/5194 co-relation queries the response was YES. [2022-11-02 20:31:16,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15323 conditions, 6706 events. 3539/6706 cut-off events. For 5124/5194 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 44574 event pairs, 422 based on Foata normal form. 29/6201 useless extension candidates. Maximal degree in co-relation 15255. Up to 1946 conditions per place. [2022-11-02 20:31:16,142 INFO L137 encePairwiseOnDemand]: 496/501 looper letters, 138 selfloop transitions, 4 changer transitions 0/454 dead transitions. [2022-11-02 20:31:16,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 454 transitions, 1414 flow [2022-11-02 20:31:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2291 transitions. [2022-11-02 20:31:16,148 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.762142381902861 [2022-11-02 20:31:16,149 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2291 transitions. [2022-11-02 20:31:16,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2291 transitions. [2022-11-02 20:31:16,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:16,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2291 transitions. [2022-11-02 20:31:16,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 381.8333333333333) internal successors, (2291), 6 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,164 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,165 INFO L175 Difference]: Start difference. First operand has 377 places, 375 transitions, 812 flow. Second operand 6 states and 2291 transitions. [2022-11-02 20:31:16,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 454 transitions, 1414 flow [2022-11-02 20:31:16,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 454 transitions, 1372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:16,177 INFO L231 Difference]: Finished difference. Result has 379 places, 374 transitions, 808 flow [2022-11-02 20:31:16,178 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=379, PETRI_TRANSITIONS=374} [2022-11-02 20:31:16,178 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -84 predicate places. [2022-11-02 20:31:16,179 INFO L495 AbstractCegarLoop]: Abstraction has has 379 places, 374 transitions, 808 flow [2022-11-02 20:31:16,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:16,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:16,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:31:16,182 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:16,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:16,183 INFO L85 PathProgramCache]: Analyzing trace with hash 541948344, now seen corresponding path program 1 times [2022-11-02 20:31:16,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:16,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984041302] [2022-11-02 20:31:16,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:16,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:16,251 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:31:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:16,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984041302] [2022-11-02 20:31:16,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984041302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:16,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:16,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:16,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374982437] [2022-11-02 20:31:16,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:16,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:16,255 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:16,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 374 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 407.0) internal successors, (1221), 3 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:16,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:16,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:16,878 INFO L130 PetriNetUnfolder]: 407/2109 cut-off events. [2022-11-02 20:31:16,878 INFO L131 PetriNetUnfolder]: For 566/582 co-relation queries the response was YES. [2022-11-02 20:31:16,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3215 conditions, 2109 events. 407/2109 cut-off events. For 566/582 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 14063 event pairs, 150 based on Foata normal form. 3/1887 useless extension candidates. Maximal degree in co-relation 3149. Up to 524 conditions per place. [2022-11-02 20:31:16,894 INFO L137 encePairwiseOnDemand]: 497/501 looper letters, 30 selfloop transitions, 4 changer transitions 0/383 dead transitions. [2022-11-02 20:31:16,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 383 transitions, 912 flow [2022-11-02 20:31:16,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2022-11-02 20:31:16,898 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8263473053892215 [2022-11-02 20:31:16,898 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1242 transitions. [2022-11-02 20:31:16,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1242 transitions. [2022-11-02 20:31:16,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:16,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1242 transitions. [2022-11-02 20:31:16,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,906 INFO L175 Difference]: Start difference. First operand has 379 places, 374 transitions, 808 flow. Second operand 3 states and 1242 transitions. [2022-11-02 20:31:16,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 383 transitions, 912 flow [2022-11-02 20:31:16,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 383 transitions, 905 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:31:16,914 INFO L231 Difference]: Finished difference. Result has 377 places, 377 transitions, 837 flow [2022-11-02 20:31:16,914 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=837, PETRI_PLACES=377, PETRI_TRANSITIONS=377} [2022-11-02 20:31:16,915 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -86 predicate places. [2022-11-02 20:31:16,915 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 377 transitions, 837 flow [2022-11-02 20:31:16,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.0) internal successors, (1221), 3 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:16,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:16,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:16,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:31:16,916 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2046427102, now seen corresponding path program 1 times [2022-11-02 20:31:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:16,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787159853] [2022-11-02 20:31:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:16,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:17,601 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:31:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:17,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787159853] [2022-11-02 20:31:17,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787159853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:17,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:17,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050541946] [2022-11-02 20:31:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:17,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:17,607 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 362 out of 501 [2022-11-02 20:31:17,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 377 transitions, 837 flow. Second operand has 6 states, 6 states have (on average 364.1666666666667) internal successors, (2185), 6 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:17,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:17,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 362 of 501 [2022-11-02 20:31:17,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:21,097 INFO L130 PetriNetUnfolder]: 5018/11997 cut-off events. [2022-11-02 20:31:21,097 INFO L131 PetriNetUnfolder]: For 7244/7282 co-relation queries the response was YES. [2022-11-02 20:31:21,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24329 conditions, 11997 events. 5018/11997 cut-off events. For 7244/7282 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 104933 event pairs, 1417 based on Foata normal form. 18/11011 useless extension candidates. Maximal degree in co-relation 24261. Up to 3546 conditions per place. [2022-11-02 20:31:21,372 INFO L137 encePairwiseOnDemand]: 494/501 looper letters, 122 selfloop transitions, 6 changer transitions 0/437 dead transitions. [2022-11-02 20:31:21,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 437 transitions, 1285 flow [2022-11-02 20:31:21,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2284 transitions. [2022-11-02 20:31:21,377 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7598137059214903 [2022-11-02 20:31:21,377 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2284 transitions. [2022-11-02 20:31:21,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2284 transitions. [2022-11-02 20:31:21,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:21,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2284 transitions. [2022-11-02 20:31:21,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 380.6666666666667) internal successors, (2284), 6 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:21,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:21,388 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:21,388 INFO L175 Difference]: Start difference. First operand has 377 places, 377 transitions, 837 flow. Second operand 6 states and 2284 transitions. [2022-11-02 20:31:21,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 437 transitions, 1285 flow [2022-11-02 20:31:21,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 437 transitions, 1285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:31:21,399 INFO L231 Difference]: Finished difference. Result has 386 places, 381 transitions, 881 flow [2022-11-02 20:31:21,400 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=881, PETRI_PLACES=386, PETRI_TRANSITIONS=381} [2022-11-02 20:31:21,400 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -77 predicate places. [2022-11-02 20:31:21,401 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 381 transitions, 881 flow [2022-11-02 20:31:21,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 364.1666666666667) internal successors, (2185), 6 states have internal predecessors, (2185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:21,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:21,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:21,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:31:21,402 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:21,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash 778104383, now seen corresponding path program 1 times [2022-11-02 20:31:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:21,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100346001] [2022-11-02 20:31:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:22,160 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:31:22,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100346001] [2022-11-02 20:31:22,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100346001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:22,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:22,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332853280] [2022-11-02 20:31:22,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:22,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:22,165 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 501 [2022-11-02 20:31:22,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 381 transitions, 881 flow. Second operand has 6 states, 6 states have (on average 366.1666666666667) internal successors, (2197), 6 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:22,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:22,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 501 [2022-11-02 20:31:22,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:25,342 INFO L130 PetriNetUnfolder]: 3989/10679 cut-off events. [2022-11-02 20:31:25,343 INFO L131 PetriNetUnfolder]: For 7447/7486 co-relation queries the response was YES. [2022-11-02 20:31:25,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21758 conditions, 10679 events. 3989/10679 cut-off events. For 7447/7486 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 97907 event pairs, 1900 based on Foata normal form. 18/9783 useless extension candidates. Maximal degree in co-relation 21685. Up to 4560 conditions per place. [2022-11-02 20:31:25,439 INFO L137 encePairwiseOnDemand]: 496/501 looper letters, 92 selfloop transitions, 4 changer transitions 0/408 dead transitions. [2022-11-02 20:31:25,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 408 transitions, 1199 flow [2022-11-02 20:31:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2249 transitions. [2022-11-02 20:31:25,444 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7481703260146374 [2022-11-02 20:31:25,445 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2249 transitions. [2022-11-02 20:31:25,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2249 transitions. [2022-11-02 20:31:25,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:25,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2249 transitions. [2022-11-02 20:31:25,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 374.8333333333333) internal successors, (2249), 6 states have internal predecessors, (2249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:25,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:25,455 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:25,455 INFO L175 Difference]: Start difference. First operand has 386 places, 381 transitions, 881 flow. Second operand 6 states and 2249 transitions. [2022-11-02 20:31:25,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 408 transitions, 1199 flow [2022-11-02 20:31:25,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 408 transitions, 1199 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:31:25,473 INFO L231 Difference]: Finished difference. Result has 390 places, 380 transitions, 887 flow [2022-11-02 20:31:25,473 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=887, PETRI_PLACES=390, PETRI_TRANSITIONS=380} [2022-11-02 20:31:25,474 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -73 predicate places. [2022-11-02 20:31:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 380 transitions, 887 flow [2022-11-02 20:31:25,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.1666666666667) internal successors, (2197), 6 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:25,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:25,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:25,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:31:25,476 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1678661366, now seen corresponding path program 1 times [2022-11-02 20:31:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750577739] [2022-11-02 20:31:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:26,534 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:31:26,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:26,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750577739] [2022-11-02 20:31:26,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750577739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:26,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:26,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:26,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777436283] [2022-11-02 20:31:26,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:26,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:26,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:26,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:26,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:26,538 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 501 [2022-11-02 20:31:26,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 380 transitions, 887 flow. Second operand has 6 states, 6 states have (on average 367.5) internal successors, (2205), 6 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:26,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:26,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 501 [2022-11-02 20:31:26,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:29,684 INFO L130 PetriNetUnfolder]: 4062/10878 cut-off events. [2022-11-02 20:31:29,684 INFO L131 PetriNetUnfolder]: For 7701/7750 co-relation queries the response was YES. [2022-11-02 20:31:29,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22309 conditions, 10878 events. 4062/10878 cut-off events. For 7701/7750 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 100187 event pairs, 2138 based on Foata normal form. 19/9995 useless extension candidates. Maximal degree in co-relation 22235. Up to 5142 conditions per place. [2022-11-02 20:31:29,754 INFO L137 encePairwiseOnDemand]: 496/501 looper letters, 75 selfloop transitions, 4 changer transitions 0/391 dead transitions. [2022-11-02 20:31:29,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 391 transitions, 1083 flow [2022-11-02 20:31:29,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2240 transitions. [2022-11-02 20:31:29,761 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7451763140385895 [2022-11-02 20:31:29,762 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2240 transitions. [2022-11-02 20:31:29,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2240 transitions. [2022-11-02 20:31:29,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:29,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2240 transitions. [2022-11-02 20:31:29,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 373.3333333333333) internal successors, (2240), 6 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,773 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 501.0) internal successors, (3507), 7 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,774 INFO L175 Difference]: Start difference. First operand has 390 places, 380 transitions, 887 flow. Second operand 6 states and 2240 transitions. [2022-11-02 20:31:29,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 391 transitions, 1083 flow [2022-11-02 20:31:29,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 391 transitions, 1076 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:31:29,792 INFO L231 Difference]: Finished difference. Result has 390 places, 379 transitions, 886 flow [2022-11-02 20:31:29,792 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=886, PETRI_PLACES=390, PETRI_TRANSITIONS=379} [2022-11-02 20:31:29,793 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -73 predicate places. [2022-11-02 20:31:29,793 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 379 transitions, 886 flow [2022-11-02 20:31:29,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.5) internal successors, (2205), 6 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:29,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:29,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:31:29,795 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err24ASSERT_VIOLATIONDATA_RACE (and 158 more)] === [2022-11-02 20:31:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash -308731457, now seen corresponding path program 1 times [2022-11-02 20:31:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:29,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360376741] [2022-11-02 20:31:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:29,922 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:31:29,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:29,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360376741] [2022-11-02 20:31:29,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360376741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:29,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:29,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803744593] [2022-11-02 20:31:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:29,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:29,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:29,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:29,926 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 501 [2022-11-02 20:31:29,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 379 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:29,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:29,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 501 [2022-11-02 20:31:29,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:30,689 INFO L130 PetriNetUnfolder]: 476/2359 cut-off events. [2022-11-02 20:31:30,689 INFO L131 PetriNetUnfolder]: For 1221/1257 co-relation queries the response was YES. [2022-11-02 20:31:30,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 2359 events. 476/2359 cut-off events. For 1221/1257 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16310 event pairs, 196 based on Foata normal form. 6/2072 useless extension candidates. Maximal degree in co-relation 3947. Up to 636 conditions per place. [2022-11-02 20:31:30,705 INFO L137 encePairwiseOnDemand]: 499/501 looper letters, 0 selfloop transitions, 0 changer transitions 378/378 dead transitions. [2022-11-02 20:31:30,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 378 transitions, 938 flow [2022-11-02 20:31:30,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:30,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2022-11-02 20:31:30,711 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8203592814371258 [2022-11-02 20:31:30,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1233 transitions. [2022-11-02 20:31:30,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1233 transitions. [2022-11-02 20:31:30,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:30,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1233 transitions. [2022-11-02 20:31:30,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:30,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:30,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 501.0) internal successors, (2004), 4 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:30,716 INFO L175 Difference]: Start difference. First operand has 390 places, 379 transitions, 886 flow. Second operand 3 states and 1233 transitions. [2022-11-02 20:31:30,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 378 transitions, 938 flow [2022-11-02 20:31:30,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 378 transitions, 931 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:31:30,723 INFO L231 Difference]: Finished difference. Result has 387 places, 0 transitions, 0 flow [2022-11-02 20:31:30,723 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=501, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=387, PETRI_TRANSITIONS=0} [2022-11-02 20:31:30,726 INFO L287 CegarLoopForPetriNet]: 463 programPoint places, -76 predicate places. [2022-11-02 20:31:30,726 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 0 transitions, 0 flow [2022-11-02 20:31:30,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:31:30,729 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (161 of 162 remaining) [2022-11-02 20:31:30,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (160 of 162 remaining) [2022-11-02 20:31:30,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (159 of 162 remaining) [2022-11-02 20:31:30,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (158 of 162 remaining) [2022-11-02 20:31:30,730 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (157 of 162 remaining) [2022-11-02 20:31:30,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (156 of 162 remaining) [2022-11-02 20:31:30,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (155 of 162 remaining) [2022-11-02 20:31:30,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (154 of 162 remaining) [2022-11-02 20:31:30,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (153 of 162 remaining) [2022-11-02 20:31:30,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (152 of 162 remaining) [2022-11-02 20:31:30,731 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (151 of 162 remaining) [2022-11-02 20:31:30,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (150 of 162 remaining) [2022-11-02 20:31:30,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (149 of 162 remaining) [2022-11-02 20:31:30,732 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (148 of 162 remaining) [2022-11-02 20:31:30,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (147 of 162 remaining) [2022-11-02 20:31:30,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (146 of 162 remaining) [2022-11-02 20:31:30,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (145 of 162 remaining) [2022-11-02 20:31:30,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (144 of 162 remaining) [2022-11-02 20:31:30,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (143 of 162 remaining) [2022-11-02 20:31:30,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (142 of 162 remaining) [2022-11-02 20:31:30,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (141 of 162 remaining) [2022-11-02 20:31:30,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (140 of 162 remaining) [2022-11-02 20:31:30,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (139 of 162 remaining) [2022-11-02 20:31:30,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (138 of 162 remaining) [2022-11-02 20:31:30,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (137 of 162 remaining) [2022-11-02 20:31:30,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (136 of 162 remaining) [2022-11-02 20:31:30,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (135 of 162 remaining) [2022-11-02 20:31:30,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (134 of 162 remaining) [2022-11-02 20:31:30,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (133 of 162 remaining) [2022-11-02 20:31:30,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (132 of 162 remaining) [2022-11-02 20:31:30,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (131 of 162 remaining) [2022-11-02 20:31:30,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (130 of 162 remaining) [2022-11-02 20:31:30,735 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (129 of 162 remaining) [2022-11-02 20:31:30,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (128 of 162 remaining) [2022-11-02 20:31:30,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (127 of 162 remaining) [2022-11-02 20:31:30,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (126 of 162 remaining) [2022-11-02 20:31:30,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (125 of 162 remaining) [2022-11-02 20:31:30,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (124 of 162 remaining) [2022-11-02 20:31:30,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (123 of 162 remaining) [2022-11-02 20:31:30,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (122 of 162 remaining) [2022-11-02 20:31:30,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (121 of 162 remaining) [2022-11-02 20:31:30,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (120 of 162 remaining) [2022-11-02 20:31:30,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (119 of 162 remaining) [2022-11-02 20:31:30,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (118 of 162 remaining) [2022-11-02 20:31:30,737 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (117 of 162 remaining) [2022-11-02 20:31:30,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (116 of 162 remaining) [2022-11-02 20:31:30,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (115 of 162 remaining) [2022-11-02 20:31:30,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 162 remaining) [2022-11-02 20:31:30,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (113 of 162 remaining) [2022-11-02 20:31:30,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (112 of 162 remaining) [2022-11-02 20:31:30,738 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (111 of 162 remaining) [2022-11-02 20:31:30,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (110 of 162 remaining) [2022-11-02 20:31:30,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (109 of 162 remaining) [2022-11-02 20:31:30,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (108 of 162 remaining) [2022-11-02 20:31:30,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (107 of 162 remaining) [2022-11-02 20:31:30,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (106 of 162 remaining) [2022-11-02 20:31:30,739 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (105 of 162 remaining) [2022-11-02 20:31:30,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (104 of 162 remaining) [2022-11-02 20:31:30,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (103 of 162 remaining) [2022-11-02 20:31:30,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (102 of 162 remaining) [2022-11-02 20:31:30,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (101 of 162 remaining) [2022-11-02 20:31:30,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (100 of 162 remaining) [2022-11-02 20:31:30,740 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (99 of 162 remaining) [2022-11-02 20:31:30,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (98 of 162 remaining) [2022-11-02 20:31:30,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (97 of 162 remaining) [2022-11-02 20:31:30,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (96 of 162 remaining) [2022-11-02 20:31:30,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (95 of 162 remaining) [2022-11-02 20:31:30,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (94 of 162 remaining) [2022-11-02 20:31:30,741 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (93 of 162 remaining) [2022-11-02 20:31:30,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (92 of 162 remaining) [2022-11-02 20:31:30,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (91 of 162 remaining) [2022-11-02 20:31:30,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (90 of 162 remaining) [2022-11-02 20:31:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (89 of 162 remaining) [2022-11-02 20:31:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (88 of 162 remaining) [2022-11-02 20:31:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (87 of 162 remaining) [2022-11-02 20:31:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (86 of 162 remaining) [2022-11-02 20:31:30,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (85 of 162 remaining) [2022-11-02 20:31:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (84 of 162 remaining) [2022-11-02 20:31:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (83 of 162 remaining) [2022-11-02 20:31:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (82 of 162 remaining) [2022-11-02 20:31:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (81 of 162 remaining) [2022-11-02 20:31:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (80 of 162 remaining) [2022-11-02 20:31:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (79 of 162 remaining) [2022-11-02 20:31:30,744 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (78 of 162 remaining) [2022-11-02 20:31:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (77 of 162 remaining) [2022-11-02 20:31:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (76 of 162 remaining) [2022-11-02 20:31:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (75 of 162 remaining) [2022-11-02 20:31:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (74 of 162 remaining) [2022-11-02 20:31:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (73 of 162 remaining) [2022-11-02 20:31:30,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (72 of 162 remaining) [2022-11-02 20:31:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (71 of 162 remaining) [2022-11-02 20:31:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (70 of 162 remaining) [2022-11-02 20:31:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (69 of 162 remaining) [2022-11-02 20:31:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (68 of 162 remaining) [2022-11-02 20:31:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (67 of 162 remaining) [2022-11-02 20:31:30,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 162 remaining) [2022-11-02 20:31:30,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (65 of 162 remaining) [2022-11-02 20:31:30,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (64 of 162 remaining) [2022-11-02 20:31:30,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (63 of 162 remaining) [2022-11-02 20:31:30,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (62 of 162 remaining) [2022-11-02 20:31:30,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (61 of 162 remaining) [2022-11-02 20:31:30,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (60 of 162 remaining) [2022-11-02 20:31:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (59 of 162 remaining) [2022-11-02 20:31:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (58 of 162 remaining) [2022-11-02 20:31:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (57 of 162 remaining) [2022-11-02 20:31:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (56 of 162 remaining) [2022-11-02 20:31:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 162 remaining) [2022-11-02 20:31:30,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (54 of 162 remaining) [2022-11-02 20:31:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (53 of 162 remaining) [2022-11-02 20:31:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (52 of 162 remaining) [2022-11-02 20:31:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (51 of 162 remaining) [2022-11-02 20:31:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 162 remaining) [2022-11-02 20:31:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 162 remaining) [2022-11-02 20:31:30,749 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (48 of 162 remaining) [2022-11-02 20:31:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 162 remaining) [2022-11-02 20:31:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (46 of 162 remaining) [2022-11-02 20:31:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (45 of 162 remaining) [2022-11-02 20:31:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (44 of 162 remaining) [2022-11-02 20:31:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (43 of 162 remaining) [2022-11-02 20:31:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (42 of 162 remaining) [2022-11-02 20:31:30,750 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (41 of 162 remaining) [2022-11-02 20:31:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (40 of 162 remaining) [2022-11-02 20:31:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (39 of 162 remaining) [2022-11-02 20:31:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (38 of 162 remaining) [2022-11-02 20:31:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (37 of 162 remaining) [2022-11-02 20:31:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (36 of 162 remaining) [2022-11-02 20:31:30,751 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 162 remaining) [2022-11-02 20:31:30,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 162 remaining) [2022-11-02 20:31:30,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 162 remaining) [2022-11-02 20:31:30,752 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 162 remaining) [2022-11-02 20:31:30,753 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 162 remaining) [2022-11-02 20:31:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 162 remaining) [2022-11-02 20:31:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 162 remaining) [2022-11-02 20:31:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 162 remaining) [2022-11-02 20:31:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 162 remaining) [2022-11-02 20:31:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 162 remaining) [2022-11-02 20:31:30,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 162 remaining) [2022-11-02 20:31:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 162 remaining) [2022-11-02 20:31:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 162 remaining) [2022-11-02 20:31:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 162 remaining) [2022-11-02 20:31:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 162 remaining) [2022-11-02 20:31:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 162 remaining) [2022-11-02 20:31:30,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 162 remaining) [2022-11-02 20:31:30,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 162 remaining) [2022-11-02 20:31:30,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 162 remaining) [2022-11-02 20:31:30,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 162 remaining) [2022-11-02 20:31:30,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 162 remaining) [2022-11-02 20:31:30,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 162 remaining) [2022-11-02 20:31:30,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (13 of 162 remaining) [2022-11-02 20:31:30,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 162 remaining) [2022-11-02 20:31:30,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (11 of 162 remaining) [2022-11-02 20:31:30,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 162 remaining) [2022-11-02 20:31:30,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 162 remaining) [2022-11-02 20:31:30,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (8 of 162 remaining) [2022-11-02 20:31:30,757 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 162 remaining) [2022-11-02 20:31:30,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (6 of 162 remaining) [2022-11-02 20:31:30,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 162 remaining) [2022-11-02 20:31:30,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 162 remaining) [2022-11-02 20:31:30,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (3 of 162 remaining) [2022-11-02 20:31:30,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (2 of 162 remaining) [2022-11-02 20:31:30,758 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (1 of 162 remaining) [2022-11-02 20:31:30,759 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 162 remaining) [2022-11-02 20:31:30,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 20:31:30,759 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, 1, 1, 1, 1, 1] [2022-11-02 20:31:30,766 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:31:30,766 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:31:30,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:31:30 BasicIcfg [2022-11-02 20:31:30,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:31:30,773 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:31:30,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:31:30,774 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:31:30,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:58" (3/4) ... [2022-11-02 20:31:30,778 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:31:30,784 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:31:30,784 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:31:30,784 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:31:30,799 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2022-11-02 20:31:30,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:31:30,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:31:30,800 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:31:30,875 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:31:30,875 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:31:30,876 INFO L158 Benchmark]: Toolchain (without parser) took 34986.26ms. Allocated memory was 109.1MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 70.2MB in the beginning and 4.2GB in the end (delta: -4.2GB). Peak memory consumption was 778.4MB. Max. memory is 16.1GB. [2022-11-02 20:31:30,876 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:31:30,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.02ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 80.6MB in the end (delta: -10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:31:30,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.93ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 76.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:31:30,877 INFO L158 Benchmark]: Boogie Preprocessor took 106.75ms. Allocated memory is still 109.1MB. Free memory was 76.4MB in the beginning and 72.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:31:30,878 INFO L158 Benchmark]: RCFGBuilder took 1979.98ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 72.6MB in the beginning and 77.8MB in the end (delta: -5.3MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-11-02 20:31:30,878 INFO L158 Benchmark]: TraceAbstraction took 32320.75ms. Allocated memory was 140.5MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 76.7MB in the beginning and 4.2GB in the end (delta: -4.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-02 20:31:30,878 INFO L158 Benchmark]: Witness Printer took 101.47ms. Allocated memory is still 5.0GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:31:30,880 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.29ms. Allocated memory is still 109.1MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.02ms. Allocated memory is still 109.1MB. Free memory was 70.0MB in the beginning and 80.6MB in the end (delta: -10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.93ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 76.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.75ms. Allocated memory is still 109.1MB. Free memory was 76.4MB in the beginning and 72.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1979.98ms. Allocated memory was 109.1MB in the beginning and 140.5MB in the end (delta: 31.5MB). Free memory was 72.6MB in the beginning and 77.8MB in the end (delta: -5.3MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 32320.75ms. Allocated memory was 140.5MB in the beginning and 5.0GB in the end (delta: 4.9GB). Free memory was 76.7MB in the beginning and 4.2GB in the end (delta: -4.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 101.47ms. Allocated memory is still 5.0GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 142]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: 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, 613 locations, 162 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: 32.0s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 216 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 323 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1664 IncrementalHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 323 mSDtfsCounter, 1664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, InterpolantAutomatonStates: 102, 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.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 4681 NumberOfCodeBlocks, 4681 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4652 ConstructedInterpolants, 0 QuantifiedInterpolants, 5173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 93 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:31:30,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4c02873c-6c18-43bb-85dd-dc0a00a11f93/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