./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/qw2004-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/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_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/qw2004-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/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_80a5921d-67a9-40ca-9a65-0e0de3028829/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 a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b --- 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:50:06,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:50:06,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:50:06,753 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:50:06,754 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:50:06,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:50:06,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:50:06,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:50:06,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:50:06,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:50:06,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:50:06,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:50:06,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:50:06,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:50:06,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:50:06,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:50:06,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:50:06,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:50:06,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:50:06,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:50:06,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:50:06,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:50:06,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:50:06,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:50:06,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:50:06,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:50:06,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:50:06,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:50:06,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:50:06,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:50:06,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:50:06,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:50:06,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:50:06,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:50:06,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:50:06,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:50:06,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:50:06,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:50:06,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:50:06,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:50:06,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:50:06,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:50:06,823 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:50:06,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:50:06,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:50:06,829 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:50:06,830 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:50:06,830 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:50:06,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:50:06,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:50:06,831 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:50:06,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:50:06,833 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:50:06,833 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:50:06,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:50:06,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:50:06,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:50:06,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:50:06,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:50:06,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:50:06,835 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:50:06,835 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:50:06,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:50:06,836 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:50:06,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:50:06,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:50:06,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:50:06,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:50:06,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:06,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:50:06,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:50:06,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:50:06,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:50:06,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:50:06,840 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:50:06,841 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:50:06,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:50:06,842 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_80a5921d-67a9-40ca-9a65-0e0de3028829/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_80a5921d-67a9-40ca-9a65-0e0de3028829/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 -> a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b [2022-11-02 20:50:07,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:50:07,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:50:07,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:50:07,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:50:07,137 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:50:07,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-lit/qw2004-2.i [2022-11-02 20:50:07,205 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/data/52de2fb5b/518c9d007d744a8baad418b102d34245/FLAG6ef937c06 [2022-11-02 20:50:07,734 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:50:07,734 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/sv-benchmarks/c/pthread-lit/qw2004-2.i [2022-11-02 20:50:07,750 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/data/52de2fb5b/518c9d007d744a8baad418b102d34245/FLAG6ef937c06 [2022-11-02 20:50:08,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/data/52de2fb5b/518c9d007d744a8baad418b102d34245 [2022-11-02 20:50:08,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:50:08,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:50:08,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:08,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:50:08,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:50:08,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9911f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08, skipping insertion in model container [2022-11-02 20:50:08,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:50:08,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:50:08,641 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_80a5921d-67a9-40ca-9a65-0e0de3028829/sv-benchmarks/c/pthread-lit/qw2004-2.i[30003,30016] [2022-11-02 20:50:08,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:08,684 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:50:08,735 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_80a5921d-67a9-40ca-9a65-0e0de3028829/sv-benchmarks/c/pthread-lit/qw2004-2.i[30003,30016] [2022-11-02 20:50:08,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:50:08,800 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:50:08,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08 WrapperNode [2022-11-02 20:50:08,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:50:08,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:08,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:50:08,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:50:08,812 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:50:08" (1/1) ... [2022-11-02 20:50:08,845 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:50:08" (1/1) ... [2022-11-02 20:50:08,883 INFO L138 Inliner]: procedures = 175, calls = 32, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 172 [2022-11-02 20:50:08,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:50:08,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:50:08,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:50:08,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:50:08,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,932 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:50:08,940 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:50:08,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:50:08,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:50:08,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (1/1) ... [2022-11-02 20:50:08,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:50:08,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:08,974 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:50:08,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:50:09,025 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2022-11-02 20:50:09,025 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2022-11-02 20:50:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:50:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:50:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:50:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:50:09,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:50:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:50:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:50:09,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:50:09,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:50:09,029 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:50:09,187 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:50:09,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:50:09,531 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:50:09,690 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:50:09,691 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:50:09,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:09 BoogieIcfgContainer [2022-11-02 20:50:09,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:50:09,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:50:09,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:50:09,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:50:09,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:50:08" (1/3) ... [2022-11-02 20:50:09,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2992b989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:09, skipping insertion in model container [2022-11-02 20:50:09,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:50:08" (2/3) ... [2022-11-02 20:50:09,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2992b989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:50:09, skipping insertion in model container [2022-11-02 20:50:09,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:09" (3/3) ... [2022-11-02 20:50:09,717 INFO L112 eAbstractionObserver]: Analyzing ICFG qw2004-2.i [2022-11-02 20:50:09,727 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:50:09,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:50:09,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-11-02 20:50:09,740 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:50:09,852 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:50:09,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 159 transitions, 323 flow [2022-11-02 20:50:09,956 INFO L130 PetriNetUnfolder]: 6/158 cut-off events. [2022-11-02 20:50:09,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:09,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 158 events. 6/158 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 206 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-02 20:50:09,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 159 transitions, 323 flow [2022-11-02 20:50:09,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 158 transitions, 319 flow [2022-11-02 20:50:10,004 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:50:10,010 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;@5d259134, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:50:10,011 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-11-02 20:50:10,017 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-02 20:50:10,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:10,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:10,019 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] [2022-11-02 20:50:10,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:10,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:10,025 INFO L85 PathProgramCache]: Analyzing trace with hash 340496940, now seen corresponding path program 1 times [2022-11-02 20:50:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:10,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84045481] [2022-11-02 20:50:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:10,240 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:50:10,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84045481] [2022-11-02 20:50:10,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84045481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:10,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:10,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855676731] [2022-11-02 20:50:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:10,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:10,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:10,290 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 159 [2022-11-02 20:50:10,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 158 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:10,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 159 [2022-11-02 20:50:10,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:10,427 INFO L130 PetriNetUnfolder]: 30/378 cut-off events. [2022-11-02 20:50:10,427 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:50:10,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 378 events. 30/378 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1541 event pairs, 14 based on Foata normal form. 10/350 useless extension candidates. Maximal degree in co-relation 383. Up to 54 conditions per place. [2022-11-02 20:50:10,438 INFO L137 encePairwiseOnDemand]: 141/159 looper letters, 13 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2022-11-02 20:50:10,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 141 transitions, 315 flow [2022-11-02 20:50:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2022-11-02 20:50:10,462 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8637316561844863 [2022-11-02 20:50:10,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2022-11-02 20:50:10,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2022-11-02 20:50:10,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:10,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2022-11-02 20:50:10,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,488 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,490 INFO L175 Difference]: Start difference. First operand has 156 places, 158 transitions, 319 flow. Second operand 3 states and 412 transitions. [2022-11-02 20:50:10,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 141 transitions, 315 flow [2022-11-02 20:50:10,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 141 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:50:10,500 INFO L231 Difference]: Finished difference. Result has 142 places, 141 transitions, 288 flow [2022-11-02 20:50:10,502 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=142, PETRI_TRANSITIONS=141} [2022-11-02 20:50:10,506 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -14 predicate places. [2022-11-02 20:50:10,506 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 141 transitions, 288 flow [2022-11-02 20:50:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:10,507 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] [2022-11-02 20:50:10,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:50:10,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:10,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1742999048, now seen corresponding path program 1 times [2022-11-02 20:50:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:10,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016642342] [2022-11-02 20:50:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:10,594 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:50:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:10,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016642342] [2022-11-02 20:50:10,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016642342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:10,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:10,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:10,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446030363] [2022-11-02 20:50:10,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:10,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:10,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:10,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:10,599 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 159 [2022-11-02 20:50:10,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 141 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:10,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 159 [2022-11-02 20:50:10,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:10,699 INFO L130 PetriNetUnfolder]: 30/377 cut-off events. [2022-11-02 20:50:10,699 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:10,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 377 events. 30/377 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1522 event pairs, 14 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 411. Up to 54 conditions per place. [2022-11-02 20:50:10,706 INFO L137 encePairwiseOnDemand]: 156/159 looper letters, 13 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2022-11-02 20:50:10,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 316 flow [2022-11-02 20:50:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-11-02 20:50:10,709 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8322851153039832 [2022-11-02 20:50:10,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2022-11-02 20:50:10,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2022-11-02 20:50:10,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:10,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2022-11-02 20:50:10,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,713 INFO L175 Difference]: Start difference. First operand has 142 places, 141 transitions, 288 flow. Second operand 3 states and 397 transitions. [2022-11-02 20:50:10,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 316 flow [2022-11-02 20:50:10,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 140 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:10,717 INFO L231 Difference]: Finished difference. Result has 141 places, 140 transitions, 286 flow [2022-11-02 20:50:10,718 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=141, PETRI_TRANSITIONS=140} [2022-11-02 20:50:10,737 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -15 predicate places. [2022-11-02 20:50:10,738 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 140 transitions, 286 flow [2022-11-02 20:50:10,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:10,739 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] [2022-11-02 20:50:10,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:50:10,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:10,743 INFO L85 PathProgramCache]: Analyzing trace with hash -260477463, now seen corresponding path program 1 times [2022-11-02 20:50:10,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:10,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260807654] [2022-11-02 20:50:10,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:10,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:10,817 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:50:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:10,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260807654] [2022-11-02 20:50:10,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260807654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:10,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:10,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:10,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49305484] [2022-11-02 20:50:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:10,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:10,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:10,822 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 159 [2022-11-02 20:50:10,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 140 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:10,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 159 [2022-11-02 20:50:10,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:10,917 INFO L130 PetriNetUnfolder]: 30/376 cut-off events. [2022-11-02 20:50:10,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:10,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 376 events. 30/376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1536 event pairs, 14 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 405. Up to 54 conditions per place. [2022-11-02 20:50:10,921 INFO L137 encePairwiseOnDemand]: 156/159 looper letters, 13 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2022-11-02 20:50:10,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 139 transitions, 314 flow [2022-11-02 20:50:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:10,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-11-02 20:50:10,924 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8322851153039832 [2022-11-02 20:50:10,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2022-11-02 20:50:10,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2022-11-02 20:50:10,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:10,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2022-11-02 20:50:10,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,929 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,929 INFO L175 Difference]: Start difference. First operand has 141 places, 140 transitions, 286 flow. Second operand 3 states and 397 transitions. [2022-11-02 20:50:10,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 139 transitions, 314 flow [2022-11-02 20:50:10,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 139 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:10,934 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 284 flow [2022-11-02 20:50:10,934 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2022-11-02 20:50:10,935 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -16 predicate places. [2022-11-02 20:50:10,936 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 284 flow [2022-11-02 20:50:10,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:10,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:10,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:10,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:50:10,937 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:10,938 INFO L85 PathProgramCache]: Analyzing trace with hash 459629893, now seen corresponding path program 1 times [2022-11-02 20:50:10,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:10,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490352065] [2022-11-02 20:50:10,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:10,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:11,003 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:50:11,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:11,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490352065] [2022-11-02 20:50:11,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490352065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:11,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:11,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522109737] [2022-11-02 20:50:11,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:11,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:11,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:11,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:11,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:11,008 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 159 [2022-11-02 20:50:11,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:11,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 159 [2022-11-02 20:50:11,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:11,121 INFO L130 PetriNetUnfolder]: 77/530 cut-off events. [2022-11-02 20:50:11,121 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:11,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 530 events. 77/530 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2558 event pairs, 47 based on Foata normal form. 0/469 useless extension candidates. Maximal degree in co-relation 641. Up to 141 conditions per place. [2022-11-02 20:50:11,125 INFO L137 encePairwiseOnDemand]: 156/159 looper letters, 19 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2022-11-02 20:50:11,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 138 transitions, 324 flow [2022-11-02 20:50:11,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-11-02 20:50:11,127 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8071278825995807 [2022-11-02 20:50:11,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-11-02 20:50:11,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-11-02 20:50:11,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:11,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-11-02 20:50:11,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,136 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 284 flow. Second operand 3 states and 385 transitions. [2022-11-02 20:50:11,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 138 transitions, 324 flow [2022-11-02 20:50:11,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 138 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:11,139 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 282 flow [2022-11-02 20:50:11,140 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2022-11-02 20:50:11,142 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -17 predicate places. [2022-11-02 20:50:11,142 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 282 flow [2022-11-02 20:50:11,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:11,149 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] [2022-11-02 20:50:11,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:50:11,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash 782364043, now seen corresponding path program 1 times [2022-11-02 20:50:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:11,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726486763] [2022-11-02 20:50:11,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:11,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:11,366 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:50:11,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:11,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726486763] [2022-11-02 20:50:11,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726486763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:11,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:11,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:11,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401298878] [2022-11-02 20:50:11,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:11,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:11,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:11,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:11,371 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 159 [2022-11-02 20:50:11,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:11,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 159 [2022-11-02 20:50:11,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:11,527 INFO L130 PetriNetUnfolder]: 58/616 cut-off events. [2022-11-02 20:50:11,527 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:50:11,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 616 events. 58/616 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3364 event pairs, 10 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 674. Up to 47 conditions per place. [2022-11-02 20:50:11,531 INFO L137 encePairwiseOnDemand]: 154/159 looper letters, 24 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2022-11-02 20:50:11,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 368 flow [2022-11-02 20:50:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:50:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:50:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2022-11-02 20:50:11,534 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8440251572327044 [2022-11-02 20:50:11,534 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2022-11-02 20:50:11,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2022-11-02 20:50:11,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:11,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2022-11-02 20:50:11,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,539 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,539 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 282 flow. Second operand 5 states and 671 transitions. [2022-11-02 20:50:11,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 368 flow [2022-11-02 20:50:11,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:11,543 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 312 flow [2022-11-02 20:50:11,543 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2022-11-02 20:50:11,546 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -11 predicate places. [2022-11-02 20:50:11,547 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 312 flow [2022-11-02 20:50:11,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:11,548 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] [2022-11-02 20:50:11,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:50:11,549 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:11,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1401429427, now seen corresponding path program 1 times [2022-11-02 20:50:11,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:11,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744025345] [2022-11-02 20:50:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:11,642 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:50:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:11,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744025345] [2022-11-02 20:50:11,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744025345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:11,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:11,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835905394] [2022-11-02 20:50:11,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:11,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:11,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:11,648 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 159 [2022-11-02 20:50:11,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:11,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 159 [2022-11-02 20:50:11,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:11,868 INFO L130 PetriNetUnfolder]: 125/1188 cut-off events. [2022-11-02 20:50:11,868 INFO L131 PetriNetUnfolder]: For 34/37 co-relation queries the response was YES. [2022-11-02 20:50:11,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1188 events. 125/1188 cut-off events. For 34/37 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 8296 event pairs, 37 based on Foata normal form. 0/1093 useless extension candidates. Maximal degree in co-relation 1422. Up to 145 conditions per place. [2022-11-02 20:50:11,877 INFO L137 encePairwiseOnDemand]: 155/159 looper letters, 26 selfloop transitions, 3 changer transitions 1/151 dead transitions. [2022-11-02 20:50:11,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 151 transitions, 396 flow [2022-11-02 20:50:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-11-02 20:50:11,879 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8406708595387841 [2022-11-02 20:50:11,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2022-11-02 20:50:11,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2022-11-02 20:50:11,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:11,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2022-11-02 20:50:11,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,884 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 312 flow. Second operand 3 states and 401 transitions. [2022-11-02 20:50:11,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 151 transitions, 396 flow [2022-11-02 20:50:11,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 151 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:11,889 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 334 flow [2022-11-02 20:50:11,889 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2022-11-02 20:50:11,892 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -7 predicate places. [2022-11-02 20:50:11,893 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 334 flow [2022-11-02 20:50:11,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:11,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:11,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:11,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:50:11,894 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1363842661, now seen corresponding path program 1 times [2022-11-02 20:50:11,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:11,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806173006] [2022-11-02 20:50:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:12,077 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:50:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:12,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806173006] [2022-11-02 20:50:12,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806173006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:12,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:12,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:50:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035640953] [2022-11-02 20:50:12,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:12,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:12,081 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 159 [2022-11-02 20:50:12,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:12,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 159 [2022-11-02 20:50:12,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:12,430 INFO L130 PetriNetUnfolder]: 171/1344 cut-off events. [2022-11-02 20:50:12,431 INFO L131 PetriNetUnfolder]: For 56/59 co-relation queries the response was YES. [2022-11-02 20:50:12,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 1344 events. 171/1344 cut-off events. For 56/59 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 10954 event pairs, 8 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 1745. Up to 175 conditions per place. [2022-11-02 20:50:12,438 INFO L137 encePairwiseOnDemand]: 151/159 looper letters, 23 selfloop transitions, 3 changer transitions 30/180 dead transitions. [2022-11-02 20:50:12,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 534 flow [2022-11-02 20:50:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:50:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-02 20:50:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1316 transitions. [2022-11-02 20:50:12,442 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8276729559748428 [2022-11-02 20:50:12,442 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1316 transitions. [2022-11-02 20:50:12,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1316 transitions. [2022-11-02 20:50:12,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:12,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1316 transitions. [2022-11-02 20:50:12,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 131.6) internal successors, (1316), 10 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 159.0) internal successors, (1749), 11 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,449 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 159.0) internal successors, (1749), 11 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,450 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 334 flow. Second operand 10 states and 1316 transitions. [2022-11-02 20:50:12,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 534 flow [2022-11-02 20:50:12,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 528 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:12,457 INFO L231 Difference]: Finished difference. Result has 163 places, 144 transitions, 363 flow [2022-11-02 20:50:12,457 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=363, PETRI_PLACES=163, PETRI_TRANSITIONS=144} [2022-11-02 20:50:12,458 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, 7 predicate places. [2022-11-02 20:50:12,458 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 144 transitions, 363 flow [2022-11-02 20:50:12,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:12,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:12,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:50:12,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1436236176, now seen corresponding path program 1 times [2022-11-02 20:50:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:12,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584006581] [2022-11-02 20:50:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:12,532 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:50:12,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:12,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584006581] [2022-11-02 20:50:12,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584006581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:12,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:12,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:12,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096196458] [2022-11-02 20:50:12,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:12,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:12,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:12,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:12,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:12,535 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 159 [2022-11-02 20:50:12,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 144 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:12,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 159 [2022-11-02 20:50:12,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:12,784 INFO L130 PetriNetUnfolder]: 171/1531 cut-off events. [2022-11-02 20:50:12,784 INFO L131 PetriNetUnfolder]: For 546/562 co-relation queries the response was YES. [2022-11-02 20:50:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 1531 events. 171/1531 cut-off events. For 546/562 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 11827 event pairs, 64 based on Foata normal form. 0/1424 useless extension candidates. Maximal degree in co-relation 2223. Up to 260 conditions per place. [2022-11-02 20:50:12,793 INFO L137 encePairwiseOnDemand]: 154/159 looper letters, 24 selfloop transitions, 4 changer transitions 9/155 dead transitions. [2022-11-02 20:50:12,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 155 transitions, 477 flow [2022-11-02 20:50:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-11-02 20:50:12,795 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8322851153039832 [2022-11-02 20:50:12,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2022-11-02 20:50:12,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2022-11-02 20:50:12,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:12,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2022-11-02 20:50:12,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,799 INFO L175 Difference]: Start difference. First operand has 163 places, 144 transitions, 363 flow. Second operand 3 states and 397 transitions. [2022-11-02 20:50:12,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 155 transitions, 477 flow [2022-11-02 20:50:12,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 155 transitions, 468 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-02 20:50:12,805 INFO L231 Difference]: Finished difference. Result has 155 places, 142 transitions, 368 flow [2022-11-02 20:50:12,806 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=155, PETRI_TRANSITIONS=142} [2022-11-02 20:50:12,806 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -1 predicate places. [2022-11-02 20:50:12,806 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 142 transitions, 368 flow [2022-11-02 20:50:12,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:12,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:12,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:50:12,808 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:12,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:12,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1239839679, now seen corresponding path program 1 times [2022-11-02 20:50:12,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:12,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421311230] [2022-11-02 20:50:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:50:12,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:12,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421311230] [2022-11-02 20:50:12,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421311230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:12,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:12,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:12,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101901451] [2022-11-02 20:50:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:12,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:50:12,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:12,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:50:12,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:50:12,891 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 159 [2022-11-02 20:50:12,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 142 transitions, 368 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:12,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:12,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 159 [2022-11-02 20:50:12,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:13,140 INFO L130 PetriNetUnfolder]: 100/997 cut-off events. [2022-11-02 20:50:13,140 INFO L131 PetriNetUnfolder]: For 320/333 co-relation queries the response was YES. [2022-11-02 20:50:13,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 997 events. 100/997 cut-off events. For 320/333 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6412 event pairs, 55 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 1453. Up to 164 conditions per place. [2022-11-02 20:50:13,146 INFO L137 encePairwiseOnDemand]: 154/159 looper letters, 21 selfloop transitions, 0 changer transitions 21/161 dead transitions. [2022-11-02 20:50:13,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 161 transitions, 514 flow [2022-11-02 20:50:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:50:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:50:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2022-11-02 20:50:13,150 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.810272536687631 [2022-11-02 20:50:13,150 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2022-11-02 20:50:13,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2022-11-02 20:50:13,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:13,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2022-11-02 20:50:13,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,156 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 159.0) internal successors, (1113), 7 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,157 INFO L175 Difference]: Start difference. First operand has 155 places, 142 transitions, 368 flow. Second operand 6 states and 773 transitions. [2022-11-02 20:50:13,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 161 transitions, 514 flow [2022-11-02 20:50:13,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 161 transitions, 500 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:50:13,165 INFO L231 Difference]: Finished difference. Result has 161 places, 140 transitions, 362 flow [2022-11-02 20:50:13,165 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=161, PETRI_TRANSITIONS=140} [2022-11-02 20:50:13,166 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, 5 predicate places. [2022-11-02 20:50:13,166 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 140 transitions, 362 flow [2022-11-02 20:50:13,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:13,168 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] [2022-11-02 20:50:13,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:50:13,168 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash 80110187, now seen corresponding path program 1 times [2022-11-02 20:50:13,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:13,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924781552] [2022-11-02 20:50:13,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,268 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:50:13,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:13,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924781552] [2022-11-02 20:50:13,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924781552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:13,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:13,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:50:13,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865269232] [2022-11-02 20:50:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:13,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:50:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:13,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:50:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:50:13,279 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 159 [2022-11-02 20:50:13,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 140 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:13,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 159 [2022-11-02 20:50:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:13,395 INFO L130 PetriNetUnfolder]: 33/555 cut-off events. [2022-11-02 20:50:13,395 INFO L131 PetriNetUnfolder]: For 131/134 co-relation queries the response was YES. [2022-11-02 20:50:13,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 555 events. 33/555 cut-off events. For 131/134 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2539 event pairs, 10 based on Foata normal form. 4/537 useless extension candidates. Maximal degree in co-relation 804. Up to 60 conditions per place. [2022-11-02 20:50:13,398 INFO L137 encePairwiseOnDemand]: 156/159 looper letters, 16 selfloop transitions, 1 changer transitions 8/147 dead transitions. [2022-11-02 20:50:13,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 147 transitions, 427 flow [2022-11-02 20:50:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:50:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-02 20:50:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2022-11-02 20:50:13,400 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8443396226415094 [2022-11-02 20:50:13,400 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2022-11-02 20:50:13,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2022-11-02 20:50:13,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:13,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2022-11-02 20:50:13,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,404 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,404 INFO L175 Difference]: Start difference. First operand has 161 places, 140 transitions, 362 flow. Second operand 4 states and 537 transitions. [2022-11-02 20:50:13,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 147 transitions, 427 flow [2022-11-02 20:50:13,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 147 transitions, 417 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-02 20:50:13,409 INFO L231 Difference]: Finished difference. Result has 155 places, 136 transitions, 333 flow [2022-11-02 20:50:13,410 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=155, PETRI_TRANSITIONS=136} [2022-11-02 20:50:13,411 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, -1 predicate places. [2022-11-02 20:50:13,411 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 136 transitions, 333 flow [2022-11-02 20:50:13,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:13,412 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] [2022-11-02 20:50:13,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:50:13,412 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:13,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:13,413 INFO L85 PathProgramCache]: Analyzing trace with hash 8224897, now seen corresponding path program 2 times [2022-11-02 20:50:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:13,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219649209] [2022-11-02 20:50:13,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:13,651 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:50:13,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:13,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219649209] [2022-11-02 20:50:13,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219649209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:13,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:13,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:50:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191828747] [2022-11-02 20:50:13,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:13,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:50:13,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:13,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:50:13,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:50:13,656 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2022-11-02 20:50:13,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 136 transitions, 333 flow. Second operand has 9 states, 9 states have (on average 121.33333333333333) internal successors, (1092), 9 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:13,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:13,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2022-11-02 20:50:13,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:14,076 INFO L130 PetriNetUnfolder]: 81/1291 cut-off events. [2022-11-02 20:50:14,077 INFO L131 PetriNetUnfolder]: For 229/244 co-relation queries the response was YES. [2022-11-02 20:50:14,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 1291 events. 81/1291 cut-off events. For 229/244 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 9388 event pairs, 32 based on Foata normal form. 1/1233 useless extension candidates. Maximal degree in co-relation 1740. Up to 74 conditions per place. [2022-11-02 20:50:14,083 INFO L137 encePairwiseOnDemand]: 148/159 looper letters, 43 selfloop transitions, 6 changer transitions 32/193 dead transitions. [2022-11-02 20:50:14,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 193 transitions, 641 flow [2022-11-02 20:50:14,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:50:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-02 20:50:14,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1748 transitions. [2022-11-02 20:50:14,089 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7852650494159928 [2022-11-02 20:50:14,089 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1748 transitions. [2022-11-02 20:50:14,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1748 transitions. [2022-11-02 20:50:14,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:14,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1748 transitions. [2022-11-02 20:50:14,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 124.85714285714286) internal successors, (1748), 14 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:14,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 159.0) internal successors, (2385), 15 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:14,101 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 159.0) internal successors, (2385), 15 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:14,101 INFO L175 Difference]: Start difference. First operand has 155 places, 136 transitions, 333 flow. Second operand 14 states and 1748 transitions. [2022-11-02 20:50:14,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 193 transitions, 641 flow [2022-11-02 20:50:14,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 193 transitions, 621 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-11-02 20:50:14,112 INFO L231 Difference]: Finished difference. Result has 171 places, 139 transitions, 372 flow [2022-11-02 20:50:14,112 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=372, PETRI_PLACES=171, PETRI_TRANSITIONS=139} [2022-11-02 20:50:14,113 INFO L287 CegarLoopForPetriNet]: 156 programPoint places, 15 predicate places. [2022-11-02 20:50:14,113 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 139 transitions, 372 flow [2022-11-02 20:50:14,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 121.33333333333333) internal successors, (1092), 9 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:14,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:14,114 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] [2022-11-02 20:50:14,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:50:14,115 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2022-11-02 20:50:14,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1829365635, now seen corresponding path program 3 times [2022-11-02 20:50:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:14,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139768921] [2022-11-02 20:50:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:14,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:50:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:50:14,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:50:14,186 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:50:14,188 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2022-11-02 20:50:14,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2022-11-02 20:50:14,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2022-11-02 20:50:14,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2022-11-02 20:50:14,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2022-11-02 20:50:14,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2022-11-02 20:50:14,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2022-11-02 20:50:14,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2022-11-02 20:50:14,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2022-11-02 20:50:14,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2022-11-02 20:50:14,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2022-11-02 20:50:14,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2022-11-02 20:50:14,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2022-11-02 20:50:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2022-11-02 20:50:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2022-11-02 20:50:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2022-11-02 20:50:14,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2022-11-02 20:50:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2022-11-02 20:50:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2022-11-02 20:50:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 27 remaining) [2022-11-02 20:50:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2022-11-02 20:50:14,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2022-11-02 20:50:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2022-11-02 20:50:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2022-11-02 20:50:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2022-11-02 20:50:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2022-11-02 20:50:14,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2022-11-02 20:50:14,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:50:14,203 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:50:14,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:50:14,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:50:14,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:50:14 BasicIcfg [2022-11-02 20:50:14,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:50:14,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:50:14,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:50:14,303 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:50:14,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:50:09" (3/4) ... [2022-11-02 20:50:14,306 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:50:14,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:50:14,307 INFO L158 Benchmark]: Toolchain (without parser) took 6258.18ms. Allocated memory was 125.8MB in the beginning and 201.3MB in the end (delta: 75.5MB). Free memory was 87.2MB in the beginning and 70.6MB in the end (delta: 16.7MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,307 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 125.8MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:14,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 750.78ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 90.2MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.51ms. Allocated memory is still 125.8MB. Free memory was 90.2MB in the beginning and 87.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,308 INFO L158 Benchmark]: Boogie Preprocessor took 54.82ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,309 INFO L158 Benchmark]: RCFGBuilder took 754.06ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 64.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,309 INFO L158 Benchmark]: TraceAbstraction took 4605.68ms. Allocated memory was 125.8MB in the beginning and 201.3MB in the end (delta: 75.5MB). Free memory was 63.6MB in the beginning and 70.6MB in the end (delta: -7.0MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2022-11-02 20:50:14,309 INFO L158 Benchmark]: Witness Printer took 4.03ms. Allocated memory is still 201.3MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:50:14,311 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.25ms. Allocated memory is still 125.8MB. Free memory is still 105.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 750.78ms. Allocated memory is still 125.8MB. Free memory was 87.0MB in the beginning and 90.2MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.51ms. Allocated memory is still 125.8MB. Free memory was 90.2MB in the beginning and 87.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.82ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 86.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 754.06ms. Allocated memory is still 125.8MB. Free memory was 86.1MB in the beginning and 64.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4605.68ms. Allocated memory was 125.8MB in the beginning and 201.3MB in the end (delta: 75.5MB). Free memory was 63.6MB in the beginning and 70.6MB in the end (delta: -7.0MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * Witness Printer took 4.03ms. Allocated memory is still 201.3MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 737]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int stoppingFlag; VAL [stoppingFlag=0] [L698] 0 volatile int pendingIo; VAL [pendingIo=0, stoppingFlag=0] [L699] 0 volatile int stoppingEvent; VAL [pendingIo=0, stoppingEvent=0, stoppingFlag=0] [L700] 0 volatile int stopped; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L755] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L756] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L757] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L758] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L759] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L760] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, pthread_create(&t, 0, BCSP_PnpStop, 0)=-1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L761] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; VAL [arg={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L744] 1 stoppingFlag = 1 VAL [arg={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L746] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L726] CALL, EXPR 1 dec() [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L709] 0 int lp = pendingIo; VAL [lp=1, lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; VAL [\result=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() VAL [dec()=0, pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L746] RET 1 BCSP_IoDecrement() [L748] 1 int lse = stoppingEvent; VAL [arg={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 VAL [lp=1, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L715] 0 return 0; VAL [\result=0, lp=1, lsf=0, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() VAL [arg={0:0}, arg={0:0}, BCSP_IoIncrement()=0, pendingIo=2, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L736] COND TRUE 0 status == 0 VAL [arg={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L737] 0 !stopped VAL [arg={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) VAL [\old(cond)=1, cond=1, pendingIo=2, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] RET 1 assume_abort_if_not(lse) [L751] 1 stopped = 1 VAL [arg={0:0}, arg={0:0}, lse=1, pendingIo=2, stopped=1, stopped = 1=53, stoppingEvent=1, stoppingFlag=1] [L737] 0 !stopped VAL [arg={0:0}, arg={0:0}, pendingIo=2, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] Now there is a data race on ~stopped~0 between C: stopped = 1 [751] and C: !stopped [737] - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 196 locations, 27 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: 4.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 471 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 97 mSDtfsCounter, 681 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=372occurred in iteration=11, InterpolantAutomatonStates: 57, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 647 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:50:14,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80a5921d-67a9-40ca-9a65-0e0de3028829/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE