./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/qw2004_variant.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/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_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/qw2004_variant.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/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_d0bf2d80-dfee-464a-ad99-d48f5c341de2/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 1ad14026eba5b252f16e1e7c5b06294a08c72d8fedf1d2cbda596d8ea988add3 --- 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:57:06,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:57:06,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:57:06,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:57:06,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:57:06,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:57:06,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:57:06,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:57:06,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:57:06,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:57:06,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:57:06,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:57:06,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:57:06,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:57:06,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:57:06,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:57:06,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:57:06,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:57:06,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:57:06,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:57:06,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:57:06,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:57:06,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:57:06,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:57:06,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:57:06,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:57:06,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:57:06,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:57:06,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:57:06,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:57:06,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:57:06,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:57:06,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:57:06,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:57:06,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:57:06,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:57:06,730 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:57:06,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:57:06,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:57:06,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:57:06,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:57:06,733 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:57:06,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:57:06,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:57:06,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:57:06,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:57:06,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:57:06,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:57:06,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:57:06,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:57:06,774 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:57:06,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:57:06,775 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:57:06,776 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:57:06,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:57:06,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:57:06,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:57:06,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:57:06,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:57:06,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:57:06,777 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:57:06,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:57:06,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:57:06,778 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:57:06,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:57:06,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:57:06,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:57:06,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:57:06,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:06,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:57:06,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:57:06,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:57:06,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:57:06,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:57:06,780 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:57:06,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:57:06,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:57:06,781 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_d0bf2d80-dfee-464a-ad99-d48f5c341de2/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_d0bf2d80-dfee-464a-ad99-d48f5c341de2/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 -> 1ad14026eba5b252f16e1e7c5b06294a08c72d8fedf1d2cbda596d8ea988add3 [2022-11-02 20:57:07,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:57:07,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:57:07,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:57:07,059 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:57:07,060 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:57:07,061 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-lit/qw2004_variant.i [2022-11-02 20:57:07,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/data/37a61e3ba/911c51c596ff4c04a3317ca0d21118a0/FLAG7e5abc577 [2022-11-02 20:57:07,684 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:57:07,684 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/sv-benchmarks/c/pthread-lit/qw2004_variant.i [2022-11-02 20:57:07,695 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/data/37a61e3ba/911c51c596ff4c04a3317ca0d21118a0/FLAG7e5abc577 [2022-11-02 20:57:07,988 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/data/37a61e3ba/911c51c596ff4c04a3317ca0d21118a0 [2022-11-02 20:57:07,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:57:07,992 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:57:07,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:07,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:57:08,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:57:08,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:07" (1/1) ... [2022-11-02 20:57:08,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2385bc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08, skipping insertion in model container [2022-11-02 20:57:08,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:57:07" (1/1) ... [2022-11-02 20:57:08,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:57:08,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:57:08,408 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_d0bf2d80-dfee-464a-ad99-d48f5c341de2/sv-benchmarks/c/pthread-lit/qw2004_variant.i[30003,30016] [2022-11-02 20:57:08,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:08,451 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:57:08,505 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_d0bf2d80-dfee-464a-ad99-d48f5c341de2/sv-benchmarks/c/pthread-lit/qw2004_variant.i[30003,30016] [2022-11-02 20:57:08,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:57:08,560 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:57:08,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08 WrapperNode [2022-11-02 20:57:08,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:57:08,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:08,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:57:08,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:57:08,570 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:57:08" (1/1) ... [2022-11-02 20:57:08,604 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:57:08" (1/1) ... [2022-11-02 20:57:08,641 INFO L138 Inliner]: procedures = 174, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 155 [2022-11-02 20:57:08,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:57:08,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:57:08,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:57:08,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:57:08,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,668 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,691 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:57:08,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:57:08,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:57:08,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:57:08,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (1/1) ... [2022-11-02 20:57:08,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:57:08,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:57:08,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:57:08,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:57:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2022-11-02 20:57:08,790 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2022-11-02 20:57:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:57:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:57:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:57:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:57:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:57:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpAdd [2022-11-02 20:57:08,792 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpAdd [2022-11-02 20:57:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:57:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:57:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:57:08,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:57:08,794 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:57:08,959 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:57:08,972 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:57:09,330 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:57:09,484 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:57:09,492 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:57:09,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:09 BoogieIcfgContainer [2022-11-02 20:57:09,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:57:09,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:57:09,497 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:57:09,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:57:09,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:57:07" (1/3) ... [2022-11-02 20:57:09,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8bc539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:09, skipping insertion in model container [2022-11-02 20:57:09,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:57:08" (2/3) ... [2022-11-02 20:57:09,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a8bc539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:57:09, skipping insertion in model container [2022-11-02 20:57:09,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:09" (3/3) ... [2022-11-02 20:57:09,505 INFO L112 eAbstractionObserver]: Analyzing ICFG qw2004_variant.i [2022-11-02 20:57:09,516 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:57:09,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:57:09,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2022-11-02 20:57:09,527 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:57:09,617 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:57:09,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 144 transitions, 298 flow [2022-11-02 20:57:09,742 INFO L130 PetriNetUnfolder]: 6/155 cut-off events. [2022-11-02 20:57:09,742 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:57:09,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 155 events. 6/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 279 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 112. Up to 4 conditions per place. [2022-11-02 20:57:09,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 144 transitions, 298 flow [2022-11-02 20:57:09,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 143 transitions, 294 flow [2022-11-02 20:57:09,763 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:09,770 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;@488a1140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:09,770 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-11-02 20:57:09,776 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-11-02 20:57:09,777 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:57:09,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:09,777 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] [2022-11-02 20:57:09,778 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2022-11-02 20:57:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2094445560, now seen corresponding path program 1 times [2022-11-02 20:57:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:09,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939077765] [2022-11-02 20:57:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:10,032 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:57:10,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:10,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939077765] [2022-11-02 20:57:10,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939077765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:10,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:10,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821994426] [2022-11-02 20:57:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:10,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:10,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:10,108 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2022-11-02 20:57:10,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 143 transitions, 294 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:10,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2022-11-02 20:57:10,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:10,238 INFO L130 PetriNetUnfolder]: 8/192 cut-off events. [2022-11-02 20:57:10,238 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:57:10,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 192 events. 8/192 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 495 event pairs, 4 based on Foata normal form. 16/189 useless extension candidates. Maximal degree in co-relation 166. Up to 18 conditions per place. [2022-11-02 20:57:10,242 INFO L137 encePairwiseOnDemand]: 127/144 looper letters, 9 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2022-11-02 20:57:10,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 284 flow [2022-11-02 20:57:10,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-11-02 20:57:10,257 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8726851851851852 [2022-11-02 20:57:10,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2022-11-02 20:57:10,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2022-11-02 20:57:10,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:10,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2022-11-02 20:57:10,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,276 INFO L175 Difference]: Start difference. First operand has 144 places, 143 transitions, 294 flow. Second operand 3 states and 377 transitions. [2022-11-02 20:57:10,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 284 flow [2022-11-02 20:57:10,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:57:10,290 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 265 flow [2022-11-02 20:57:10,294 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-11-02 20:57:10,298 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -12 predicate places. [2022-11-02 20:57:10,298 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 265 flow [2022-11-02 20:57:10,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:10,299 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] [2022-11-02 20:57:10,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:57:10,300 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2022-11-02 20:57:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash -501155979, now seen corresponding path program 1 times [2022-11-02 20:57:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411437996] [2022-11-02 20:57:10,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:10,369 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:57:10,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:10,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411437996] [2022-11-02 20:57:10,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411437996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:10,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:10,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561703524] [2022-11-02 20:57:10,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:10,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:10,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:10,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:10,374 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2022-11-02 20:57:10,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:10,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2022-11-02 20:57:10,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:10,450 INFO L130 PetriNetUnfolder]: 18/257 cut-off events. [2022-11-02 20:57:10,450 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:57:10,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 257 events. 18/257 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 837 event pairs, 16 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 292. Up to 45 conditions per place. [2022-11-02 20:57:10,454 INFO L137 encePairwiseOnDemand]: 141/144 looper letters, 12 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2022-11-02 20:57:10,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 126 transitions, 291 flow [2022-11-02 20:57:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2022-11-02 20:57:10,457 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2022-11-02 20:57:10,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2022-11-02 20:57:10,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2022-11-02 20:57:10,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:10,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2022-11-02 20:57:10,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,461 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 265 flow. Second operand 3 states and 357 transitions. [2022-11-02 20:57:10,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 126 transitions, 291 flow [2022-11-02 20:57:10,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 126 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:10,465 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 263 flow [2022-11-02 20:57:10,466 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2022-11-02 20:57:10,466 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -13 predicate places. [2022-11-02 20:57:10,467 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 263 flow [2022-11-02 20:57:10,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:10,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:10,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:57:10,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2022-11-02 20:57:10,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -911440581, now seen corresponding path program 1 times [2022-11-02 20:57:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867126533] [2022-11-02 20:57:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:10,569 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:57:10,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:10,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867126533] [2022-11-02 20:57:10,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867126533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:10,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:10,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665647602] [2022-11-02 20:57:10,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:10,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:10,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:10,576 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2022-11-02 20:57:10,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:10,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2022-11-02 20:57:10,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:10,654 INFO L130 PetriNetUnfolder]: 22/320 cut-off events. [2022-11-02 20:57:10,654 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:57:10,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 320 events. 22/320 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1245 event pairs, 16 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 352. Up to 45 conditions per place. [2022-11-02 20:57:10,659 INFO L137 encePairwiseOnDemand]: 141/144 looper letters, 12 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2022-11-02 20:57:10,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 125 transitions, 289 flow [2022-11-02 20:57:10,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2022-11-02 20:57:10,663 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2022-11-02 20:57:10,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2022-11-02 20:57:10,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2022-11-02 20:57:10,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:10,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2022-11-02 20:57:10,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,674 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 263 flow. Second operand 3 states and 357 transitions. [2022-11-02 20:57:10,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 125 transitions, 289 flow [2022-11-02 20:57:10,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 125 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:10,679 INFO L231 Difference]: Finished difference. Result has 130 places, 125 transitions, 261 flow [2022-11-02 20:57:10,680 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=130, PETRI_TRANSITIONS=125} [2022-11-02 20:57:10,683 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -14 predicate places. [2022-11-02 20:57:10,684 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 125 transitions, 261 flow [2022-11-02 20:57:10,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:10,685 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] [2022-11-02 20:57:10,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:57:10,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2022-11-02 20:57:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,687 INFO L85 PathProgramCache]: Analyzing trace with hash -780218612, now seen corresponding path program 1 times [2022-11-02 20:57:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804847474] [2022-11-02 20:57:10,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:10,748 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:57:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:10,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804847474] [2022-11-02 20:57:10,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804847474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:10,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:10,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:10,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599779174] [2022-11-02 20:57:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:10,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:10,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:10,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:10,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:10,752 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 144 [2022-11-02 20:57:10,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 125 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:10,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 144 [2022-11-02 20:57:10,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:10,826 INFO L130 PetriNetUnfolder]: 34/313 cut-off events. [2022-11-02 20:57:10,826 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:57:10,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 313 events. 34/313 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1172 event pairs, 28 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 367. Up to 72 conditions per place. [2022-11-02 20:57:10,829 INFO L137 encePairwiseOnDemand]: 141/144 looper letters, 15 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2022-11-02 20:57:10,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 293 flow [2022-11-02 20:57:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2022-11-02 20:57:10,831 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8125 [2022-11-02 20:57:10,831 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2022-11-02 20:57:10,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2022-11-02 20:57:10,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:10,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2022-11-02 20:57:10,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,840 INFO L175 Difference]: Start difference. First operand has 130 places, 125 transitions, 261 flow. Second operand 3 states and 351 transitions. [2022-11-02 20:57:10,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 293 flow [2022-11-02 20:57:10,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 124 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:10,844 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 259 flow [2022-11-02 20:57:10,844 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2022-11-02 20:57:10,845 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -15 predicate places. [2022-11-02 20:57:10,845 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 259 flow [2022-11-02 20:57:10,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:10,846 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] [2022-11-02 20:57:10,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:57:10,847 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2022-11-02 20:57:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1062366882, now seen corresponding path program 1 times [2022-11-02 20:57:10,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:10,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696839905] [2022-11-02 20:57:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:10,917 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:57:10,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:10,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696839905] [2022-11-02 20:57:10,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696839905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:10,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:10,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089950886] [2022-11-02 20:57:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:10,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:10,921 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 144 [2022-11-02 20:57:10,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:10,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:10,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 144 [2022-11-02 20:57:10,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:10,996 INFO L130 PetriNetUnfolder]: 29/318 cut-off events. [2022-11-02 20:57:10,996 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:57:10,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 318 events. 29/318 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1261 event pairs, 13 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 357. Up to 48 conditions per place. [2022-11-02 20:57:10,999 INFO L137 encePairwiseOnDemand]: 138/144 looper letters, 14 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2022-11-02 20:57:11,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 130 transitions, 312 flow [2022-11-02 20:57:11,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2022-11-02 20:57:11,002 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2022-11-02 20:57:11,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2022-11-02 20:57:11,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2022-11-02 20:57:11,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:11,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2022-11-02 20:57:11,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,005 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 259 flow. Second operand 3 states and 365 transitions. [2022-11-02 20:57:11,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 130 transitions, 312 flow [2022-11-02 20:57:11,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 130 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:11,009 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 293 flow [2022-11-02 20:57:11,009 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=293, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2022-11-02 20:57:11,010 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -13 predicate places. [2022-11-02 20:57:11,010 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 293 flow [2022-11-02 20:57:11,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:11,011 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] [2022-11-02 20:57:11,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:57:11,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2022-11-02 20:57:11,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1087661972, now seen corresponding path program 1 times [2022-11-02 20:57:11,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:11,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325556767] [2022-11-02 20:57:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,067 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:57:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325556767] [2022-11-02 20:57:11,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325556767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668670782] [2022-11-02 20:57:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:11,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:11,070 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2022-11-02 20:57:11,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:11,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2022-11-02 20:57:11,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:11,143 INFO L130 PetriNetUnfolder]: 23/322 cut-off events. [2022-11-02 20:57:11,144 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-02 20:57:11,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 322 events. 23/322 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1329 event pairs, 6 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 372. Up to 28 conditions per place. [2022-11-02 20:57:11,147 INFO L137 encePairwiseOnDemand]: 140/144 looper letters, 15 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2022-11-02 20:57:11,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 133 transitions, 346 flow [2022-11-02 20:57:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2022-11-02 20:57:11,149 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2022-11-02 20:57:11,149 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2022-11-02 20:57:11,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2022-11-02 20:57:11,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:11,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2022-11-02 20:57:11,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,152 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 293 flow. Second operand 3 states and 368 transitions. [2022-11-02 20:57:11,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 133 transitions, 346 flow [2022-11-02 20:57:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 133 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:11,156 INFO L231 Difference]: Finished difference. Result has 133 places, 130 transitions, 305 flow [2022-11-02 20:57:11,157 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=133, PETRI_TRANSITIONS=130} [2022-11-02 20:57:11,157 INFO L287 CegarLoopForPetriNet]: 144 programPoint places, -11 predicate places. [2022-11-02 20:57:11,158 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 130 transitions, 305 flow [2022-11-02 20:57:11,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:11,159 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:11,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:57:11,159 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 33 more)] === [2022-11-02 20:57:11,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 110373436, now seen corresponding path program 1 times [2022-11-02 20:57:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:11,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106643362] [2022-11-02 20:57:11,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:57:11,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:57:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:57:11,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:57:11,232 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:57:11,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 36 remaining) [2022-11-02 20:57:11,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2022-11-02 20:57:11,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2022-11-02 20:57:11,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2022-11-02 20:57:11,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2022-11-02 20:57:11,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2022-11-02 20:57:11,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2022-11-02 20:57:11,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2022-11-02 20:57:11,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr0ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2022-11-02 20:57:11,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr1ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2022-11-02 20:57:11,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr2ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2022-11-02 20:57:11,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr3ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2022-11-02 20:57:11,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2022-11-02 20:57:11,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2022-11-02 20:57:11,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2022-11-02 20:57:11,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2022-11-02 20:57:11,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2022-11-02 20:57:11,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2022-11-02 20:57:11,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2022-11-02 20:57:11,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2022-11-02 20:57:11,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 36 remaining) [2022-11-02 20:57:11,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2022-11-02 20:57:11,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (13 of 36 remaining) [2022-11-02 20:57:11,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (12 of 36 remaining) [2022-11-02 20:57:11,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2022-11-02 20:57:11,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2022-11-02 20:57:11,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2022-11-02 20:57:11,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2022-11-02 20:57:11,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr0ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2022-11-02 20:57:11,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr1ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2022-11-02 20:57:11,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr2ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2022-11-02 20:57:11,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr3ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2022-11-02 20:57:11,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2022-11-02 20:57:11,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2022-11-02 20:57:11,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2022-11-02 20:57:11,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2022-11-02 20:57:11,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:57:11,244 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:11,247 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:57:11,247 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 20:57:11,282 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:57:11,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 221 transitions, 466 flow [2022-11-02 20:57:11,319 INFO L130 PetriNetUnfolder]: 10/214 cut-off events. [2022-11-02 20:57:11,319 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:57:11,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 214 events. 10/214 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 493 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 223. Up to 6 conditions per place. [2022-11-02 20:57:11,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 221 transitions, 466 flow [2022-11-02 20:57:11,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 185 transitions, 385 flow [2022-11-02 20:57:11,325 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:57:11,326 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;@488a1140, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:57:11,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2022-11-02 20:57:11,329 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-11-02 20:57:11,329 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:57:11,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:11,329 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] [2022-11-02 20:57:11,330 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:57:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2064524264, now seen corresponding path program 1 times [2022-11-02 20:57:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:11,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800509664] [2022-11-02 20:57:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800509664] [2022-11-02 20:57:11,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800509664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638550289] [2022-11-02 20:57:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:11,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:11,358 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 221 [2022-11-02 20:57:11,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 185 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:11,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 221 [2022-11-02 20:57:11,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:11,502 INFO L130 PetriNetUnfolder]: 68/546 cut-off events. [2022-11-02 20:57:11,503 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-11-02 20:57:11,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 546 events. 68/546 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2778 event pairs, 44 based on Foata normal form. 76/547 useless extension candidates. Maximal degree in co-relation 618. Up to 90 conditions per place. [2022-11-02 20:57:11,510 INFO L137 encePairwiseOnDemand]: 196/221 looper letters, 13 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2022-11-02 20:57:11,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 160 transitions, 365 flow [2022-11-02 20:57:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2022-11-02 20:57:11,513 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8446455505279035 [2022-11-02 20:57:11,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2022-11-02 20:57:11,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2022-11-02 20:57:11,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:11,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2022-11-02 20:57:11,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,519 INFO L175 Difference]: Start difference. First operand has 185 places, 185 transitions, 385 flow. Second operand 3 states and 560 transitions. [2022-11-02 20:57:11,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 160 transitions, 365 flow [2022-11-02 20:57:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 160 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-02 20:57:11,524 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 336 flow [2022-11-02 20:57:11,524 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2022-11-02 20:57:11,525 INFO L287 CegarLoopForPetriNet]: 185 programPoint places, -20 predicate places. [2022-11-02 20:57:11,526 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 336 flow [2022-11-02 20:57:11,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:11,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:11,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:57:11,530 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:57:11,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1518721742, now seen corresponding path program 1 times [2022-11-02 20:57:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:11,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629256831] [2022-11-02 20:57:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:11,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,595 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:57:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629256831] [2022-11-02 20:57:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629256831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134468463] [2022-11-02 20:57:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:11,604 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 221 [2022-11-02 20:57:11,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:11,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 221 [2022-11-02 20:57:11,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:11,885 INFO L130 PetriNetUnfolder]: 184/1074 cut-off events. [2022-11-02 20:57:11,886 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-02 20:57:11,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1404 conditions, 1074 events. 184/1074 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7407 event pairs, 140 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 1373. Up to 249 conditions per place. [2022-11-02 20:57:11,899 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 16 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2022-11-02 20:57:11,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 159 transitions, 370 flow [2022-11-02 20:57:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2022-11-02 20:57:11,903 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7888386123680241 [2022-11-02 20:57:11,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2022-11-02 20:57:11,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2022-11-02 20:57:11,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:11,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2022-11-02 20:57:11,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,907 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 336 flow. Second operand 3 states and 523 transitions. [2022-11-02 20:57:11,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 159 transitions, 370 flow [2022-11-02 20:57:11,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 159 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:11,912 INFO L231 Difference]: Finished difference. Result has 164 places, 159 transitions, 334 flow [2022-11-02 20:57:11,912 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=164, PETRI_TRANSITIONS=159} [2022-11-02 20:57:11,914 INFO L287 CegarLoopForPetriNet]: 185 programPoint places, -21 predicate places. [2022-11-02 20:57:11,915 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 334 flow [2022-11-02 20:57:11,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:11,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:11,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:57:11,916 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:57:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1327333179, now seen corresponding path program 1 times [2022-11-02 20:57:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:11,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497936413] [2022-11-02 20:57:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:57:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497936413] [2022-11-02 20:57:11,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497936413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:11,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:11,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:11,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264985910] [2022-11-02 20:57:11,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:11,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:11,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:11,973 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 221 [2022-11-02 20:57:11,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:11,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:11,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 221 [2022-11-02 20:57:11,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:12,220 INFO L130 PetriNetUnfolder]: 192/1199 cut-off events. [2022-11-02 20:57:12,221 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-11-02 20:57:12,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 1199 events. 192/1199 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 8412 event pairs, 140 based on Foata normal form. 0/997 useless extension candidates. Maximal degree in co-relation 1495. Up to 249 conditions per place. [2022-11-02 20:57:12,236 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 16 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2022-11-02 20:57:12,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 158 transitions, 368 flow [2022-11-02 20:57:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2022-11-02 20:57:12,239 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7888386123680241 [2022-11-02 20:57:12,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2022-11-02 20:57:12,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2022-11-02 20:57:12,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:12,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2022-11-02 20:57:12,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,243 INFO L175 Difference]: Start difference. First operand has 164 places, 159 transitions, 334 flow. Second operand 3 states and 523 transitions. [2022-11-02 20:57:12,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 158 transitions, 368 flow [2022-11-02 20:57:12,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 158 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:12,247 INFO L231 Difference]: Finished difference. Result has 163 places, 158 transitions, 332 flow [2022-11-02 20:57:12,248 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=163, PETRI_TRANSITIONS=158} [2022-11-02 20:57:12,249 INFO L287 CegarLoopForPetriNet]: 185 programPoint places, -22 predicate places. [2022-11-02 20:57:12,249 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 158 transitions, 332 flow [2022-11-02 20:57:12,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:12,250 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] [2022-11-02 20:57:12,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:57:12,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:57:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash -634638679, now seen corresponding path program 1 times [2022-11-02 20:57:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:12,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866551952] [2022-11-02 20:57:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:12,297 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:57:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:12,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866551952] [2022-11-02 20:57:12,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866551952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:12,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:12,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368800915] [2022-11-02 20:57:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:12,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:12,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:12,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:12,300 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 221 [2022-11-02 20:57:12,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 158 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:12,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 221 [2022-11-02 20:57:12,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:12,732 INFO L130 PetriNetUnfolder]: 470/1870 cut-off events. [2022-11-02 20:57:12,732 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-11-02 20:57:12,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 1870 events. 470/1870 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 14553 event pairs, 434 based on Foata normal form. 0/1515 useless extension candidates. Maximal degree in co-relation 2680. Up to 723 conditions per place. [2022-11-02 20:57:12,756 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 22 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2022-11-02 20:57:12,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 157 transitions, 378 flow [2022-11-02 20:57:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2022-11-02 20:57:12,758 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.770739064856712 [2022-11-02 20:57:12,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2022-11-02 20:57:12,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2022-11-02 20:57:12,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:12,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2022-11-02 20:57:12,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,763 INFO L175 Difference]: Start difference. First operand has 163 places, 158 transitions, 332 flow. Second operand 3 states and 511 transitions. [2022-11-02 20:57:12,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 157 transitions, 378 flow [2022-11-02 20:57:12,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 157 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:12,768 INFO L231 Difference]: Finished difference. Result has 162 places, 157 transitions, 330 flow [2022-11-02 20:57:12,769 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=162, PETRI_TRANSITIONS=157} [2022-11-02 20:57:12,770 INFO L287 CegarLoopForPetriNet]: 185 programPoint places, -23 predicate places. [2022-11-02 20:57:12,770 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 157 transitions, 330 flow [2022-11-02 20:57:12,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:12,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:12,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:57:12,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:57:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2070825386, now seen corresponding path program 1 times [2022-11-02 20:57:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:12,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115530066] [2022-11-02 20:57:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:12,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:12,815 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:57:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:12,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115530066] [2022-11-02 20:57:12,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115530066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:12,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:12,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247142365] [2022-11-02 20:57:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:12,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:12,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:12,819 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 221 [2022-11-02 20:57:12,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 157 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:12,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:12,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 221 [2022-11-02 20:57:12,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:13,147 INFO L130 PetriNetUnfolder]: 304/1433 cut-off events. [2022-11-02 20:57:13,148 INFO L131 PetriNetUnfolder]: For 105/105 co-relation queries the response was YES. [2022-11-02 20:57:13,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1433 events. 304/1433 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10891 event pairs, 150 based on Foata normal form. 0/1172 useless extension candidates. Maximal degree in co-relation 1933. Up to 339 conditions per place. [2022-11-02 20:57:13,165 INFO L137 encePairwiseOnDemand]: 213/221 looper letters, 20 selfloop transitions, 7 changer transitions 0/167 dead transitions. [2022-11-02 20:57:13,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 167 transitions, 412 flow [2022-11-02 20:57:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-11-02 20:57:13,167 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8069381598793364 [2022-11-02 20:57:13,167 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2022-11-02 20:57:13,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2022-11-02 20:57:13,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:13,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2022-11-02 20:57:13,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,172 INFO L175 Difference]: Start difference. First operand has 162 places, 157 transitions, 330 flow. Second operand 3 states and 535 transitions. [2022-11-02 20:57:13,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 167 transitions, 412 flow [2022-11-02 20:57:13,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 167 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:13,175 INFO L231 Difference]: Finished difference. Result has 164 places, 163 transitions, 380 flow [2022-11-02 20:57:13,176 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=164, PETRI_TRANSITIONS=163} [2022-11-02 20:57:13,176 INFO L287 CegarLoopForPetriNet]: 185 programPoint places, -21 predicate places. [2022-11-02 20:57:13,177 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 163 transitions, 380 flow [2022-11-02 20:57:13,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:13,177 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] [2022-11-02 20:57:13,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:57:13,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:57:13,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1467271871, now seen corresponding path program 1 times [2022-11-02 20:57:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:13,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401177415] [2022-11-02 20:57:13,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:13,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:57:13,221 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:57:13,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:57:13,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401177415] [2022-11-02 20:57:13,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401177415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:57:13,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:57:13,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:57:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903094848] [2022-11-02 20:57:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:57:13,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:57:13,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:57:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:57:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:57:13,224 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 221 [2022-11-02 20:57:13,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 163 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:57:13,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 221 [2022-11-02 20:57:13,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:57:13,527 INFO L130 PetriNetUnfolder]: 274/1550 cut-off events. [2022-11-02 20:57:13,528 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-11-02 20:57:13,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2322 conditions, 1550 events. 274/1550 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 12059 event pairs, 111 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2269. Up to 257 conditions per place. [2022-11-02 20:57:13,552 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 24 selfloop transitions, 4 changer transitions 0/172 dead transitions. [2022-11-02 20:57:13,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 172 transitions, 470 flow [2022-11-02 20:57:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:57:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:57:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2022-11-02 20:57:13,554 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8114630467571644 [2022-11-02 20:57:13,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2022-11-02 20:57:13,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2022-11-02 20:57:13,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:57:13,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2022-11-02 20:57:13,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,558 INFO L175 Difference]: Start difference. First operand has 164 places, 163 transitions, 380 flow. Second operand 3 states and 538 transitions. [2022-11-02 20:57:13,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 172 transitions, 470 flow [2022-11-02 20:57:13,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 172 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:57:13,569 INFO L231 Difference]: Finished difference. Result has 166 places, 166 transitions, 396 flow [2022-11-02 20:57:13,570 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=166, PETRI_TRANSITIONS=166} [2022-11-02 20:57:13,571 INFO L287 CegarLoopForPetriNet]: 185 programPoint places, -19 predicate places. [2022-11-02 20:57:13,571 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 166 transitions, 396 flow [2022-11-02 20:57:13,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:57:13,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:57:13,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:13,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:57:13,572 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2022-11-02 20:57:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:57:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash -653843165, now seen corresponding path program 1 times [2022-11-02 20:57:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:57:13,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620890663] [2022-11-02 20:57:13,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:57:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:57:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:57:13,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:57:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:57:13,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:57:13,616 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:57:13,616 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2022-11-02 20:57:13,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2022-11-02 20:57:13,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2022-11-02 20:57:13,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2022-11-02 20:57:13,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2022-11-02 20:57:13,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2022-11-02 20:57:13,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2022-11-02 20:57:13,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2022-11-02 20:57:13,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr0ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2022-11-02 20:57:13,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr1ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2022-11-02 20:57:13,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr2ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2022-11-02 20:57:13,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr3ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2022-11-02 20:57:13,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2022-11-02 20:57:13,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2022-11-02 20:57:13,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2022-11-02 20:57:13,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2022-11-02 20:57:13,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2022-11-02 20:57:13,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2022-11-02 20:57:13,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2022-11-02 20:57:13,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2022-11-02 20:57:13,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 51 remaining) [2022-11-02 20:57:13,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 51 remaining) [2022-11-02 20:57:13,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2022-11-02 20:57:13,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2022-11-02 20:57:13,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2022-11-02 20:57:13,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2022-11-02 20:57:13,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2022-11-02 20:57:13,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2022-11-02 20:57:13,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2022-11-02 20:57:13,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2022-11-02 20:57:13,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2022-11-02 20:57:13,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (19 of 51 remaining) [2022-11-02 20:57:13,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (18 of 51 remaining) [2022-11-02 20:57:13,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (17 of 51 remaining) [2022-11-02 20:57:13,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (16 of 51 remaining) [2022-11-02 20:57:13,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr0ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2022-11-02 20:57:13,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr1ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2022-11-02 20:57:13,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2022-11-02 20:57:13,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr3ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2022-11-02 20:57:13,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2022-11-02 20:57:13,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2022-11-02 20:57:13,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2022-11-02 20:57:13,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2022-11-02 20:57:13,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr0ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2022-11-02 20:57:13,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr1ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2022-11-02 20:57:13,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr2ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2022-11-02 20:57:13,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr3ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2022-11-02 20:57:13,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr4ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2022-11-02 20:57:13,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr5ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2022-11-02 20:57:13,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr6ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2022-11-02 20:57:13,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpAddErr7ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2022-11-02 20:57:13,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:57:13,629 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:57:13,636 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2022-11-02 20:57:13,636 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:57:13,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:57:13 BasicIcfg [2022-11-02 20:57:13,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:57:13,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:57:13,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:57:13,700 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:57:13,700 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:57:09" (3/4) ... [2022-11-02 20:57:13,703 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:57:13,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:57:13,704 INFO L158 Benchmark]: Toolchain (without parser) took 5711.59ms. Allocated memory was 90.2MB in the beginning and 165.7MB in the end (delta: 75.5MB). Free memory was 50.6MB in the beginning and 110.3MB in the end (delta: -59.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-11-02 20:57:13,704 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 90.2MB. Free memory was 68.1MB in the beginning and 68.0MB in the end (delta: 51.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:13,704 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.42ms. Allocated memory is still 90.2MB. Free memory was 50.4MB in the beginning and 56.7MB in the end (delta: -6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:57:13,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.82ms. Allocated memory is still 90.2MB. Free memory was 56.7MB in the beginning and 54.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:13,705 INFO L158 Benchmark]: Boogie Preprocessor took 55.24ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:57:13,705 INFO L158 Benchmark]: RCFGBuilder took 796.39ms. Allocated memory is still 90.2MB. Free memory was 52.7MB in the beginning and 62.3MB in the end (delta: -9.6MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-11-02 20:57:13,706 INFO L158 Benchmark]: TraceAbstraction took 4202.30ms. Allocated memory was 90.2MB in the beginning and 165.7MB in the end (delta: 75.5MB). Free memory was 61.5MB in the beginning and 110.3MB in the end (delta: -48.7MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2022-11-02 20:57:13,706 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 165.7MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:57:13,708 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 90.2MB. Free memory was 68.1MB in the beginning and 68.0MB in the end (delta: 51.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.42ms. Allocated memory is still 90.2MB. Free memory was 50.4MB in the beginning and 56.7MB in the end (delta: -6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.82ms. Allocated memory is still 90.2MB. Free memory was 56.7MB in the beginning and 54.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.24ms. Allocated memory is still 90.2MB. Free memory was 54.4MB in the beginning and 52.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 796.39ms. Allocated memory is still 90.2MB. Free memory was 52.7MB in the beginning and 62.3MB in the end (delta: -9.6MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4202.30ms. Allocated memory was 90.2MB in the beginning and 165.7MB in the end (delta: 75.5MB). Free memory was 61.5MB in the beginning and 110.3MB in the end (delta: -48.7MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 165.7MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 730]: 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] [L737] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L738] 0 int i; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L739] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L740] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L741] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L742] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L743] 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}] [L744] 0 i = 0 VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L744] COND TRUE 0 i < 10 VAL [i=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L745] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpAdd, 0) VAL [i=0, pendingIo=1, pthread_create(&t, 0, BCSP_PnpAdd, 0)=0, stopped=0, stoppingEvent=0, stoppingFlag=0, t={3:0}] [L721] 2 int status; VAL [arg={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L722] CALL 2 BCSP_IoIncrement() [L730] 1 stoppingFlag = 1 VAL [arg={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, stoppingFlag = 1=50] [L703] 2 \read(stoppingFlag) [L703] 2 \read(stoppingFlag) [L703] COND TRUE 2 \read(stoppingFlag) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L730] 1 stoppingFlag = 1 VAL [arg={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1, stoppingFlag = 1=50] Now there is a data race on ~stoppingFlag~0 between C: if (stoppingFlag) { __VERIFIER_atomic_end(); return -1; } else { pendingIo = pendingIo + 1; } [703-708] and C: stoppingFlag = 1 [730] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 732]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 733]: 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: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 739]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 740]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 742]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 745]: 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. - UnprovableResult [Line: 743]: 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 5 procedures, 214 locations, 36 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: 1.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 121 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 38 mSDtfsCounter, 121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=6, InterpolantAutomatonStates: 18, 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, 0.4s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 287 locations, 51 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: 2.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 183 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 41 mSDtfsCounter, 183 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=396occurred in iteration=6, InterpolantAutomatonStates: 18, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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:57:13,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d0bf2d80-dfee-464a-ad99-d48f5c341de2/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