./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b --- 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-38b53e6 [2022-11-25 18:32:46,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:32:46,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:32:46,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:32:46,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:32:46,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:32:46,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:32:46,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:32:46,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:32:46,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:32:46,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:32:46,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:32:46,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:32:46,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:32:46,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:32:46,753 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:32:46,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:32:46,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:32:46,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:32:46,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:32:46,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:32:46,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:32:46,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:32:46,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:32:46,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:32:46,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:32:46,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:32:46,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:32:46,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:32:46,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:32:46,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:32:46,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:32:46,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:32:46,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:32:46,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:32:46,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:32:46,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:32:46,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:32:46,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:32:46,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:32:46,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:32:46,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:32:46,821 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:32:46,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:32:46,822 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:32:46,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:32:46,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:32:46,824 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:32:46,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:32:46,826 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:32:46,826 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:32:46,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:32:46,828 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:32:46,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:32:46,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:32:46,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:32:46,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:32:46,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:32:46,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:32:46,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:32:46,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:32:46,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:32:46,832 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:32:46,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:32:46,838 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:32:46,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:32:46,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:32:46,839 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:32:46,839 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:32:46,839 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:32:46,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:32:46,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:32:46,840 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:32:46,840 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:32:46,841 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:32:46,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:32:46,841 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/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_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R 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 ! call(reach_error())) ) 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 -> 7921b56e8fb93a995ae84202df419b3b13e0137d1aac925ef124b626f5414f7b [2022-11-25 18:32:47,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:32:47,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:32:47,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:32:47,219 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:32:47,219 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:32:47,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2022-11-25 18:32:50,309 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:32:50,638 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:32:50,639 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/sv-benchmarks/c/pthread-wmm/mix010.oepc.i [2022-11-25 18:32:50,657 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/data/659db274a/0c6fe52648b3445997bc1ffa44eed4f4/FLAGa8a59c586 [2022-11-25 18:32:50,677 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/data/659db274a/0c6fe52648b3445997bc1ffa44eed4f4 [2022-11-25 18:32:50,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:32:50,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:32:50,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:32:50,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:32:50,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:32:50,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:32:50" (1/1) ... [2022-11-25 18:32:50,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@768abb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:50, skipping insertion in model container [2022-11-25 18:32:50,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:32:50" (1/1) ... [2022-11-25 18:32:50,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:32:50,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:32:50,933 WARN L237 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_de8af042-7f75-4fe3-a4bb-1dea9f57c251/sv-benchmarks/c/pthread-wmm/mix010.oepc.i[945,958] [2022-11-25 18:32:51,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,141 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,156 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,233 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:32:51,254 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:32:51,272 WARN L237 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_de8af042-7f75-4fe3-a4bb-1dea9f57c251/sv-benchmarks/c/pthread-wmm/mix010.oepc.i[945,958] [2022-11-25 18:32:51,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:32:51,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:32:51,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:32:51,453 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:32:51,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51 WrapperNode [2022-11-25 18:32:51,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:32:51,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:32:51,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:32:51,457 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:32:51,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,551 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-25 18:32:51,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:32:51,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:32:51,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:32:51,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:32:51,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,595 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:32:51,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:32:51,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:32:51,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:32:51,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (1/1) ... [2022-11-25 18:32:51,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:32:51,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:32:51,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:32:51,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:32:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:32:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:32:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:32:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:32:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:32:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:32:51,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:32:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:32:51,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:32:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:32:51,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:32:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:32:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:32:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:32:51,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:32:51,729 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:32:51,966 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:32:51,969 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:32:52,402 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:32:52,555 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:32:52,555 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:32:52,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:32:52 BoogieIcfgContainer [2022-11-25 18:32:52,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:32:52,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:32:52,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:32:52,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:32:52,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:32:50" (1/3) ... [2022-11-25 18:32:52,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b482090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:32:52, skipping insertion in model container [2022-11-25 18:32:52,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:32:51" (2/3) ... [2022-11-25 18:32:52,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b482090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:32:52, skipping insertion in model container [2022-11-25 18:32:52,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:32:52" (3/3) ... [2022-11-25 18:32:52,571 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2022-11-25 18:32:52,581 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:32:52,592 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:32:52,592 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:32:52,592 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:32:52,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:32:52,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-11-25 18:32:52,840 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-25 18:32:52,840 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:32:52,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-25 18:32:52,847 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-11-25 18:32:52,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-11-25 18:32:52,862 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:32:52,881 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 247 flow [2022-11-25 18:32:52,884 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 247 flow [2022-11-25 18:32:52,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 247 flow [2022-11-25 18:32:52,934 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-25 18:32:52,934 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:32:52,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-11-25 18:32:52,940 INFO L119 LiptonReduction]: Number of co-enabled transitions 2416 [2022-11-25 18:32:58,031 INFO L134 LiptonReduction]: Checked pairs total: 6774 [2022-11-25 18:32:58,031 INFO L136 LiptonReduction]: Total number of compositions: 107 [2022-11-25 18:32:58,060 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:32:58,069 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;@2462be1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:32:58,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 18:32:58,074 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-11-25 18:32:58,074 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:32:58,075 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:32:58,075 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 18:32:58,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:32:58,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:32:58,082 INFO L85 PathProgramCache]: Analyzing trace with hash 514967, now seen corresponding path program 1 times [2022-11-25 18:32:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:32:58,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318418522] [2022-11-25 18:32:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:32:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:32:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:32:58,539 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-25 18:32:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:32:58,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318418522] [2022-11-25 18:32:58,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318418522] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:32:58,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:32:58,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:32:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479555019] [2022-11-25 18:32:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:32:58,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:32:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:32:58,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:32:58,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:32:58,581 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 229 [2022-11-25 18:32:58,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:32:58,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:32:58,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 229 [2022-11-25 18:32:58,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:32:58,996 INFO L130 PetriNetUnfolder]: 1079/1738 cut-off events. [2022-11-25 18:32:58,996 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 18:32:59,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3385 conditions, 1738 events. 1079/1738 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9658 event pairs, 173 based on Foata normal form. 0/1652 useless extension candidates. Maximal degree in co-relation 3374. Up to 1297 conditions per place. [2022-11-25 18:32:59,016 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2022-11-25 18:32:59,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 171 flow [2022-11-25 18:32:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:32:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:32:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2022-11-25 18:32:59,042 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.529839883551674 [2022-11-25 18:32:59,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2022-11-25 18:32:59,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2022-11-25 18:32:59,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:32:59,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2022-11-25 18:32:59,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:32:59,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:32:59,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:32:59,066 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 364 transitions. [2022-11-25 18:32:59,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 171 flow [2022-11-25 18:32:59,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:32:59,073 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 58 flow [2022-11-25 18:32:59,075 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-11-25 18:32:59,081 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-11-25 18:32:59,082 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 58 flow [2022-11-25 18:32:59,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:32:59,082 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:32:59,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:32:59,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:32:59,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:32:59,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:32:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1289162086, now seen corresponding path program 1 times [2022-11-25 18:32:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:32:59,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350949689] [2022-11-25 18:32:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:32:59,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:32:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:32:59,372 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-25 18:32:59,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:32:59,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350949689] [2022-11-25 18:32:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350949689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:32:59,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:32:59,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:32:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738030151] [2022-11-25 18:32:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:32:59,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:32:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:32:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:32:59,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:32:59,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2022-11-25 18:32:59,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:32:59,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:32:59,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2022-11-25 18:32:59,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:00,024 INFO L130 PetriNetUnfolder]: 2371/3506 cut-off events. [2022-11-25 18:33:00,024 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-11-25 18:33:00,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7310 conditions, 3506 events. 2371/3506 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15897 event pairs, 1191 based on Foata normal form. 180/3686 useless extension candidates. Maximal degree in co-relation 7300. Up to 2979 conditions per place. [2022-11-25 18:33:00,043 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 32 selfloop transitions, 4 changer transitions 21/57 dead transitions. [2022-11-25 18:33:00,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 248 flow [2022-11-25 18:33:00,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:33:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:33:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2022-11-25 18:33:00,046 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4794759825327511 [2022-11-25 18:33:00,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2022-11-25 18:33:00,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2022-11-25 18:33:00,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:00,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2022-11-25 18:33:00,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,052 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,052 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 58 flow. Second operand 5 states and 549 transitions. [2022-11-25 18:33:00,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 248 flow [2022-11-25 18:33:00,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:33:00,055 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 90 flow [2022-11-25 18:33:00,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-11-25 18:33:00,056 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-11-25 18:33:00,056 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 90 flow [2022-11-25 18:33:00,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,057 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:00,057 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:33:00,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:33:00,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:00,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1950466722, now seen corresponding path program 1 times [2022-11-25 18:33:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:00,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170719964] [2022-11-25 18:33:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:33:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:00,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170719964] [2022-11-25 18:33:00,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170719964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:00,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:00,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:33:00,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954294250] [2022-11-25 18:33:00,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:00,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:33:00,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:00,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:33:00,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:33:00,284 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2022-11-25 18:33:00,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:00,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2022-11-25 18:33:00,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:00,871 INFO L130 PetriNetUnfolder]: 2103/3110 cut-off events. [2022-11-25 18:33:00,871 INFO L131 PetriNetUnfolder]: For 1510/1510 co-relation queries the response was YES. [2022-11-25 18:33:00,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 3110 events. 2103/3110 cut-off events. For 1510/1510 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13609 event pairs, 579 based on Foata normal form. 156/3266 useless extension candidates. Maximal degree in co-relation 7634. Up to 2001 conditions per place. [2022-11-25 18:33:00,889 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 35 selfloop transitions, 3 changer transitions 24/62 dead transitions. [2022-11-25 18:33:00,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 314 flow [2022-11-25 18:33:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:33:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:33:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-11-25 18:33:00,896 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4812227074235808 [2022-11-25 18:33:00,896 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-11-25 18:33:00,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-11-25 18:33:00,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:00,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-11-25 18:33:00,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,901 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,901 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 90 flow. Second operand 5 states and 551 transitions. [2022-11-25 18:33:00,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 314 flow [2022-11-25 18:33:00,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 18:33:00,917 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 99 flow [2022-11-25 18:33:00,917 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-11-25 18:33:00,919 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-11-25 18:33:00,919 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 99 flow [2022-11-25 18:33:00,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:00,920 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:00,920 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:33:00,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:33:00,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:00,921 INFO L85 PathProgramCache]: Analyzing trace with hash -533430015, now seen corresponding path program 1 times [2022-11-25 18:33:00,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:00,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417004910] [2022-11-25 18:33:00,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:00,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:01,187 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-25 18:33:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:01,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417004910] [2022-11-25 18:33:01,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417004910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:01,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:01,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:33:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895550181] [2022-11-25 18:33:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:01,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:33:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:01,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:33:01,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:33:01,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2022-11-25 18:33:01,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:01,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:01,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2022-11-25 18:33:01,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:01,760 INFO L130 PetriNetUnfolder]: 1833/2724 cut-off events. [2022-11-25 18:33:01,761 INFO L131 PetriNetUnfolder]: For 2106/2106 co-relation queries the response was YES. [2022-11-25 18:33:01,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6920 conditions, 2724 events. 1833/2724 cut-off events. For 2106/2106 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11989 event pairs, 575 based on Foata normal form. 120/2844 useless extension candidates. Maximal degree in co-relation 6904. Up to 1829 conditions per place. [2022-11-25 18:33:01,776 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 37 selfloop transitions, 3 changer transitions 20/60 dead transitions. [2022-11-25 18:33:01,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 314 flow [2022-11-25 18:33:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:33:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:33:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2022-11-25 18:33:01,778 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4794759825327511 [2022-11-25 18:33:01,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2022-11-25 18:33:01,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2022-11-25 18:33:01,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:01,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2022-11-25 18:33:01,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:01,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:01,784 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:01,784 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 99 flow. Second operand 5 states and 549 transitions. [2022-11-25 18:33:01,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 314 flow [2022-11-25 18:33:01,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 60 transitions, 302 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 18:33:01,796 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 104 flow [2022-11-25 18:33:01,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-11-25 18:33:01,797 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-11-25 18:33:01,798 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 104 flow [2022-11-25 18:33:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:01,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:01,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:33:01,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:33:01,799 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1920078634, now seen corresponding path program 1 times [2022-11-25 18:33:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:01,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16725326] [2022-11-25 18:33:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:01,946 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-25 18:33:01,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:01,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16725326] [2022-11-25 18:33:01,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16725326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:01,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:01,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:33:01,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508038088] [2022-11-25 18:33:01,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:01,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:33:01,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:01,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:33:01,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:33:01,957 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 229 [2022-11-25 18:33:01,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:01,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:01,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 229 [2022-11-25 18:33:01,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:02,156 INFO L130 PetriNetUnfolder]: 489/856 cut-off events. [2022-11-25 18:33:02,157 INFO L131 PetriNetUnfolder]: For 315/331 co-relation queries the response was YES. [2022-11-25 18:33:02,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 856 events. 489/856 cut-off events. For 315/331 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3979 event pairs, 133 based on Foata normal form. 50/887 useless extension candidates. Maximal degree in co-relation 2028. Up to 654 conditions per place. [2022-11-25 18:33:02,162 INFO L137 encePairwiseOnDemand]: 224/229 looper letters, 30 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-11-25 18:33:02,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 204 flow [2022-11-25 18:33:02,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:33:02,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:33:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2022-11-25 18:33:02,164 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5094614264919942 [2022-11-25 18:33:02,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2022-11-25 18:33:02,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2022-11-25 18:33:02,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:02,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2022-11-25 18:33:02,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,169 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 104 flow. Second operand 3 states and 350 transitions. [2022-11-25 18:33:02,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 204 flow [2022-11-25 18:33:02,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 194 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 18:33:02,171 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 120 flow [2022-11-25 18:33:02,172 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-11-25 18:33:02,172 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-11-25 18:33:02,172 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 120 flow [2022-11-25 18:33:02,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:02,173 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:33:02,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:33:02,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:02,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:02,174 INFO L85 PathProgramCache]: Analyzing trace with hash -124198198, now seen corresponding path program 1 times [2022-11-25 18:33:02,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:02,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576599839] [2022-11-25 18:33:02,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:02,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:02,349 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-25 18:33:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576599839] [2022-11-25 18:33:02,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576599839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:02,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:02,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:33:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095566012] [2022-11-25 18:33:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:02,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:33:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:33:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:33:02,360 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 229 [2022-11-25 18:33:02,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:02,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 229 [2022-11-25 18:33:02,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:02,527 INFO L130 PetriNetUnfolder]: 230/455 cut-off events. [2022-11-25 18:33:02,527 INFO L131 PetriNetUnfolder]: For 104/110 co-relation queries the response was YES. [2022-11-25 18:33:02,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 455 events. 230/455 cut-off events. For 104/110 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1977 event pairs, 86 based on Foata normal form. 45/483 useless extension candidates. Maximal degree in co-relation 1211. Up to 155 conditions per place. [2022-11-25 18:33:02,530 INFO L137 encePairwiseOnDemand]: 224/229 looper letters, 39 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-11-25 18:33:02,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 270 flow [2022-11-25 18:33:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:33:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:33:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-11-25 18:33:02,533 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.509825327510917 [2022-11-25 18:33:02,533 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2022-11-25 18:33:02,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2022-11-25 18:33:02,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:02,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2022-11-25 18:33:02,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,537 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,537 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 120 flow. Second operand 4 states and 467 transitions. [2022-11-25 18:33:02,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 270 flow [2022-11-25 18:33:02,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:33:02,540 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 156 flow [2022-11-25 18:33:02,540 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-11-25 18:33:02,541 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-11-25 18:33:02,541 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 156 flow [2022-11-25 18:33:02,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,541 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:02,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:33:02,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:33:02,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1859801102, now seen corresponding path program 1 times [2022-11-25 18:33:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:02,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885217752] [2022-11-25 18:33:02,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:02,811 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-25 18:33:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885217752] [2022-11-25 18:33:02,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885217752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:02,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:02,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:33:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406464093] [2022-11-25 18:33:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:02,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:33:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:02,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:33:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:33:02,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 229 [2022-11-25 18:33:02,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:02,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 229 [2022-11-25 18:33:02,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:02,979 INFO L130 PetriNetUnfolder]: 192/375 cut-off events. [2022-11-25 18:33:02,979 INFO L131 PetriNetUnfolder]: For 322/327 co-relation queries the response was YES. [2022-11-25 18:33:02,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 375 events. 192/375 cut-off events. For 322/327 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1631 event pairs, 82 based on Foata normal form. 12/370 useless extension candidates. Maximal degree in co-relation 1049. Up to 155 conditions per place. [2022-11-25 18:33:02,982 INFO L137 encePairwiseOnDemand]: 224/229 looper letters, 36 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-11-25 18:33:02,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 294 flow [2022-11-25 18:33:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:33:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:33:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2022-11-25 18:33:02,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4995633187772926 [2022-11-25 18:33:02,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2022-11-25 18:33:02,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2022-11-25 18:33:02,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:02,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2022-11-25 18:33:02,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,990 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 156 flow. Second operand 5 states and 572 transitions. [2022-11-25 18:33:02,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 294 flow [2022-11-25 18:33:02,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 266 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-25 18:33:02,992 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 156 flow [2022-11-25 18:33:02,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-11-25 18:33:02,993 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-11-25 18:33:02,994 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 156 flow [2022-11-25 18:33:02,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:02,994 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:02,994 INFO L209 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] [2022-11-25 18:33:02,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:33:02,995 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash -643677320, now seen corresponding path program 1 times [2022-11-25 18:33:02,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:02,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821061379] [2022-11-25 18:33:02,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:04,068 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-25 18:33:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:04,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821061379] [2022-11-25 18:33:04,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821061379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:04,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:04,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:33:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314985293] [2022-11-25 18:33:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:04,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:33:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:33:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:33:04,178 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 229 [2022-11-25 18:33:04,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 156 flow. Second operand has 10 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:04,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:04,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 229 [2022-11-25 18:33:04,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:04,880 INFO L130 PetriNetUnfolder]: 573/998 cut-off events. [2022-11-25 18:33:04,880 INFO L131 PetriNetUnfolder]: For 1338/1338 co-relation queries the response was YES. [2022-11-25 18:33:04,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 998 events. 573/998 cut-off events. For 1338/1338 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4563 event pairs, 34 based on Foata normal form. 1/999 useless extension candidates. Maximal degree in co-relation 3127. Up to 334 conditions per place. [2022-11-25 18:33:04,886 INFO L137 encePairwiseOnDemand]: 215/229 looper letters, 93 selfloop transitions, 17 changer transitions 22/132 dead transitions. [2022-11-25 18:33:04,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 132 transitions, 886 flow [2022-11-25 18:33:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:33:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 18:33:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1119 transitions. [2022-11-25 18:33:04,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44422389837237 [2022-11-25 18:33:04,890 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1119 transitions. [2022-11-25 18:33:04,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1119 transitions. [2022-11-25 18:33:04,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:04,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1119 transitions. [2022-11-25 18:33:04,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 101.72727272727273) internal successors, (1119), 11 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:04,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 229.0) internal successors, (2748), 12 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:04,899 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 229.0) internal successors, (2748), 12 states have internal predecessors, (2748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:04,899 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 156 flow. Second operand 11 states and 1119 transitions. [2022-11-25 18:33:04,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 132 transitions, 886 flow [2022-11-25 18:33:04,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 132 transitions, 762 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-11-25 18:33:04,905 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 225 flow [2022-11-25 18:33:04,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=225, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-11-25 18:33:04,906 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-11-25 18:33:04,906 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 225 flow [2022-11-25 18:33:04,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.4) internal successors, (944), 10 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:04,907 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:04,907 INFO L209 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] [2022-11-25 18:33:04,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:33:04,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1162565276, now seen corresponding path program 2 times [2022-11-25 18:33:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:04,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286535207] [2022-11-25 18:33:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:04,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:05,588 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-25 18:33:05,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:05,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286535207] [2022-11-25 18:33:05,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286535207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:05,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:05,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:33:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607314699] [2022-11-25 18:33:05,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:05,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:33:05,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:05,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:33:05,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:33:05,641 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2022-11-25 18:33:05,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 225 flow. Second operand has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:05,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:05,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2022-11-25 18:33:05,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:06,268 INFO L130 PetriNetUnfolder]: 757/1314 cut-off events. [2022-11-25 18:33:06,268 INFO L131 PetriNetUnfolder]: For 1283/1283 co-relation queries the response was YES. [2022-11-25 18:33:06,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4527 conditions, 1314 events. 757/1314 cut-off events. For 1283/1283 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6297 event pairs, 137 based on Foata normal form. 1/1315 useless extension candidates. Maximal degree in co-relation 4512. Up to 771 conditions per place. [2022-11-25 18:33:06,276 INFO L137 encePairwiseOnDemand]: 216/229 looper letters, 72 selfloop transitions, 20 changer transitions 49/141 dead transitions. [2022-11-25 18:33:06,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 141 transitions, 953 flow [2022-11-25 18:33:06,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:33:06,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-25 18:33:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1413 transitions. [2022-11-25 18:33:06,281 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4407361197754211 [2022-11-25 18:33:06,282 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1413 transitions. [2022-11-25 18:33:06,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1413 transitions. [2022-11-25 18:33:06,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:06,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1413 transitions. [2022-11-25 18:33:06,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 100.92857142857143) internal successors, (1413), 14 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:06,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 229.0) internal successors, (3435), 15 states have internal predecessors, (3435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:06,295 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 229.0) internal successors, (3435), 15 states have internal predecessors, (3435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:06,295 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 225 flow. Second operand 14 states and 1413 transitions. [2022-11-25 18:33:06,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 141 transitions, 953 flow [2022-11-25 18:33:06,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 141 transitions, 937 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 18:33:06,304 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 360 flow [2022-11-25 18:33:06,304 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=360, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2022-11-25 18:33:06,305 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2022-11-25 18:33:06,306 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 360 flow [2022-11-25 18:33:06,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:06,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:06,308 INFO L209 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] [2022-11-25 18:33:06,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:33:06,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -90939216, now seen corresponding path program 3 times [2022-11-25 18:33:06,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:06,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439419388] [2022-11-25 18:33:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:06,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:06,662 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-25 18:33:06,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:06,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439419388] [2022-11-25 18:33:06,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439419388] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:06,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:06,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:33:06,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202587269] [2022-11-25 18:33:06,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:06,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:33:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:33:06,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:33:06,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 229 [2022-11-25 18:33:06,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:06,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:06,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 229 [2022-11-25 18:33:06,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:07,170 INFO L130 PetriNetUnfolder]: 666/1172 cut-off events. [2022-11-25 18:33:07,170 INFO L131 PetriNetUnfolder]: For 2186/2186 co-relation queries the response was YES. [2022-11-25 18:33:07,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 1172 events. 666/1172 cut-off events. For 2186/2186 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5494 event pairs, 61 based on Foata normal form. 1/1173 useless extension candidates. Maximal degree in co-relation 4585. Up to 610 conditions per place. [2022-11-25 18:33:07,185 INFO L137 encePairwiseOnDemand]: 218/229 looper letters, 66 selfloop transitions, 20 changer transitions 44/130 dead transitions. [2022-11-25 18:33:07,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1037 flow [2022-11-25 18:33:07,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:33:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 18:33:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1036 transitions. [2022-11-25 18:33:07,188 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4524017467248908 [2022-11-25 18:33:07,189 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1036 transitions. [2022-11-25 18:33:07,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1036 transitions. [2022-11-25 18:33:07,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:07,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1036 transitions. [2022-11-25 18:33:07,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 103.6) internal successors, (1036), 10 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:07,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 229.0) internal successors, (2519), 11 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:07,198 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 229.0) internal successors, (2519), 11 states have internal predecessors, (2519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:07,198 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 360 flow. Second operand 10 states and 1036 transitions. [2022-11-25 18:33:07,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1037 flow [2022-11-25 18:33:07,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 130 transitions, 950 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-11-25 18:33:07,210 INFO L231 Difference]: Finished difference. Result has 72 places, 61 transitions, 441 flow [2022-11-25 18:33:07,211 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=441, PETRI_PLACES=72, PETRI_TRANSITIONS=61} [2022-11-25 18:33:07,213 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 36 predicate places. [2022-11-25 18:33:07,214 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 61 transitions, 441 flow [2022-11-25 18:33:07,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:07,215 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:07,215 INFO L209 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] [2022-11-25 18:33:07,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:33:07,215 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:07,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash 410840270, now seen corresponding path program 4 times [2022-11-25 18:33:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:07,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298149668] [2022-11-25 18:33:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:07,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:08,034 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-25 18:33:08,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:08,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298149668] [2022-11-25 18:33:08,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298149668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:08,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:08,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:33:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532339138] [2022-11-25 18:33:08,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:08,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:33:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:08,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:33:08,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:33:08,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 229 [2022-11-25 18:33:08,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 441 flow. Second operand has 8 states, 8 states have (on average 103.5) internal successors, (828), 8 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:08,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:08,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 229 [2022-11-25 18:33:08,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:08,456 INFO L130 PetriNetUnfolder]: 313/672 cut-off events. [2022-11-25 18:33:08,456 INFO L131 PetriNetUnfolder]: For 1820/1824 co-relation queries the response was YES. [2022-11-25 18:33:08,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 672 events. 313/672 cut-off events. For 1820/1824 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3531 event pairs, 44 based on Foata normal form. 3/660 useless extension candidates. Maximal degree in co-relation 2723. Up to 292 conditions per place. [2022-11-25 18:33:08,461 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 56 selfloop transitions, 9 changer transitions 28/100 dead transitions. [2022-11-25 18:33:08,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 826 flow [2022-11-25 18:33:08,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:33:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:33:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 860 transitions. [2022-11-25 18:33:08,470 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46943231441048033 [2022-11-25 18:33:08,470 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 860 transitions. [2022-11-25 18:33:08,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 860 transitions. [2022-11-25 18:33:08,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:08,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 860 transitions. [2022-11-25 18:33:08,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:08,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:08,477 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:08,478 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 441 flow. Second operand 8 states and 860 transitions. [2022-11-25 18:33:08,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 826 flow [2022-11-25 18:33:08,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 797 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-11-25 18:33:08,492 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 393 flow [2022-11-25 18:33:08,492 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=393, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2022-11-25 18:33:08,494 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2022-11-25 18:33:08,494 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 393 flow [2022-11-25 18:33:08,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.5) internal successors, (828), 8 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:08,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:08,495 INFO L209 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] [2022-11-25 18:33:08,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:33:08,495 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:08,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:08,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1548026158, now seen corresponding path program 5 times [2022-11-25 18:33:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:08,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217693463] [2022-11-25 18:33:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:33:09,013 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-25 18:33:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:33:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217693463] [2022-11-25 18:33:09,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217693463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:33:09,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:33:09,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:33:09,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213379769] [2022-11-25 18:33:09,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:33:09,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:33:09,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:33:09,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:33:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:33:09,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 229 [2022-11-25 18:33:09,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 393 flow. Second operand has 8 states, 8 states have (on average 103.625) internal successors, (829), 8 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:09,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:33:09,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 229 [2022-11-25 18:33:09,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:33:09,469 INFO L130 PetriNetUnfolder]: 343/711 cut-off events. [2022-11-25 18:33:09,469 INFO L131 PetriNetUnfolder]: For 2115/2126 co-relation queries the response was YES. [2022-11-25 18:33:09,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2955 conditions, 711 events. 343/711 cut-off events. For 2115/2126 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3541 event pairs, 91 based on Foata normal form. 9/715 useless extension candidates. Maximal degree in co-relation 2932. Up to 460 conditions per place. [2022-11-25 18:33:09,474 INFO L137 encePairwiseOnDemand]: 220/229 looper letters, 57 selfloop transitions, 22 changer transitions 25/109 dead transitions. [2022-11-25 18:33:09,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 109 transitions, 960 flow [2022-11-25 18:33:09,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:33:09,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 18:33:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 974 transitions. [2022-11-25 18:33:09,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4725861232411451 [2022-11-25 18:33:09,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 974 transitions. [2022-11-25 18:33:09,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 974 transitions. [2022-11-25 18:33:09,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:33:09,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 974 transitions. [2022-11-25 18:33:09,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.22222222222223) internal successors, (974), 9 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:09,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:09,485 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:09,486 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 393 flow. Second operand 9 states and 974 transitions. [2022-11-25 18:33:09,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 109 transitions, 960 flow [2022-11-25 18:33:09,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 922 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-25 18:33:09,495 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 575 flow [2022-11-25 18:33:09,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2022-11-25 18:33:09,496 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 39 predicate places. [2022-11-25 18:33:09,496 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 575 flow [2022-11-25 18:33:09,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.625) internal successors, (829), 8 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:33:09,497 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:33:09,497 INFO L209 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] [2022-11-25 18:33:09,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:33:09,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:33:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:33:09,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1430370642, now seen corresponding path program 6 times [2022-11-25 18:33:09,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:33:09,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650722114] [2022-11-25 18:33:09,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:33:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:33:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:33:09,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:33:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:33:09,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:33:09,642 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:33:09,643 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 18:33:09,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 18:33:09,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 18:33:09,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 18:33:09,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 18:33:09,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 18:33:09,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:33:09,647 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:33:09,653 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:33:09,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:33:09,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:33:09 BasicIcfg [2022-11-25 18:33:09,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:33:09,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:33:09,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:33:09,769 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:33:09,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:32:52" (3/4) ... [2022-11-25 18:33:09,771 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:33:09,889 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:33:09,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:33:09,890 INFO L158 Benchmark]: Toolchain (without parser) took 19206.57ms. Allocated memory was 165.7MB in the beginning and 299.9MB in the end (delta: 134.2MB). Free memory was 120.2MB in the beginning and 180.5MB in the end (delta: -60.3MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2022-11-25 18:33:09,891 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 92.7MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:33:09,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.49ms. Allocated memory is still 165.7MB. Free memory was 119.6MB in the beginning and 92.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:33:09,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.93ms. Allocated memory is still 165.7MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:33:09,892 INFO L158 Benchmark]: Boogie Preprocessor took 76.10ms. Allocated memory is still 165.7MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:33:09,892 INFO L158 Benchmark]: RCFGBuilder took 930.73ms. Allocated memory is still 165.7MB. Free memory was 88.1MB in the beginning and 114.8MB in the end (delta: -26.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-11-25 18:33:09,893 INFO L158 Benchmark]: TraceAbstraction took 17205.89ms. Allocated memory was 165.7MB in the beginning and 299.9MB in the end (delta: 134.2MB). Free memory was 114.8MB in the beginning and 193.1MB in the end (delta: -78.3MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2022-11-25 18:33:09,893 INFO L158 Benchmark]: Witness Printer took 121.59ms. Allocated memory is still 299.9MB. Free memory was 193.1MB in the beginning and 180.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 18:33:09,898 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.26ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 92.7MB in the end (delta: 151.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.49ms. Allocated memory is still 165.7MB. Free memory was 119.6MB in the beginning and 92.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.93ms. Allocated memory is still 165.7MB. Free memory was 92.3MB in the beginning and 90.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.10ms. Allocated memory is still 165.7MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 930.73ms. Allocated memory is still 165.7MB. Free memory was 88.1MB in the beginning and 114.8MB in the end (delta: -26.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17205.89ms. Allocated memory was 165.7MB in the beginning and 299.9MB in the end (delta: 134.2MB). Free memory was 114.8MB in the beginning and 193.1MB in the end (delta: -78.3MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * Witness Printer took 121.59ms. Allocated memory is still 299.9MB. Free memory was 193.1MB in the beginning and 180.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 127 PlacesBefore, 36 PlacesAfterwards, 119 TransitionsBefore, 27 TransitionsAfterwards, 2416 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3348, independent: 3151, independent conditional: 0, independent unconditional: 3151, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1848, independent: 1798, independent conditional: 0, independent unconditional: 1798, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1848, independent: 1779, independent conditional: 0, independent unconditional: 1779, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 390, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 358, dependent conditional: 0, dependent unconditional: 358, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3348, independent: 1353, independent conditional: 0, independent unconditional: 1353, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 1848, unknown conditional: 0, unknown unconditional: 1848] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 178, Positive conditional cache size: 0, Positive unconditional cache size: 178, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t257, ((void *)0), P0, ((void *)0))=-3, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t258, ((void *)0), P1, ((void *)0))=-2, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t259, ((void *)0), P2, ((void *)0))=-1, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 851]: 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: 853]: 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 7 procedures, 152 locations, 6 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: 16.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 781 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 887 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 743 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2197 IncrementalHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 144 mSDtfsCounter, 2197 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=575occurred in iteration=12, InterpolantAutomatonStates: 82, 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.6s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 1767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 proved your program to be incorrect! [2022-11-25 18:33:09,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_de8af042-7f75-4fe3-a4bb-1dea9f57c251/bin/uautomizer-ZsLfNo2U6R/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