./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/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_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/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_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/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 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:19:50,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:19:50,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:19:50,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:19:50,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:19:50,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:19:50,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:19:50,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:19:50,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:19:50,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:19:50,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:19:50,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:19:50,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:19:50,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:19:50,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:19:50,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:19:50,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:19:50,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:19:50,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:19:50,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:19:50,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:19:50,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:19:50,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:19:50,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:19:50,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:19:50,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:19:50,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:19:50,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:19:50,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:19:50,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:19:50,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:19:50,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:19:50,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:19:50,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:19:50,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:19:50,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:19:50,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:19:50,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:19:50,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:19:50,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:19:50,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:19:50,712 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:19:50,753 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:19:50,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:19:50,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:19:50,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:19:50,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:19:50,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:19:50,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:19:50,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:19:50,758 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:19:50,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:19:50,759 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:19:50,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:19:50,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:19:50,760 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:19:50,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:19:50,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:19:50,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:19:50,761 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:19:50,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:19:50,761 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:19:50,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:19:50,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:19:50,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:19:50,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:19:50,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:19:50,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:19:50,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:19:50,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:19:50,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:19:50,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:19:50,764 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:19:50,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:19:50,765 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:19:50,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:19:50,765 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_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/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_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/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 -> 3e08637578a960e5117d483812e56de1a390e4c3bc66da607109cc6e10390727 [2022-11-25 18:19:51,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:19:51,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:19:51,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:19:51,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:19:51,186 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:19:51,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 18:19:54,439 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:19:54,769 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:19:54,769 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 18:19:54,799 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/data/fa25b4282/c960b1c086504a1a80208c634c7b757f/FLAG4ae4d0a60 [2022-11-25 18:19:54,816 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/data/fa25b4282/c960b1c086504a1a80208c634c7b757f [2022-11-25 18:19:54,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:19:54,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:19:54,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:19:54,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:19:54,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:19:54,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:19:54" (1/1) ... [2022-11-25 18:19:54,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c546a7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:54, skipping insertion in model container [2022-11-25 18:19:54,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:19:54" (1/1) ... [2022-11-25 18:19:54,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:19:54,904 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:19:55,113 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_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 18:19:55,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,310 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:19:55,356 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:19:55,369 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_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/sv-benchmarks/c/pthread-wmm/mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-11-25 18:19:55,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:19:55,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:19:55,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:19:55,473 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:19:55,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55 WrapperNode [2022-11-25 18:19:55,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:19:55,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:19:55,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:19:55,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:19:55,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,527 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-25 18:19:55,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:19:55,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:19:55,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:19:55,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:19:55,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,554 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:19:55,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:19:55,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:19:55,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:19:55,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (1/1) ... [2022-11-25 18:19:55,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:19:55,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:55,625 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:19:55,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:19:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:19:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:19:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:19:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:19:55,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:19:55,674 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:19:55,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:19:55,674 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:19:55,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:19:55,674 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:19:55,674 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:19:55,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:19:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:19:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:19:55,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:19:55,677 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:19:55,902 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:19:55,904 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:19:56,194 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:19:56,392 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:19:56,392 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:19:56,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:56 BoogieIcfgContainer [2022-11-25 18:19:56,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:19:56,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:19:56,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:19:56,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:19:56,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:19:54" (1/3) ... [2022-11-25 18:19:56,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63457da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:19:56, skipping insertion in model container [2022-11-25 18:19:56,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:19:55" (2/3) ... [2022-11-25 18:19:56,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63457da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:19:56, skipping insertion in model container [2022-11-25 18:19:56,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:56" (3/3) ... [2022-11-25 18:19:56,404 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-11-25 18:19:56,433 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 18:19:56,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:19:56,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 18:19:56,444 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:19:56,506 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:19:56,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-25 18:19:56,632 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-25 18:19:56,633 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:19:56,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 18:19:56,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-25 18:19:56,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-25 18:19:56,651 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:19:56,674 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2022-11-25 18:19:56,677 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2022-11-25 18:19:56,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2022-11-25 18:19:56,711 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-25 18:19:56,711 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:19:56,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 18:19:56,714 INFO L119 LiptonReduction]: Number of co-enabled transitions 2128 [2022-11-25 18:20:01,661 INFO L134 LiptonReduction]: Checked pairs total: 5500 [2022-11-25 18:20:01,661 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-11-25 18:20:01,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:20:01,683 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;@386cb121, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:20:01,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 18:20:01,689 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-11-25 18:20:01,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:20:01,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:01,690 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:01,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:01,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1794053703, now seen corresponding path program 1 times [2022-11-25 18:20:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:01,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183404212] [2022-11-25 18:20:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:01,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:02,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183404212] [2022-11-25 18:20:02,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183404212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:02,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:02,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:20:02,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798677322] [2022-11-25 18:20:02,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:02,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:20:02,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:20:02,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:20:02,234 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 220 [2022-11-25 18:20:02,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:02,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:02,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 220 [2022-11-25 18:20:02,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:02,524 INFO L130 PetriNetUnfolder]: 777/1248 cut-off events. [2022-11-25 18:20:02,525 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-25 18:20:02,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2453 conditions, 1248 events. 777/1248 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6132 event pairs, 129 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 2442. Up to 937 conditions per place. [2022-11-25 18:20:02,535 INFO L137 encePairwiseOnDemand]: 216/220 looper letters, 26 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2022-11-25 18:20:02,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 135 flow [2022-11-25 18:20:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:20:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:20:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2022-11-25 18:20:02,552 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-11-25 18:20:02,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2022-11-25 18:20:02,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2022-11-25 18:20:02,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:02,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2022-11-25 18:20:02,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:02,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:02,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:02,571 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 345 transitions. [2022-11-25 18:20:02,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 135 flow [2022-11-25 18:20:02,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:20:02,576 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-25 18:20:02,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 18:20:02,582 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-25 18:20:02,583 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-25 18:20:02,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:02,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:02,583 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:02,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:20:02,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 82646812, now seen corresponding path program 1 times [2022-11-25 18:20:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:02,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414493979] [2022-11-25 18:20:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:03,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414493979] [2022-11-25 18:20:03,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414493979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:03,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:03,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:20:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350497604] [2022-11-25 18:20:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:03,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:03,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:03,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 220 [2022-11-25 18:20:03,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:03,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:03,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 220 [2022-11-25 18:20:03,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:04,691 INFO L130 PetriNetUnfolder]: 1612/2579 cut-off events. [2022-11-25 18:20:04,691 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-11-25 18:20:04,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 2579 events. 1612/2579 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13835 event pairs, 141 based on Foata normal form. 142/2721 useless extension candidates. Maximal degree in co-relation 5232. Up to 1571 conditions per place. [2022-11-25 18:20:04,707 INFO L137 encePairwiseOnDemand]: 209/220 looper letters, 38 selfloop transitions, 11 changer transitions 30/80 dead transitions. [2022-11-25 18:20:04,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 80 transitions, 344 flow [2022-11-25 18:20:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 733 transitions. [2022-11-25 18:20:04,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.475974025974026 [2022-11-25 18:20:04,716 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 733 transitions. [2022-11-25 18:20:04,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 733 transitions. [2022-11-25 18:20:04,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:04,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 733 transitions. [2022-11-25 18:20:04,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:04,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:04,734 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:04,734 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 7 states and 733 transitions. [2022-11-25 18:20:04,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 80 transitions, 344 flow [2022-11-25 18:20:04,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 80 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:20:04,736 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 136 flow [2022-11-25 18:20:04,737 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-11-25 18:20:04,738 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-11-25 18:20:04,738 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 136 flow [2022-11-25 18:20:04,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:04,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:04,739 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:04,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:20:04,739 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:04,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1732935503, now seen corresponding path program 1 times [2022-11-25 18:20:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:04,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860829853] [2022-11-25 18:20:04,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:05,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860829853] [2022-11-25 18:20:05,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860829853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:05,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:05,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:20:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688164347] [2022-11-25 18:20:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:05,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:05,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:05,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:05,847 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 220 [2022-11-25 18:20:05,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:05,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:05,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 220 [2022-11-25 18:20:05,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:06,464 INFO L130 PetriNetUnfolder]: 1369/2140 cut-off events. [2022-11-25 18:20:06,465 INFO L131 PetriNetUnfolder]: For 1773/1773 co-relation queries the response was YES. [2022-11-25 18:20:06,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6593 conditions, 2140 events. 1369/2140 cut-off events. For 1773/1773 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10365 event pairs, 313 based on Foata normal form. 120/2258 useless extension candidates. Maximal degree in co-relation 6578. Up to 1085 conditions per place. [2022-11-25 18:20:06,480 INFO L137 encePairwiseOnDemand]: 210/220 looper letters, 38 selfloop transitions, 10 changer transitions 27/76 dead transitions. [2022-11-25 18:20:06,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 465 flow [2022-11-25 18:20:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 717 transitions. [2022-11-25 18:20:06,483 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4655844155844156 [2022-11-25 18:20:06,484 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 717 transitions. [2022-11-25 18:20:06,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 717 transitions. [2022-11-25 18:20:06,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:06,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 717 transitions. [2022-11-25 18:20:06,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:06,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:06,492 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:06,492 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 136 flow. Second operand 7 states and 717 transitions. [2022-11-25 18:20:06,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 465 flow [2022-11-25 18:20:06,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 76 transitions, 457 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 18:20:06,510 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 220 flow [2022-11-25 18:20:06,510 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-11-25 18:20:06,511 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-11-25 18:20:06,512 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 220 flow [2022-11-25 18:20:06,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:06,513 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:06,513 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:06,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:20:06,514 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:06,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1443123832, now seen corresponding path program 1 times [2022-11-25 18:20:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:06,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329539553] [2022-11-25 18:20:06,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:07,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329539553] [2022-11-25 18:20:07,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329539553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:07,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:07,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:07,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804065985] [2022-11-25 18:20:07,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:07,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:20:07,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:07,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:20:07,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:20:07,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 220 [2022-11-25 18:20:07,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:07,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:07,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 220 [2022-11-25 18:20:07,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:07,689 INFO L130 PetriNetUnfolder]: 1348/2175 cut-off events. [2022-11-25 18:20:07,689 INFO L131 PetriNetUnfolder]: For 3542/3582 co-relation queries the response was YES. [2022-11-25 18:20:07,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 2175 events. 1348/2175 cut-off events. For 3542/3582 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10877 event pairs, 396 based on Foata normal form. 125/2298 useless extension candidates. Maximal degree in co-relation 7297. Up to 1482 conditions per place. [2022-11-25 18:20:07,708 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 50 selfloop transitions, 7 changer transitions 17/80 dead transitions. [2022-11-25 18:20:07,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 577 flow [2022-11-25 18:20:07,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:20:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:20:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 665 transitions. [2022-11-25 18:20:07,712 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2022-11-25 18:20:07,712 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 665 transitions. [2022-11-25 18:20:07,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 665 transitions. [2022-11-25 18:20:07,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:07,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 665 transitions. [2022-11-25 18:20:07,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:07,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:07,721 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:07,721 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 220 flow. Second operand 6 states and 665 transitions. [2022-11-25 18:20:07,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 577 flow [2022-11-25 18:20:07,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 566 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 18:20:07,748 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 284 flow [2022-11-25 18:20:07,748 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=6, PETRI_FLOW=284, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-11-25 18:20:07,750 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-25 18:20:07,750 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 284 flow [2022-11-25 18:20:07,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:07,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:07,751 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:07,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:20:07,752 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash -364469878, now seen corresponding path program 1 times [2022-11-25 18:20:07,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:07,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975310029] [2022-11-25 18:20:07,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:08,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:08,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975310029] [2022-11-25 18:20:08,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975310029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:08,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:08,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308926365] [2022-11-25 18:20:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:08,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:20:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:20:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:20:08,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 220 [2022-11-25 18:20:08,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 284 flow. Second operand has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 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 18:20:08,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:08,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 220 [2022-11-25 18:20:08,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:08,983 INFO L130 PetriNetUnfolder]: 1568/2470 cut-off events. [2022-11-25 18:20:08,983 INFO L131 PetriNetUnfolder]: For 4466/4566 co-relation queries the response was YES. [2022-11-25 18:20:08,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9189 conditions, 2470 events. 1568/2470 cut-off events. For 4466/4566 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12521 event pairs, 729 based on Foata normal form. 149/2615 useless extension candidates. Maximal degree in co-relation 9164. Up to 1791 conditions per place. [2022-11-25 18:20:09,009 INFO L137 encePairwiseOnDemand]: 212/220 looper letters, 49 selfloop transitions, 20 changer transitions 15/90 dead transitions. [2022-11-25 18:20:09,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 90 transitions, 771 flow [2022-11-25 18:20:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:09,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2022-11-25 18:20:09,012 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.488961038961039 [2022-11-25 18:20:09,013 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions. [2022-11-25 18:20:09,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions. [2022-11-25 18:20:09,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:09,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions. [2022-11-25 18:20:09,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:09,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:09,020 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:09,020 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 284 flow. Second operand 7 states and 753 transitions. [2022-11-25 18:20:09,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 90 transitions, 771 flow [2022-11-25 18:20:09,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 757 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-25 18:20:09,070 INFO L231 Difference]: Finished difference. Result has 56 places, 58 transitions, 500 flow [2022-11-25 18:20:09,071 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=56, PETRI_TRANSITIONS=58} [2022-11-25 18:20:09,072 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-11-25 18:20:09,072 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 58 transitions, 500 flow [2022-11-25 18:20:09,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.33333333333333) internal successors, (614), 6 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 18:20:09,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:09,073 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:09,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:20:09,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:09,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1104523158, now seen corresponding path program 2 times [2022-11-25 18:20:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:09,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323399006] [2022-11-25 18:20:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:09,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323399006] [2022-11-25 18:20:09,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323399006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:09,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:09,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007306601] [2022-11-25 18:20:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:20:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:20:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:20:09,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 220 [2022-11-25 18:20:09,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 58 transitions, 500 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:09,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:09,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 220 [2022-11-25 18:20:09,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:10,338 INFO L130 PetriNetUnfolder]: 1593/2516 cut-off events. [2022-11-25 18:20:10,339 INFO L131 PetriNetUnfolder]: For 7549/7746 co-relation queries the response was YES. [2022-11-25 18:20:10,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10735 conditions, 2516 events. 1593/2516 cut-off events. For 7549/7746 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12771 event pairs, 314 based on Foata normal form. 144/2652 useless extension candidates. Maximal degree in co-relation 10707. Up to 1780 conditions per place. [2022-11-25 18:20:10,364 INFO L137 encePairwiseOnDemand]: 213/220 looper letters, 63 selfloop transitions, 24 changer transitions 15/108 dead transitions. [2022-11-25 18:20:10,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 108 transitions, 1049 flow [2022-11-25 18:20:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 755 transitions. [2022-11-25 18:20:10,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4902597402597403 [2022-11-25 18:20:10,367 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 755 transitions. [2022-11-25 18:20:10,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 755 transitions. [2022-11-25 18:20:10,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:10,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 755 transitions. [2022-11-25 18:20:10,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:10,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:10,374 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:10,374 INFO L175 Difference]: Start difference. First operand has 56 places, 58 transitions, 500 flow. Second operand 7 states and 755 transitions. [2022-11-25 18:20:10,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 108 transitions, 1049 flow [2022-11-25 18:20:10,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 108 transitions, 1024 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-25 18:20:10,407 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 682 flow [2022-11-25 18:20:10,407 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=682, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2022-11-25 18:20:10,408 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2022-11-25 18:20:10,408 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 682 flow [2022-11-25 18:20:10,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:10,409 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:10,409 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:10,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:20:10,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:10,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash -318831988, now seen corresponding path program 3 times [2022-11-25 18:20:10,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:10,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094095514] [2022-11-25 18:20:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:10,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:10,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094095514] [2022-11-25 18:20:10,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094095514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:10,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:10,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931388716] [2022-11-25 18:20:10,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:10,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:20:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:20:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:20:10,795 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2022-11-25 18:20:10,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 682 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:10,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:10,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2022-11-25 18:20:10,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:11,479 INFO L130 PetriNetUnfolder]: 1612/2552 cut-off events. [2022-11-25 18:20:11,479 INFO L131 PetriNetUnfolder]: For 10246/10455 co-relation queries the response was YES. [2022-11-25 18:20:11,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11755 conditions, 2552 events. 1612/2552 cut-off events. For 10246/10455 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13131 event pairs, 258 based on Foata normal form. 255/2805 useless extension candidates. Maximal degree in co-relation 11724. Up to 1631 conditions per place. [2022-11-25 18:20:11,522 INFO L137 encePairwiseOnDemand]: 212/220 looper letters, 61 selfloop transitions, 32 changer transitions 9/108 dead transitions. [2022-11-25 18:20:11,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 108 transitions, 1150 flow [2022-11-25 18:20:11,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2022-11-25 18:20:11,526 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4844155844155844 [2022-11-25 18:20:11,526 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2022-11-25 18:20:11,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2022-11-25 18:20:11,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:11,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2022-11-25 18:20:11,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:11,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:11,534 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:11,534 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 682 flow. Second operand 7 states and 746 transitions. [2022-11-25 18:20:11,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 108 transitions, 1150 flow [2022-11-25 18:20:11,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 108 transitions, 1110 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-11-25 18:20:11,579 INFO L231 Difference]: Finished difference. Result has 65 places, 78 transitions, 847 flow [2022-11-25 18:20:11,580 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=65, PETRI_TRANSITIONS=78} [2022-11-25 18:20:11,581 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-11-25 18:20:11,581 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 78 transitions, 847 flow [2022-11-25 18:20:11,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:11,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:11,582 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:11,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:20:11,582 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:11,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:11,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1824132778, now seen corresponding path program 4 times [2022-11-25 18:20:11,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:11,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132368686] [2022-11-25 18:20:11,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:11,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:12,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132368686] [2022-11-25 18:20:12,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132368686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:12,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:12,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597552261] [2022-11-25 18:20:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:12,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:20:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:20:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:20:12,887 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 220 [2022-11-25 18:20:12,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 78 transitions, 847 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:12,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:12,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 220 [2022-11-25 18:20:12,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:13,871 INFO L130 PetriNetUnfolder]: 2233/3472 cut-off events. [2022-11-25 18:20:13,871 INFO L131 PetriNetUnfolder]: For 14487/14487 co-relation queries the response was YES. [2022-11-25 18:20:13,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16343 conditions, 3472 events. 2233/3472 cut-off events. For 14487/14487 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 17736 event pairs, 157 based on Foata normal form. 144/3616 useless extension candidates. Maximal degree in co-relation 16310. Up to 1499 conditions per place. [2022-11-25 18:20:13,904 INFO L137 encePairwiseOnDemand]: 209/220 looper letters, 78 selfloop transitions, 62 changer transitions 34/174 dead transitions. [2022-11-25 18:20:13,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 174 transitions, 1892 flow [2022-11-25 18:20:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:20:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 18:20:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1105 transitions. [2022-11-25 18:20:13,908 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45661157024793386 [2022-11-25 18:20:13,908 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1105 transitions. [2022-11-25 18:20:13,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1105 transitions. [2022-11-25 18:20:13,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:13,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1105 transitions. [2022-11-25 18:20:13,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.45454545454545) internal successors, (1105), 11 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:13,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:13,918 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 220.0) internal successors, (2640), 12 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:13,918 INFO L175 Difference]: Start difference. First operand has 65 places, 78 transitions, 847 flow. Second operand 11 states and 1105 transitions. [2022-11-25 18:20:13,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 174 transitions, 1892 flow [2022-11-25 18:20:13,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 174 transitions, 1865 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 18:20:13,983 INFO L231 Difference]: Finished difference. Result has 78 places, 101 transitions, 1318 flow [2022-11-25 18:20:13,983 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1318, PETRI_PLACES=78, PETRI_TRANSITIONS=101} [2022-11-25 18:20:13,986 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 44 predicate places. [2022-11-25 18:20:13,986 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 101 transitions, 1318 flow [2022-11-25 18:20:13,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:13,987 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:13,987 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:13,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:20:13,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash -671568895, now seen corresponding path program 1 times [2022-11-25 18:20:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:13,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806006585] [2022-11-25 18:20:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806006585] [2022-11-25 18:20:14,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806006585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:14,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:14,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:20:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943555846] [2022-11-25 18:20:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:20:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:20:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:20:14,808 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 220 [2022-11-25 18:20:14,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 101 transitions, 1318 flow. Second operand has 8 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:14,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:14,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 220 [2022-11-25 18:20:14,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:15,574 INFO L130 PetriNetUnfolder]: 1942/3122 cut-off events. [2022-11-25 18:20:15,574 INFO L131 PetriNetUnfolder]: For 24609/24750 co-relation queries the response was YES. [2022-11-25 18:20:15,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17324 conditions, 3122 events. 1942/3122 cut-off events. For 24609/24750 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17088 event pairs, 410 based on Foata normal form. 102/3198 useless extension candidates. Maximal degree in co-relation 17285. Up to 2179 conditions per place. [2022-11-25 18:20:15,611 INFO L137 encePairwiseOnDemand]: 212/220 looper letters, 87 selfloop transitions, 26 changer transitions 7/131 dead transitions. [2022-11-25 18:20:15,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 131 transitions, 1778 flow [2022-11-25 18:20:15,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:20:15,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:20:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions. [2022-11-25 18:20:15,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49318181818181817 [2022-11-25 18:20:15,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 651 transitions. [2022-11-25 18:20:15,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions. [2022-11-25 18:20:15,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:15,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions. [2022-11-25 18:20:15,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:15,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:15,620 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:15,620 INFO L175 Difference]: Start difference. First operand has 78 places, 101 transitions, 1318 flow. Second operand 6 states and 651 transitions. [2022-11-25 18:20:15,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 131 transitions, 1778 flow [2022-11-25 18:20:15,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 131 transitions, 1690 flow, removed 24 selfloop flow, removed 5 redundant places. [2022-11-25 18:20:15,719 INFO L231 Difference]: Finished difference. Result has 77 places, 106 transitions, 1387 flow [2022-11-25 18:20:15,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1387, PETRI_PLACES=77, PETRI_TRANSITIONS=106} [2022-11-25 18:20:15,720 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2022-11-25 18:20:15,720 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 106 transitions, 1387 flow [2022-11-25 18:20:15,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:15,723 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:15,723 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:15,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:20:15,725 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:15,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1680065465, now seen corresponding path program 2 times [2022-11-25 18:20:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:15,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885621427] [2022-11-25 18:20:15,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:16,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:16,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885621427] [2022-11-25 18:20:16,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885621427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:16,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:16,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:20:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919877538] [2022-11-25 18:20:16,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:16,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:20:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:16,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:20:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:20:16,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 220 [2022-11-25 18:20:16,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 106 transitions, 1387 flow. Second operand has 8 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:16,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:16,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 220 [2022-11-25 18:20:16,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:17,527 INFO L130 PetriNetUnfolder]: 1887/3038 cut-off events. [2022-11-25 18:20:17,527 INFO L131 PetriNetUnfolder]: For 22008/22076 co-relation queries the response was YES. [2022-11-25 18:20:17,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16522 conditions, 3038 events. 1887/3038 cut-off events. For 22008/22076 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 16391 event pairs, 411 based on Foata normal form. 85/3118 useless extension candidates. Maximal degree in co-relation 16483. Up to 1386 conditions per place. [2022-11-25 18:20:17,562 INFO L137 encePairwiseOnDemand]: 212/220 looper letters, 88 selfloop transitions, 34 changer transitions 10/143 dead transitions. [2022-11-25 18:20:17,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 143 transitions, 1923 flow [2022-11-25 18:20:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 755 transitions. [2022-11-25 18:20:17,566 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4902597402597403 [2022-11-25 18:20:17,566 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 755 transitions. [2022-11-25 18:20:17,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 755 transitions. [2022-11-25 18:20:17,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:17,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 755 transitions. [2022-11-25 18:20:17,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:17,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:17,572 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:17,572 INFO L175 Difference]: Start difference. First operand has 77 places, 106 transitions, 1387 flow. Second operand 7 states and 755 transitions. [2022-11-25 18:20:17,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 143 transitions, 1923 flow [2022-11-25 18:20:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 143 transitions, 1835 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-25 18:20:17,661 INFO L231 Difference]: Finished difference. Result has 81 places, 106 transitions, 1404 flow [2022-11-25 18:20:17,662 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1404, PETRI_PLACES=81, PETRI_TRANSITIONS=106} [2022-11-25 18:20:17,663 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 47 predicate places. [2022-11-25 18:20:17,663 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 106 transitions, 1404 flow [2022-11-25 18:20:17,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:17,664 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:17,664 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:17,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:20:17,664 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:17,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1293613101, now seen corresponding path program 1 times [2022-11-25 18:20:17,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:17,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006525082] [2022-11-25 18:20:17,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:17,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:17,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:17,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006525082] [2022-11-25 18:20:17,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006525082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:17,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:17,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:20:17,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406690190] [2022-11-25 18:20:17,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:17,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:20:17,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:20:17,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:20:17,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2022-11-25 18:20:17,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 106 transitions, 1404 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:17,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:17,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2022-11-25 18:20:17,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:18,392 INFO L130 PetriNetUnfolder]: 1245/2138 cut-off events. [2022-11-25 18:20:18,392 INFO L131 PetriNetUnfolder]: For 20196/20473 co-relation queries the response was YES. [2022-11-25 18:20:18,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11759 conditions, 2138 events. 1245/2138 cut-off events. For 20196/20473 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 12609 event pairs, 168 based on Foata normal form. 463/2561 useless extension candidates. Maximal degree in co-relation 11718. Up to 1020 conditions per place. [2022-11-25 18:20:18,416 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 165 selfloop transitions, 5 changer transitions 0/187 dead transitions. [2022-11-25 18:20:18,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 187 transitions, 2822 flow [2022-11-25 18:20:18,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:20:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:20:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2022-11-25 18:20:18,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 18:20:18,419 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2022-11-25 18:20:18,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2022-11-25 18:20:18,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:18,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2022-11-25 18:20:18,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:18,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:18,423 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 220.0) internal successors, (1100), 5 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:18,423 INFO L175 Difference]: Start difference. First operand has 81 places, 106 transitions, 1404 flow. Second operand 4 states and 440 transitions. [2022-11-25 18:20:18,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 187 transitions, 2822 flow [2022-11-25 18:20:18,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 187 transitions, 2642 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-11-25 18:20:18,472 INFO L231 Difference]: Finished difference. Result has 76 places, 101 transitions, 1255 flow [2022-11-25 18:20:18,472 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1255, PETRI_PLACES=76, PETRI_TRANSITIONS=101} [2022-11-25 18:20:18,473 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2022-11-25 18:20:18,473 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 101 transitions, 1255 flow [2022-11-25 18:20:18,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:18,474 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:18,474 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:18,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:20:18,474 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash -933106492, now seen corresponding path program 1 times [2022-11-25 18:20:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:18,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959335460] [2022-11-25 18:20:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:18,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:18,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:18,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959335460] [2022-11-25 18:20:18,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959335460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:18,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:18,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:20:18,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250751742] [2022-11-25 18:20:18,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:18,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:20:18,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:18,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:20:18,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:20:18,683 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2022-11-25 18:20:18,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 101 transitions, 1255 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:18,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:18,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2022-11-25 18:20:18,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:19,080 INFO L130 PetriNetUnfolder]: 930/1670 cut-off events. [2022-11-25 18:20:19,080 INFO L131 PetriNetUnfolder]: For 14507/14873 co-relation queries the response was YES. [2022-11-25 18:20:19,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9571 conditions, 1670 events. 930/1670 cut-off events. For 14507/14873 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 9936 event pairs, 147 based on Foata normal form. 385/2025 useless extension candidates. Maximal degree in co-relation 9532. Up to 748 conditions per place. [2022-11-25 18:20:19,095 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 151 selfloop transitions, 8 changer transitions 0/176 dead transitions. [2022-11-25 18:20:19,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 176 transitions, 2439 flow [2022-11-25 18:20:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:20:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:20:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-11-25 18:20:19,098 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5009090909090909 [2022-11-25 18:20:19,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-11-25 18:20:19,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-11-25 18:20:19,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:19,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-11-25 18:20:19,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:19,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:19,103 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:19,103 INFO L175 Difference]: Start difference. First operand has 76 places, 101 transitions, 1255 flow. Second operand 5 states and 551 transitions. [2022-11-25 18:20:19,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 176 transitions, 2439 flow [2022-11-25 18:20:19,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 176 transitions, 2369 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-11-25 18:20:19,135 INFO L231 Difference]: Finished difference. Result has 77 places, 90 transitions, 1079 flow [2022-11-25 18:20:19,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1079, PETRI_PLACES=77, PETRI_TRANSITIONS=90} [2022-11-25 18:20:19,136 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2022-11-25 18:20:19,136 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 90 transitions, 1079 flow [2022-11-25 18:20:19,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:19,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:19,137 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:19,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:20:19,137 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:19,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash -131617286, now seen corresponding path program 1 times [2022-11-25 18:20:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:19,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647983375] [2022-11-25 18:20:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:19,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:19,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647983375] [2022-11-25 18:20:19,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647983375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:19,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:19,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304319026] [2022-11-25 18:20:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:19,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:20:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:20:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:20:20,048 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 220 [2022-11-25 18:20:20,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 90 transitions, 1079 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:20,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:20,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 220 [2022-11-25 18:20:20,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:20,793 INFO L130 PetriNetUnfolder]: 1526/2692 cut-off events. [2022-11-25 18:20:20,794 INFO L131 PetriNetUnfolder]: For 19352/19478 co-relation queries the response was YES. [2022-11-25 18:20:20,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16500 conditions, 2692 events. 1526/2692 cut-off events. For 19352/19478 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16401 event pairs, 113 based on Foata normal form. 127/2804 useless extension candidates. Maximal degree in co-relation 16460. Up to 1080 conditions per place. [2022-11-25 18:20:20,819 INFO L137 encePairwiseOnDemand]: 208/220 looper letters, 74 selfloop transitions, 20 changer transitions 99/198 dead transitions. [2022-11-25 18:20:20,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 198 transitions, 2601 flow [2022-11-25 18:20:20,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:20:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:20:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 712 transitions. [2022-11-25 18:20:20,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4623376623376623 [2022-11-25 18:20:20,823 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 712 transitions. [2022-11-25 18:20:20,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 712 transitions. [2022-11-25 18:20:20,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:20,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 712 transitions. [2022-11-25 18:20:20,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 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 18:20:20,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:20,829 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 220.0) internal successors, (1760), 8 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:20,829 INFO L175 Difference]: Start difference. First operand has 77 places, 90 transitions, 1079 flow. Second operand 7 states and 712 transitions. [2022-11-25 18:20:20,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 198 transitions, 2601 flow [2022-11-25 18:20:20,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 198 transitions, 2542 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-11-25 18:20:20,905 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 873 flow [2022-11-25 18:20:20,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=873, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2022-11-25 18:20:20,906 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2022-11-25 18:20:20,907 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 873 flow [2022-11-25 18:20:20,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:20,908 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:20,908 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:20,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:20:20,908 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:20,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -868018632, now seen corresponding path program 2 times [2022-11-25 18:20:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:20,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247264377] [2022-11-25 18:20:20,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:20,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:21,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:21,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247264377] [2022-11-25 18:20:21,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247264377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:21,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:21,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:20:21,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059815575] [2022-11-25 18:20:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:21,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:20:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:20:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:20:21,074 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 220 [2022-11-25 18:20:21,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 873 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:21,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 220 [2022-11-25 18:20:21,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:21,375 INFO L130 PetriNetUnfolder]: 705/1389 cut-off events. [2022-11-25 18:20:21,375 INFO L131 PetriNetUnfolder]: For 10881/10958 co-relation queries the response was YES. [2022-11-25 18:20:21,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8367 conditions, 1389 events. 705/1389 cut-off events. For 10881/10958 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8432 event pairs, 252 based on Foata normal form. 79/1453 useless extension candidates. Maximal degree in co-relation 8326. Up to 699 conditions per place. [2022-11-25 18:20:21,385 INFO L137 encePairwiseOnDemand]: 216/220 looper letters, 53 selfloop transitions, 5 changer transitions 38/100 dead transitions. [2022-11-25 18:20:21,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 100 transitions, 1340 flow [2022-11-25 18:20:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:20:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:20:21,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2022-11-25 18:20:21,388 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49454545454545457 [2022-11-25 18:20:21,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2022-11-25 18:20:21,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2022-11-25 18:20:21,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:21,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2022-11-25 18:20:21,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,393 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,393 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 873 flow. Second operand 5 states and 544 transitions. [2022-11-25 18:20:21,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 100 transitions, 1340 flow [2022-11-25 18:20:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 1230 flow, removed 14 selfloop flow, removed 10 redundant places. [2022-11-25 18:20:21,420 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 544 flow [2022-11-25 18:20:21,420 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=544, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2022-11-25 18:20:21,421 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2022-11-25 18:20:21,421 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 544 flow [2022-11-25 18:20:21,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:21,422 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 18:20:21,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:20:21,422 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash -987260313, now seen corresponding path program 1 times [2022-11-25 18:20:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:21,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855484485] [2022-11-25 18:20:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:21,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:20:21,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:21,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855484485] [2022-11-25 18:20:21,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855484485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:20:21,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:20:21,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:20:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204835990] [2022-11-25 18:20:21,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:20:21,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:20:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:20:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:20:21,656 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 220 [2022-11-25 18:20:21,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 54 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:20:21,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 220 [2022-11-25 18:20:21,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:20:21,892 INFO L130 PetriNetUnfolder]: 445/916 cut-off events. [2022-11-25 18:20:21,892 INFO L131 PetriNetUnfolder]: For 5426/5561 co-relation queries the response was YES. [2022-11-25 18:20:21,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4673 conditions, 916 events. 445/916 cut-off events. For 5426/5561 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5487 event pairs, 117 based on Foata normal form. 152/1060 useless extension candidates. Maximal degree in co-relation 4642. Up to 355 conditions per place. [2022-11-25 18:20:21,897 INFO L137 encePairwiseOnDemand]: 214/220 looper letters, 33 selfloop transitions, 11 changer transitions 26/74 dead transitions. [2022-11-25 18:20:21,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 869 flow [2022-11-25 18:20:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:20:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:20:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 636 transitions. [2022-11-25 18:20:21,900 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2022-11-25 18:20:21,900 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 636 transitions. [2022-11-25 18:20:21,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 636 transitions. [2022-11-25 18:20:21,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:20:21,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 636 transitions. [2022-11-25 18:20:21,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,905 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 220.0) internal successors, (1540), 7 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,905 INFO L175 Difference]: Start difference. First operand has 77 places, 54 transitions, 544 flow. Second operand 6 states and 636 transitions. [2022-11-25 18:20:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 869 flow [2022-11-25 18:20:21,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 770 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-11-25 18:20:21,918 INFO L231 Difference]: Finished difference. Result has 74 places, 34 transitions, 312 flow [2022-11-25 18:20:21,918 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=74, PETRI_TRANSITIONS=34} [2022-11-25 18:20:21,918 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2022-11-25 18:20:21,918 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 34 transitions, 312 flow [2022-11-25 18:20:21,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:20:21,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:20:21,919 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 18:20:21,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:20:21,920 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 18:20:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:21,920 INFO L85 PathProgramCache]: Analyzing trace with hash -763863524, now seen corresponding path program 1 times [2022-11-25 18:20:21,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:21,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377441135] [2022-11-25 18:20:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:21,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:20:21,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:20:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:20:22,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:20:22,069 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:20:22,072 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 18:20:22,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 18:20:22,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 18:20:22,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 18:20:22,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 18:20:22,078 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 18:20:22,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:20:22,079 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:22,087 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:20:22,087 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:20:22,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:20:22 BasicIcfg [2022-11-25 18:20:22,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:20:22,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:20:22,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:20:22,190 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:20:22,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:19:56" (3/4) ... [2022-11-25 18:20:22,193 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 18:20:22,263 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:20:22,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:20:22,264 INFO L158 Benchmark]: Toolchain (without parser) took 27442.19ms. Allocated memory was 148.9MB in the beginning and 528.5MB in the end (delta: 379.6MB). Free memory was 114.3MB in the beginning and 180.9MB in the end (delta: -66.6MB). Peak memory consumption was 315.2MB. Max. memory is 16.1GB. [2022-11-25 18:20:22,265 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 148.9MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:20:22,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 647.50ms. Allocated memory is still 148.9MB. Free memory was 114.3MB in the beginning and 88.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 18:20:22,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 148.9MB. Free memory was 88.2MB in the beginning and 85.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:20:22,266 INFO L158 Benchmark]: Boogie Preprocessor took 31.12ms. Allocated memory is still 148.9MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:20:22,266 INFO L158 Benchmark]: RCFGBuilder took 835.22ms. Allocated memory is still 148.9MB. Free memory was 83.5MB in the beginning and 116.0MB in the end (delta: -32.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-11-25 18:20:22,267 INFO L158 Benchmark]: TraceAbstraction took 25791.45ms. Allocated memory was 148.9MB in the beginning and 528.5MB in the end (delta: 379.6MB). Free memory was 115.3MB in the beginning and 191.4MB in the end (delta: -76.1MB). Peak memory consumption was 304.0MB. Max. memory is 16.1GB. [2022-11-25 18:20:22,267 INFO L158 Benchmark]: Witness Printer took 74.46ms. Allocated memory is still 528.5MB. Free memory was 191.4MB in the beginning and 180.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 18:20:22,269 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.24ms. Allocated memory is still 148.9MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 647.50ms. Allocated memory is still 148.9MB. Free memory was 114.3MB in the beginning and 88.2MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 148.9MB. Free memory was 88.2MB in the beginning and 85.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.12ms. Allocated memory is still 148.9MB. Free memory was 85.0MB in the beginning and 83.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 835.22ms. Allocated memory is still 148.9MB. Free memory was 83.5MB in the beginning and 116.0MB in the end (delta: -32.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25791.45ms. Allocated memory was 148.9MB in the beginning and 528.5MB in the end (delta: 379.6MB). Free memory was 115.3MB in the beginning and 191.4MB in the end (delta: -76.1MB). Peak memory consumption was 304.0MB. Max. memory is 16.1GB. * Witness Printer took 74.46ms. Allocated memory is still 528.5MB. Free memory was 191.4MB in the beginning and 180.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 122 PlacesBefore, 34 PlacesAfterwards, 114 TransitionsBefore, 25 TransitionsAfterwards, 2128 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 103 TotalNumberOfCompositions, 5500 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2867, independent: 2695, independent conditional: 0, independent unconditional: 2695, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1598, independent: 1552, independent conditional: 0, independent unconditional: 1552, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1598, independent: 1536, independent conditional: 0, independent unconditional: 1536, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 336, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2867, independent: 1143, independent conditional: 0, independent unconditional: 1143, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1598, unknown conditional: 0, unknown unconditional: 1598] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1196, ((void *)0), P0, ((void *)0))=-1, t1196={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1197, ((void *)0), P1, ((void *)0))=0, t1196={5:0}, t1197={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1198, ((void *)0), P2, ((void *)0))=1, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L784] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L784] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1196={5:0}, t1197={6:0}, t1198={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: 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: 824]: 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: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 853 mSDsluCounter, 696 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 581 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2063 IncrementalHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 115 mSDtfsCounter, 2063 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1404occurred in iteration=10, InterpolantAutomatonStates: 95, 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.5s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 18:20:22,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c8b7737a-4df2-43ee-a16d-8a7d44e038b9/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