./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044.opt.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_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/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_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/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_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/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 bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 --- 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 16:55:03,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:55:03,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:55:03,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:55:03,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:55:03,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:55:03,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:55:03,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:55:03,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:55:03,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:55:03,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:55:03,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:55:03,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:55:03,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:55:03,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:55:03,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:55:03,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:55:03,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:55:03,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:55:03,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:55:03,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:55:03,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:55:03,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:55:03,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:55:03,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:55:03,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:55:03,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:55:03,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:55:03,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:55:03,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:55:03,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:55:03,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:55:03,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:55:03,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:55:03,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:55:03,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:55:03,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:55:03,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:55:03,784 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:55:03,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:55:03,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:55:03,789 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 16:55:03,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:55:03,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:55:03,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:55:03,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:55:03,847 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:55:03,847 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:55:03,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:55:03,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:55:03,849 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:55:03,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:55:03,851 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:55:03,852 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:55:03,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:55:03,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:55:03,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:55:03,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:55:03,854 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:55:03,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:55:03,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:55:03,855 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:55:03,855 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:55:03,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:55:03,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:55:03,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:55:03,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:55:03,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:55:03,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:55:03,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:55:03,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:55:03,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:55:03,860 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:55:03,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:55:03,861 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:55:03,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:55:03,862 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_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/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_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/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 -> bb408c890b0d52a937687fd58d564d57121120b7f4647156375768e776a678b4 [2022-11-25 16:55:04,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:55:04,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:55:04,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:55:04,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:55:04,313 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:55:04,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-25 16:55:07,710 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:55:08,021 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:55:08,022 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/sv-benchmarks/c/pthread-wmm/mix044.opt.i [2022-11-25 16:55:08,040 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/data/c8f754ba7/fa97dd1ec8564233a197de18a62d78d2/FLAGd16b9f75b [2022-11-25 16:55:08,060 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/data/c8f754ba7/fa97dd1ec8564233a197de18a62d78d2 [2022-11-25 16:55:08,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:55:08,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:55:08,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:55:08,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:55:08,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:55:08,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9763b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08, skipping insertion in model container [2022-11-25 16:55:08,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:55:08,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:55:08,336 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_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-25 16:55:08,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:55:08,772 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:55:08,787 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_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/sv-benchmarks/c/pthread-wmm/mix044.opt.i[944,957] [2022-11-25 16:55:08,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,813 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,814 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,815 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,818 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,819 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,820 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,824 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,825 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,829 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,830 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,843 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:55:08,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:55:08,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:55:08,895 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:55:08,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08 WrapperNode [2022-11-25 16:55:08,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:55:08,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:55:08,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:55:08,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:55:08,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,959 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2022-11-25 16:55:08,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:55:08,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:55:08,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:55:08,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:55:08,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,995 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:08,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:09,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:55:09,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:55:09,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:55:09,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:55:09,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (1/1) ... [2022-11-25 16:55:09,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:55:09,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:09,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:55:09,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:55:09,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:55:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:55:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:55:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:55:09,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:55:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:55:09,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:55:09,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:55:09,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:55:09,123 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:55:09,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:55:09,123 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 16:55:09,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 16:55:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:55:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:55:09,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:55:09,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:55:09,126 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 16:55:09,336 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:55:09,339 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:55:09,885 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:55:10,135 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:55:10,136 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:55:10,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:10 BoogieIcfgContainer [2022-11-25 16:55:10,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:55:10,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:55:10,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:55:10,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:55:10,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:55:08" (1/3) ... [2022-11-25 16:55:10,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da6d4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:55:10, skipping insertion in model container [2022-11-25 16:55:10,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:08" (2/3) ... [2022-11-25 16:55:10,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da6d4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:55:10, skipping insertion in model container [2022-11-25 16:55:10,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:10" (3/3) ... [2022-11-25 16:55:10,159 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044.opt.i [2022-11-25 16:55:10,171 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 16:55:10,185 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:55:10,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 16:55:10,187 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:55:10,255 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:55:10,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 16:55:10,370 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 16:55:10,370 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:55:10,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-25 16:55:10,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-25 16:55:10,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-25 16:55:10,388 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:55:10,420 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 16:55:10,424 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-11-25 16:55:10,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-11-25 16:55:10,511 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-25 16:55:10,513 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:55:10,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-25 16:55:10,519 INFO L119 LiptonReduction]: Number of co-enabled transitions 3168 [2022-11-25 16:55:19,295 INFO L134 LiptonReduction]: Checked pairs total: 7829 [2022-11-25 16:55:19,296 INFO L136 LiptonReduction]: Total number of compositions: 120 [2022-11-25 16:55:19,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:55:19,342 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;@30d073c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:55:19,343 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 16:55:19,354 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-11-25 16:55:19,354 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:55:19,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:19,356 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:19,357 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 422581805, now seen corresponding path program 1 times [2022-11-25 16:55:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:19,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303581619] [2022-11-25 16:55:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:19,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:20,105 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 16:55:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:20,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303581619] [2022-11-25 16:55:20,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303581619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:20,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:20,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:55:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484106730] [2022-11-25 16:55:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:20,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:20,166 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 257 [2022-11-25 16:55:20,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 16:55:20,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:20,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 257 [2022-11-25 16:55:20,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:21,190 INFO L130 PetriNetUnfolder]: 2594/3793 cut-off events. [2022-11-25 16:55:21,191 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-11-25 16:55:21,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7488 conditions, 3793 events. 2594/3793 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20164 event pairs, 518 based on Foata normal form. 0/3600 useless extension candidates. Maximal degree in co-relation 7476. Up to 2797 conditions per place. [2022-11-25 16:55:21,233 INFO L137 encePairwiseOnDemand]: 253/257 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-25 16:55:21,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2022-11-25 16:55:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:55:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-11-25 16:55:21,261 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5265888456549935 [2022-11-25 16:55:21,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-11-25 16:55:21,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-11-25 16:55:21,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:21,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-11-25 16:55:21,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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 16:55:21,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states 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 16:55:21,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states 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 16:55:21,292 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 406 transitions. [2022-11-25 16:55:21,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2022-11-25 16:55:21,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 16:55:21,303 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-11-25 16:55:21,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 16:55:21,311 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 16:55:21,311 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-11-25 16:55:21,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 16:55:21,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:21,312 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:21,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:55:21,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:21,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:21,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1920687172, now seen corresponding path program 1 times [2022-11-25 16:55:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:21,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783055268] [2022-11-25 16:55:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:21,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:22,841 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 16:55:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:22,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783055268] [2022-11-25 16:55:22,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783055268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:22,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:22,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:55:22,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985557340] [2022-11-25 16:55:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:22,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:55:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:22,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:55:22,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:55:22,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-25 16:55:22,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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 16:55:22,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:22,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-25 16:55:22,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:24,542 INFO L130 PetriNetUnfolder]: 6309/8750 cut-off events. [2022-11-25 16:55:24,543 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-11-25 16:55:24,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18098 conditions, 8750 events. 6309/8750 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 45852 event pairs, 477 based on Foata normal form. 240/8988 useless extension candidates. Maximal degree in co-relation 18088. Up to 6497 conditions per place. [2022-11-25 16:55:24,611 INFO L137 encePairwiseOnDemand]: 246/257 looper letters, 50 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2022-11-25 16:55:24,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 276 flow [2022-11-25 16:55:24,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:55:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:55:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2022-11-25 16:55:24,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49416342412451364 [2022-11-25 16:55:24,615 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2022-11-25 16:55:24,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2022-11-25 16:55:24,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:24,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2022-11-25 16:55:24,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:24,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:24,621 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:24,622 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 4 states and 508 transitions. [2022-11-25 16:55:24,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 276 flow [2022-11-25 16:55:24,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 63 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:55:24,626 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 137 flow [2022-11-25 16:55:24,626 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2022-11-25 16:55:24,627 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-11-25 16:55:24,627 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 137 flow [2022-11-25 16:55:24,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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 16:55:24,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:24,628 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:24,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:55:24,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash 588238651, now seen corresponding path program 1 times [2022-11-25 16:55:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:24,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805586489] [2022-11-25 16:55:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:24,906 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 16:55:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:24,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805586489] [2022-11-25 16:55:24,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805586489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:24,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:24,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:55:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269327004] [2022-11-25 16:55:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:24,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:24,920 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 257 [2022-11-25 16:55:24,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 16:55:24,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:24,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 257 [2022-11-25 16:55:24,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:26,041 INFO L130 PetriNetUnfolder]: 4731/6866 cut-off events. [2022-11-25 16:55:26,042 INFO L131 PetriNetUnfolder]: For 2513/2533 co-relation queries the response was YES. [2022-11-25 16:55:26,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18114 conditions, 6866 events. 4731/6866 cut-off events. For 2513/2533 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 37181 event pairs, 1606 based on Foata normal form. 130/6856 useless extension candidates. Maximal degree in co-relation 18102. Up to 3950 conditions per place. [2022-11-25 16:55:26,104 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 39 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2022-11-25 16:55:26,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 265 flow [2022-11-25 16:55:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:55:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2022-11-25 16:55:26,107 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.51621271076524 [2022-11-25 16:55:26,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2022-11-25 16:55:26,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2022-11-25 16:55:26,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:26,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2022-11-25 16:55:26,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 16:55:26,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states 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 16:55:26,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states 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 16:55:26,176 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 137 flow. Second operand 3 states and 398 transitions. [2022-11-25 16:55:26,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 265 flow [2022-11-25 16:55:26,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 265 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:55:26,178 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 148 flow [2022-11-25 16:55:26,178 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-11-25 16:55:26,179 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-11-25 16:55:26,179 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 148 flow [2022-11-25 16:55:26,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 16:55:26,180 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:26,180 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:26,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:55:26,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -735093217, now seen corresponding path program 1 times [2022-11-25 16:55:26,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:26,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110642965] [2022-11-25 16:55:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:27,144 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 16:55:27,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:27,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110642965] [2022-11-25 16:55:27,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110642965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:27,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:27,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837823726] [2022-11-25 16:55:27,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:27,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:55:27,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:27,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:55:27,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:55:27,173 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2022-11-25 16:55:27,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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 16:55:27,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:27,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2022-11-25 16:55:27,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:28,770 INFO L130 PetriNetUnfolder]: 5639/8184 cut-off events. [2022-11-25 16:55:28,771 INFO L131 PetriNetUnfolder]: For 3565/3571 co-relation queries the response was YES. [2022-11-25 16:55:28,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22343 conditions, 8184 events. 5639/8184 cut-off events. For 3565/3571 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 43514 event pairs, 1447 based on Foata normal form. 62/8116 useless extension candidates. Maximal degree in co-relation 22328. Up to 5677 conditions per place. [2022-11-25 16:55:28,867 INFO L137 encePairwiseOnDemand]: 252/257 looper letters, 53 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2022-11-25 16:55:28,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 377 flow [2022-11-25 16:55:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:55:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:55:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2022-11-25 16:55:28,872 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5107003891050583 [2022-11-25 16:55:28,872 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2022-11-25 16:55:28,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2022-11-25 16:55:28,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:28,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2022-11-25 16:55:28,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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 16:55:28,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:28,880 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:28,880 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 148 flow. Second operand 4 states and 525 transitions. [2022-11-25 16:55:28,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 377 flow [2022-11-25 16:55:28,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:55:28,919 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 199 flow [2022-11-25 16:55:28,920 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-11-25 16:55:28,921 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-11-25 16:55:28,922 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 199 flow [2022-11-25 16:55:28,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states 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 16:55:28,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:28,923 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:28,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:55:28,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1140793473, now seen corresponding path program 1 times [2022-11-25 16:55:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:28,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640737637] [2022-11-25 16:55:28,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:29,947 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 16:55:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:29,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640737637] [2022-11-25 16:55:29,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640737637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:29,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:29,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:55:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093592154] [2022-11-25 16:55:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:29,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:55:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:55:29,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:55:30,010 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 257 [2022-11-25 16:55:30,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 16:55:30,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:30,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 257 [2022-11-25 16:55:30,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:31,940 INFO L130 PetriNetUnfolder]: 6258/8986 cut-off events. [2022-11-25 16:55:31,941 INFO L131 PetriNetUnfolder]: For 5839/5977 co-relation queries the response was YES. [2022-11-25 16:55:31,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26399 conditions, 8986 events. 6258/8986 cut-off events. For 5839/5977 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 48346 event pairs, 1226 based on Foata normal form. 38/8827 useless extension candidates. Maximal degree in co-relation 26382. Up to 6193 conditions per place. [2022-11-25 16:55:32,029 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 61 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2022-11-25 16:55:32,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 524 flow [2022-11-25 16:55:32,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:55:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:55:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2022-11-25 16:55:32,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4926070038910506 [2022-11-25 16:55:32,035 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2022-11-25 16:55:32,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2022-11-25 16:55:32,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:32,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2022-11-25 16:55:32,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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 16:55:32,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states 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 16:55:32,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states 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 16:55:32,044 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 199 flow. Second operand 5 states and 633 transitions. [2022-11-25 16:55:32,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 524 flow [2022-11-25 16:55:32,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:55:32,062 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 334 flow [2022-11-25 16:55:32,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2022-11-25 16:55:32,065 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-11-25 16:55:32,066 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 334 flow [2022-11-25 16:55:32,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states 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 16:55:32,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:32,067 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:32,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:55:32,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1029394353, now seen corresponding path program 2 times [2022-11-25 16:55:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461948796] [2022-11-25 16:55:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:33,018 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 16:55:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:33,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461948796] [2022-11-25 16:55:33,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461948796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:33,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:33,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:55:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82832667] [2022-11-25 16:55:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:33,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:55:33,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:33,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:55:33,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:55:33,073 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2022-11-25 16:55:33,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 16:55:33,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:33,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2022-11-25 16:55:33,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:34,812 INFO L130 PetriNetUnfolder]: 7050/10132 cut-off events. [2022-11-25 16:55:34,812 INFO L131 PetriNetUnfolder]: For 15282/15429 co-relation queries the response was YES. [2022-11-25 16:55:34,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34299 conditions, 10132 events. 7050/10132 cut-off events. For 15282/15429 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 55899 event pairs, 1364 based on Foata normal form. 100/10023 useless extension candidates. Maximal degree in co-relation 34278. Up to 4707 conditions per place. [2022-11-25 16:55:34,925 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 65 selfloop transitions, 22 changer transitions 0/93 dead transitions. [2022-11-25 16:55:34,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 684 flow [2022-11-25 16:55:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:55:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:55:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2022-11-25 16:55:34,934 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5105058365758754 [2022-11-25 16:55:34,934 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2022-11-25 16:55:34,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2022-11-25 16:55:34,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:34,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2022-11-25 16:55:34,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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 16:55:34,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states 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 16:55:34,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states 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 16:55:34,942 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 334 flow. Second operand 5 states and 656 transitions. [2022-11-25 16:55:34,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 93 transitions, 684 flow [2022-11-25 16:55:34,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 665 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-25 16:55:35,003 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 419 flow [2022-11-25 16:55:35,003 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=419, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2022-11-25 16:55:35,007 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2022-11-25 16:55:35,007 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 419 flow [2022-11-25 16:55:35,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states 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 16:55:35,008 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:35,008 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:35,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:55:35,009 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash 221821018, now seen corresponding path program 1 times [2022-11-25 16:55:35,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:35,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101450756] [2022-11-25 16:55:35,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:35,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:35,408 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 16:55:35,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:35,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101450756] [2022-11-25 16:55:35,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101450756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:35,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:35,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:35,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342499102] [2022-11-25 16:55:35,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:35,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:55:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:35,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:55:35,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:55:35,431 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 16:55:35,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 419 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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 16:55:35,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:35,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 16:55:35,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:36,833 INFO L130 PetriNetUnfolder]: 5926/8718 cut-off events. [2022-11-25 16:55:36,834 INFO L131 PetriNetUnfolder]: For 26968/27337 co-relation queries the response was YES. [2022-11-25 16:55:36,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31958 conditions, 8718 events. 5926/8718 cut-off events. For 26968/27337 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 52275 event pairs, 1087 based on Foata normal form. 1015/9416 useless extension candidates. Maximal degree in co-relation 31935. Up to 5448 conditions per place. [2022-11-25 16:55:36,905 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 124 selfloop transitions, 9 changer transitions 22/164 dead transitions. [2022-11-25 16:55:36,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 164 transitions, 1565 flow [2022-11-25 16:55:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:55:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:55:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-11-25 16:55:36,909 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5089494163424124 [2022-11-25 16:55:36,909 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-11-25 16:55:36,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-11-25 16:55:36,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:36,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-11-25 16:55:36,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states 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 16:55:36,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states 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 16:55:36,916 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states 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 16:55:36,916 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 419 flow. Second operand 5 states and 654 transitions. [2022-11-25 16:55:36,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 164 transitions, 1565 flow [2022-11-25 16:55:36,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 164 transitions, 1459 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-11-25 16:55:36,967 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 474 flow [2022-11-25 16:55:36,967 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=474, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2022-11-25 16:55:36,968 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2022-11-25 16:55:36,968 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 474 flow [2022-11-25 16:55:36,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states 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 16:55:36,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:36,969 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 16:55:36,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:55:36,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:36,970 INFO L85 PathProgramCache]: Analyzing trace with hash 688341719, now seen corresponding path program 1 times [2022-11-25 16:55:36,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:36,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394382589] [2022-11-25 16:55:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:37,241 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 16:55:37,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:37,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394382589] [2022-11-25 16:55:37,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394382589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:37,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:37,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:55:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864166653] [2022-11-25 16:55:37,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:37,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:55:37,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:37,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:55:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:55:37,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 16:55:37,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 474 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states 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 16:55:37,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:37,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 16:55:37,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:38,486 INFO L130 PetriNetUnfolder]: 4700/7136 cut-off events. [2022-11-25 16:55:38,487 INFO L131 PetriNetUnfolder]: For 25826/26381 co-relation queries the response was YES. [2022-11-25 16:55:38,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30062 conditions, 7136 events. 4700/7136 cut-off events. For 25826/26381 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 44192 event pairs, 447 based on Foata normal form. 886/7761 useless extension candidates. Maximal degree in co-relation 30036. Up to 3003 conditions per place. [2022-11-25 16:55:38,548 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 193 selfloop transitions, 18 changer transitions 14/234 dead transitions. [2022-11-25 16:55:38,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 234 transitions, 2230 flow [2022-11-25 16:55:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:55:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:55:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 916 transitions. [2022-11-25 16:55:38,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50917176209005 [2022-11-25 16:55:38,553 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 916 transitions. [2022-11-25 16:55:38,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 916 transitions. [2022-11-25 16:55:38,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:38,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 916 transitions. [2022-11-25 16:55:38,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 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 16:55:38,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states 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 16:55:38,562 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states 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 16:55:38,562 INFO L175 Difference]: Start difference. First operand has 60 places, 66 transitions, 474 flow. Second operand 7 states and 916 transitions. [2022-11-25 16:55:38,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 234 transitions, 2230 flow [2022-11-25 16:55:38,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 234 transitions, 2225 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:55:38,620 INFO L231 Difference]: Finished difference. Result has 68 places, 75 transitions, 620 flow [2022-11-25 16:55:38,621 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=620, PETRI_PLACES=68, PETRI_TRANSITIONS=75} [2022-11-25 16:55:38,621 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2022-11-25 16:55:38,621 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 75 transitions, 620 flow [2022-11-25 16:55:38,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states 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 16:55:38,622 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:38,622 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:38,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:55:38,623 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1337471640, now seen corresponding path program 1 times [2022-11-25 16:55:38,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:38,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338739749] [2022-11-25 16:55:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:38,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:39,596 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 16:55:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:39,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338739749] [2022-11-25 16:55:39,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338739749] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:39,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:39,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870162948] [2022-11-25 16:55:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:39,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:55:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:39,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:55:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:55:39,665 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 257 [2022-11-25 16:55:39,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 75 transitions, 620 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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 16:55:39,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:39,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 257 [2022-11-25 16:55:39,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:41,108 INFO L130 PetriNetUnfolder]: 7474/11185 cut-off events. [2022-11-25 16:55:41,108 INFO L131 PetriNetUnfolder]: For 40596/40868 co-relation queries the response was YES. [2022-11-25 16:55:41,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51948 conditions, 11185 events. 7474/11185 cut-off events. For 40596/40868 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 66557 event pairs, 1641 based on Foata normal form. 251/11408 useless extension candidates. Maximal degree in co-relation 51918. Up to 5767 conditions per place. [2022-11-25 16:55:41,185 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 106 selfloop transitions, 10 changer transitions 14/133 dead transitions. [2022-11-25 16:55:41,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 133 transitions, 1314 flow [2022-11-25 16:55:41,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:55:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:55:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2022-11-25 16:55:41,190 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48735408560311283 [2022-11-25 16:55:41,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2022-11-25 16:55:41,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2022-11-25 16:55:41,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:41,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2022-11-25 16:55:41,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states 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 16:55:41,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:41,201 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:55:41,201 INFO L175 Difference]: Start difference. First operand has 68 places, 75 transitions, 620 flow. Second operand 4 states and 501 transitions. [2022-11-25 16:55:41,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 133 transitions, 1314 flow [2022-11-25 16:55:41,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 133 transitions, 1216 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-11-25 16:55:41,920 INFO L231 Difference]: Finished difference. Result has 70 places, 74 transitions, 590 flow [2022-11-25 16:55:41,921 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=590, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2022-11-25 16:55:41,921 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2022-11-25 16:55:41,922 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 590 flow [2022-11-25 16:55:41,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states 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 16:55:41,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:41,922 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:41,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:55:41,923 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1451194690, now seen corresponding path program 1 times [2022-11-25 16:55:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:41,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253431577] [2022-11-25 16:55:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:42,176 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 16:55:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:42,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253431577] [2022-11-25 16:55:42,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253431577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:42,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:42,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:55:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889697844] [2022-11-25 16:55:42,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:42,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:55:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:42,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:55:42,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:55:42,197 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 16:55:42,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 590 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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 16:55:42,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:42,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 16:55:42,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:43,216 INFO L130 PetriNetUnfolder]: 4020/6335 cut-off events. [2022-11-25 16:55:43,217 INFO L131 PetriNetUnfolder]: For 29094/29811 co-relation queries the response was YES. [2022-11-25 16:55:43,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28195 conditions, 6335 events. 4020/6335 cut-off events. For 29094/29811 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 41166 event pairs, 307 based on Foata normal form. 758/6858 useless extension candidates. Maximal degree in co-relation 28163. Up to 2564 conditions per place. [2022-11-25 16:55:43,278 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 196 selfloop transitions, 23 changer transitions 45/274 dead transitions. [2022-11-25 16:55:43,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 274 transitions, 2782 flow [2022-11-25 16:55:43,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:55:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:55:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1173 transitions. [2022-11-25 16:55:43,283 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5071335927367056 [2022-11-25 16:55:43,284 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1173 transitions. [2022-11-25 16:55:43,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1173 transitions. [2022-11-25 16:55:43,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:43,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1173 transitions. [2022-11-25 16:55:43,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.33333333333334) internal successors, (1173), 9 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states 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 16:55:43,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states 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 16:55:43,295 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states 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 16:55:43,296 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 590 flow. Second operand 9 states and 1173 transitions. [2022-11-25 16:55:43,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 274 transitions, 2782 flow [2022-11-25 16:55:43,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 274 transitions, 2753 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-11-25 16:55:43,567 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 715 flow [2022-11-25 16:55:43,569 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=715, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2022-11-25 16:55:43,570 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2022-11-25 16:55:43,570 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 715 flow [2022-11-25 16:55:43,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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 16:55:43,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:43,572 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] [2022-11-25 16:55:43,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:55:43,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:43,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 234647696, now seen corresponding path program 1 times [2022-11-25 16:55:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:43,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954830789] [2022-11-25 16:55:43,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:44,581 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 16:55:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:44,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954830789] [2022-11-25 16:55:44,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954830789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:44,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:44,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:55:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660890549] [2022-11-25 16:55:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:44,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:55:44,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:55:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:55:44,659 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2022-11-25 16:55:44,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 715 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 16:55:44,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:44,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2022-11-25 16:55:44,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:46,201 INFO L130 PetriNetUnfolder]: 7144/10993 cut-off events. [2022-11-25 16:55:46,201 INFO L131 PetriNetUnfolder]: For 45646/45924 co-relation queries the response was YES. [2022-11-25 16:55:46,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52666 conditions, 10993 events. 7144/10993 cut-off events. For 45646/45924 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 69555 event pairs, 759 based on Foata normal form. 190/11145 useless extension candidates. Maximal degree in co-relation 52631. Up to 5227 conditions per place. [2022-11-25 16:55:46,270 INFO L137 encePairwiseOnDemand]: 245/257 looper letters, 125 selfloop transitions, 25 changer transitions 64/217 dead transitions. [2022-11-25 16:55:46,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 217 transitions, 2344 flow [2022-11-25 16:55:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:55:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:55:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2022-11-25 16:55:46,278 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4805447470817121 [2022-11-25 16:55:46,278 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2022-11-25 16:55:46,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2022-11-25 16:55:46,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:46,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2022-11-25 16:55:46,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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 16:55:46,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states 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 16:55:46,286 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states 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 16:55:46,287 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 715 flow. Second operand 6 states and 741 transitions. [2022-11-25 16:55:46,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 217 transitions, 2344 flow [2022-11-25 16:55:47,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 217 transitions, 2018 flow, removed 128 selfloop flow, removed 3 redundant places. [2022-11-25 16:55:47,285 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 702 flow [2022-11-25 16:55:47,285 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=702, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2022-11-25 16:55:47,286 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 41 predicate places. [2022-11-25 16:55:47,286 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 702 flow [2022-11-25 16:55:47,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states 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 16:55:47,287 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:47,287 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] [2022-11-25 16:55:47,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:55:47,288 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:47,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 478462100, now seen corresponding path program 2 times [2022-11-25 16:55:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:47,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584798484] [2022-11-25 16:55:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:47,613 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 16:55:47,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:47,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584798484] [2022-11-25 16:55:47,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584798484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:47,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:47,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:55:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028491001] [2022-11-25 16:55:47,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:55:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:55:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:55:47,638 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-11-25 16:55:47,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 702 flow. Second operand has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states 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 16:55:47,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:47,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-11-25 16:55:47,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:48,927 INFO L130 PetriNetUnfolder]: 4501/7317 cut-off events. [2022-11-25 16:55:48,927 INFO L131 PetriNetUnfolder]: For 33507/34187 co-relation queries the response was YES. [2022-11-25 16:55:48,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33523 conditions, 7317 events. 4501/7317 cut-off events. For 33507/34187 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 51633 event pairs, 283 based on Foata normal form. 479/7544 useless extension candidates. Maximal degree in co-relation 33485. Up to 2731 conditions per place. [2022-11-25 16:55:48,972 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 136 selfloop transitions, 27 changer transitions 97/266 dead transitions. [2022-11-25 16:55:48,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 266 transitions, 2972 flow [2022-11-25 16:55:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:55:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 16:55:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1409 transitions. [2022-11-25 16:55:48,980 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4984082065794128 [2022-11-25 16:55:48,980 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1409 transitions. [2022-11-25 16:55:48,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1409 transitions. [2022-11-25 16:55:48,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:48,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1409 transitions. [2022-11-25 16:55:48,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.0909090909091) internal successors, (1409), 11 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states 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 16:55:48,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states 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 16:55:48,994 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 257.0) internal successors, (3084), 12 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states 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 16:55:48,994 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 702 flow. Second operand 11 states and 1409 transitions. [2022-11-25 16:55:48,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 266 transitions, 2972 flow [2022-11-25 16:55:49,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 266 transitions, 2923 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-11-25 16:55:49,500 INFO L231 Difference]: Finished difference. Result has 94 places, 67 transitions, 597 flow [2022-11-25 16:55:49,501 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=597, PETRI_PLACES=94, PETRI_TRANSITIONS=67} [2022-11-25 16:55:49,501 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2022-11-25 16:55:49,502 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 67 transitions, 597 flow [2022-11-25 16:55:49,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states 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 16:55:49,502 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:49,503 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, 1, 1] [2022-11-25 16:55:49,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:55:49,503 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2141848964, now seen corresponding path program 1 times [2022-11-25 16:55:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:49,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017813150] [2022-11-25 16:55:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:50,457 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 16:55:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:50,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017813150] [2022-11-25 16:55:50,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017813150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:50,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:50,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:55:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161263940] [2022-11-25 16:55:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:50,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:55:50,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:55:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:55:50,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2022-11-25 16:55:50,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 67 transitions, 597 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 16:55:50,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:55:50,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2022-11-25 16:55:50,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:55:51,341 INFO L130 PetriNetUnfolder]: 2708/4444 cut-off events. [2022-11-25 16:55:51,341 INFO L131 PetriNetUnfolder]: For 16519/16519 co-relation queries the response was YES. [2022-11-25 16:55:51,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20607 conditions, 4444 events. 2708/4444 cut-off events. For 16519/16519 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 27470 event pairs, 506 based on Foata normal form. 1/4441 useless extension candidates. Maximal degree in co-relation 20574. Up to 2153 conditions per place. [2022-11-25 16:55:51,367 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 71 selfloop transitions, 6 changer transitions 90/169 dead transitions. [2022-11-25 16:55:51,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 169 transitions, 1796 flow [2022-11-25 16:55:51,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:55:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:55:51,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2022-11-25 16:55:51,370 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4695201037613489 [2022-11-25 16:55:51,371 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2022-11-25 16:55:51,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2022-11-25 16:55:51,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:55:51,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2022-11-25 16:55:51,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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 16:55:51,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states 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 16:55:51,377 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states 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 16:55:51,377 INFO L175 Difference]: Start difference. First operand has 94 places, 67 transitions, 597 flow. Second operand 6 states and 724 transitions. [2022-11-25 16:55:51,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 169 transitions, 1796 flow [2022-11-25 16:55:51,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 169 transitions, 1448 flow, removed 59 selfloop flow, removed 16 redundant places. [2022-11-25 16:55:51,502 INFO L231 Difference]: Finished difference. Result has 83 places, 54 transitions, 355 flow [2022-11-25 16:55:51,502 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=355, PETRI_PLACES=83, PETRI_TRANSITIONS=54} [2022-11-25 16:55:51,503 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2022-11-25 16:55:51,503 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 355 flow [2022-11-25 16:55:51,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 16:55:51,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:55:51,504 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, 1, 1] [2022-11-25 16:55:51,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:55:51,504 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-25 16:55:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1899666676, now seen corresponding path program 2 times [2022-11-25 16:55:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:51,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421106163] [2022-11-25 16:55:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:55:51,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:55:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:55:51,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:55:51,636 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:55:51,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-25 16:55:51,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-25 16:55:51,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-25 16:55:51,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-25 16:55:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-25 16:55:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-25 16:55:51,641 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-25 16:55:51,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:55:51,642 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:51,649 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:55:51,650 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:55:51,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:55:51 BasicIcfg [2022-11-25 16:55:51,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:55:51,771 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:55:51,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:55:51,773 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:55:51,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:10" (3/4) ... [2022-11-25 16:55:51,776 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 16:55:51,934 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:55:51,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:55:51,935 INFO L158 Benchmark]: Toolchain (without parser) took 43870.12ms. Allocated memory was 203.4MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 155.2MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-25 16:55:51,935 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 134.2MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:55:51,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 829.85ms. Allocated memory is still 203.4MB. Free memory was 155.2MB in the beginning and 127.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 16:55:51,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.65ms. Allocated memory is still 203.4MB. Free memory was 127.9MB in the beginning and 125.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:55:51,937 INFO L158 Benchmark]: Boogie Preprocessor took 40.79ms. Allocated memory is still 203.4MB. Free memory was 124.5MB in the beginning and 123.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:55:51,937 INFO L158 Benchmark]: RCFGBuilder took 1136.42ms. Allocated memory is still 203.4MB. Free memory was 123.1MB in the beginning and 161.1MB in the end (delta: -38.0MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-11-25 16:55:51,937 INFO L158 Benchmark]: TraceAbstraction took 41628.46ms. Allocated memory was 203.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 160.0MB in the beginning and 489.6MB in the end (delta: -329.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-25 16:55:51,938 INFO L158 Benchmark]: Witness Printer took 163.18ms. Allocated memory was 1.6GB in the beginning and 2.2GB in the end (delta: 627.0MB). Free memory was 489.6MB in the beginning and 2.0GB in the end (delta: -1.5GB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-11-25 16:55:51,943 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.37ms. Allocated memory is still 134.2MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 829.85ms. Allocated memory is still 203.4MB. Free memory was 155.2MB in the beginning and 127.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.65ms. Allocated memory is still 203.4MB. Free memory was 127.9MB in the beginning and 125.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.79ms. Allocated memory is still 203.4MB. Free memory was 124.5MB in the beginning and 123.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1136.42ms. Allocated memory is still 203.4MB. Free memory was 123.1MB in the beginning and 161.1MB in the end (delta: -38.0MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41628.46ms. Allocated memory was 203.4MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 160.0MB in the beginning and 489.6MB in the end (delta: -329.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 163.18ms. Allocated memory was 1.6GB in the beginning and 2.2GB in the end (delta: 627.0MB). Free memory was 489.6MB in the beginning and 2.0GB in the end (delta: -1.5GB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 144 PlacesBefore, 41 PlacesAfterwards, 133 TransitionsBefore, 29 TransitionsAfterwards, 3168 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 120 TotalNumberOfCompositions, 7829 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4087, independent: 3877, independent conditional: 0, independent unconditional: 3877, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2344, independent: 2273, independent conditional: 0, independent unconditional: 2273, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2344, independent: 2239, independent conditional: 0, independent unconditional: 2239, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 686, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 592, dependent conditional: 0, dependent unconditional: 592, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4087, independent: 1604, independent conditional: 0, independent unconditional: 1604, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 2344, unknown conditional: 0, unknown unconditional: 2344] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1165; [L847] FCALL, FORK 0 pthread_create(&t1165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1165, ((void *)0), P0, ((void *)0))=-3, t1165={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1166; [L849] FCALL, FORK 0 pthread_create(&t1166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1166, ((void *)0), P1, ((void *)0))=-2, t1165={5:0}, t1166={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1167; [L851] FCALL, FORK 0 pthread_create(&t1167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1167, ((void *)0), P2, ((void *)0))=-1, t1165={5:0}, t1166={6:0}, t1167={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1168; [L853] FCALL, FORK 0 pthread_create(&t1168, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1168, ((void *)0), P3, ((void *)0))=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1165={5:0}, t1166={6:0}, t1167={7:0}, t1168={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 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. - UnprovableResult [Line: 849]: 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: 847]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 locations, 7 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: 41.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 831 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 679 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1520 IncrementalHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 121 mSDtfsCounter, 1520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=10, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 16:55:51,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afabd382-ab0b-427b-9bfd-0a2503cc4ab8/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