./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8 --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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --- 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-2329fc7 [2022-12-13 19:45:24,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:45:24,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:45:24,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:45:24,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:45:24,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:45:24,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:45:24,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:45:24,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:45:24,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:45:24,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:45:24,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:45:24,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:45:24,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:45:24,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:45:24,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:45:24,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:45:24,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:45:24,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:45:24,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:45:24,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:45:24,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:45:24,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:45:24,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:45:24,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:45:24,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:45:24,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:45:24,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:45:24,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:45:24,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:45:24,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:45:24,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:45:24,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:45:24,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:45:24,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:45:24,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:45:24,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:45:24,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:45:24,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:45:24,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:45:24,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:45:24,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 19:45:24,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:45:24,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:45:24,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:45:24,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:45:24,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:45:24,554 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:45:24,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:45:24,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:45:24,555 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:45:24,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:45:24,555 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:45:24,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:45:24,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:45:24,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:45:24,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 19:45:24,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:45:24,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 19:45:24,556 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:45:24,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:45:24,556 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:45:24,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 19:45:24,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:45:24,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:45:24,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:45:24,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 19:45:24,557 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:45:24,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:45:24,558 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:45:24,558 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_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/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_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8 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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a [2022-12-13 19:45:24,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:45:24,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:45:24,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:45:24,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:45:24,737 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:45:24,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2022-12-13 19:45:27,400 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:45:27,622 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:45:27,622 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2022-12-13 19:45:27,631 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/data/2367b2a93/1f08b07183a840d39e8aa0a6103b0c24/FLAGedab4850b [2022-12-13 19:45:27,643 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/data/2367b2a93/1f08b07183a840d39e8aa0a6103b0c24 [2022-12-13 19:45:27,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:45:27,646 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:45:27,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:45:27,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:45:27,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:45:27,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:45:27" (1/1) ... [2022-12-13 19:45:27,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7ebb8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:27, skipping insertion in model container [2022-12-13 19:45:27,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:45:27" (1/1) ... [2022-12-13 19:45:27,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:45:27,684 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:45:27,796 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_74f76943-7222-4779-aa54-071d3fc77809/sv-benchmarks/c/pthread-wmm/mix010.opt.i[944,957] [2022-12-13 19:45:27,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,934 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:45:27,943 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:45:27,952 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_74f76943-7222-4779-aa54-071d3fc77809/sv-benchmarks/c/pthread-wmm/mix010.opt.i[944,957] [2022-12-13 19:45:27,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 19:45:27,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 19:45:27,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:45:28,005 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:45:28,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28 WrapperNode [2022-12-13 19:45:28,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:45:28,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:45:28,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:45:28,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:45:28,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,022 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,038 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 19:45:28,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:45:28,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:45:28,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:45:28,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:45:28,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,055 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,056 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:45:28,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:45:28,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:45:28,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:45:28,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (1/1) ... [2022-12-13 19:45:28,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:45:28,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:45:28,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:45:28,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:45:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:45:28,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 19:45:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:45:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:45:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:45:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 19:45:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 19:45:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 19:45:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 19:45:28,116 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 19:45:28,116 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 19:45:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:45:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 19:45:28,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:45:28,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:45:28,118 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 19:45:28,221 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:45:28,223 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:45:28,469 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:45:28,571 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:45:28,572 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 19:45:28,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:45:28 BoogieIcfgContainer [2022-12-13 19:45:28,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:45:28,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:45:28,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:45:28,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:45:28,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:45:27" (1/3) ... [2022-12-13 19:45:28,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8771e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:45:28, skipping insertion in model container [2022-12-13 19:45:28,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:45:28" (2/3) ... [2022-12-13 19:45:28,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8771e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:45:28, skipping insertion in model container [2022-12-13 19:45:28,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:45:28" (3/3) ... [2022-12-13 19:45:28,582 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2022-12-13 19:45:28,591 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 19:45:28,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:45:28,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 19:45:28,598 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:45:28,641 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:45:28,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-12-13 19:45:28,716 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-12-13 19:45:28,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:45:28,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 19:45:28,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-12-13 19:45:28,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-12-13 19:45:28,729 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:45:28,739 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2022-12-13 19:45:28,742 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2022-12-13 19:45:28,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2022-12-13 19:45:28,771 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-12-13 19:45:28,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:45:28,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 19:45:28,774 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-12-13 19:45:31,429 INFO L134 LiptonReduction]: Checked pairs total: 5199 [2022-12-13 19:45:31,429 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-12-13 19:45:31,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:45:31,444 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;@77623761, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:45:31,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 19:45:31,447 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 19:45:31,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:45:31,448 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:31,448 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:31,448 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-12-13 19:45:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1904217507, now seen corresponding path program 1 times [2022-12-13 19:45:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:31,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94386655] [2022-12-13 19:45:31,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:31,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94386655] [2022-12-13 19:45:31,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94386655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:31,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:31,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:45:31,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242804834] [2022-12-13 19:45:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:31,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:45:31,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:31,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:45:31,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:45:31,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 228 [2022-12-13 19:45:31,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:31,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:31,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 228 [2022-12-13 19:45:31,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:31,959 INFO L130 PetriNetUnfolder]: 824/1312 cut-off events. [2022-12-13 19:45:31,959 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 19:45:31,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 1312 events. 824/1312 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6303 event pairs, 144 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 2580. Up to 981 conditions per place. [2022-12-13 19:45:31,966 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 26 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2022-12-13 19:45:31,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2022-12-13 19:45:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:45:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:45:31,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2022-12-13 19:45:31,979 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-13 19:45:31,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2022-12-13 19:45:31,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2022-12-13 19:45:31,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:31,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2022-12-13 19:45:31,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:31,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:31,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:31,994 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 354 transitions. [2022-12-13 19:45:31,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2022-12-13 19:45:31,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 19:45:31,999 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-12-13 19:45:32,001 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 19:45:32,005 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 19:45:32,005 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-12-13 19:45:32,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,005 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:32,006 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:32,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:45:32,006 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-12-13 19:45:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:32,007 INFO L85 PathProgramCache]: Analyzing trace with hash 297021625, now seen corresponding path program 1 times [2022-12-13 19:45:32,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:32,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630115858] [2022-12-13 19:45:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:32,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:32,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:32,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630115858] [2022-12-13 19:45:32,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630115858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:32,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:32,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:45:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058656620] [2022-12-13 19:45:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:32,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:45:32,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:32,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:45:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:45:32,178 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2022-12-13 19:45:32,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:32,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2022-12-13 19:45:32,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:32,425 INFO L130 PetriNetUnfolder]: 1069/1590 cut-off events. [2022-12-13 19:45:32,425 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 19:45:32,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1590 events. 1069/1590 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6274 event pairs, 409 based on Foata normal form. 8/1598 useless extension candidates. Maximal degree in co-relation 3300. Up to 1515 conditions per place. [2022-12-13 19:45:32,433 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-13 19:45:32,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 148 flow [2022-12-13 19:45:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:45:32,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:45:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-12-13 19:45:32,436 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48830409356725146 [2022-12-13 19:45:32,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-12-13 19:45:32,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-12-13 19:45:32,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:32,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-12-13 19:45:32,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,440 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 334 transitions. [2022-12-13 19:45:32,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 148 flow [2022-12-13 19:45:32,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:45:32,442 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 74 flow [2022-12-13 19:45:32,442 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-13 19:45:32,443 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 19:45:32,443 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 74 flow [2022-12-13 19:45:32,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,443 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:32,443 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:32,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:45:32,444 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-12-13 19:45:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1219152317, now seen corresponding path program 1 times [2022-12-13 19:45:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:32,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862476331] [2022-12-13 19:45:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:32,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862476331] [2022-12-13 19:45:32,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862476331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:32,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:32,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:45:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059495656] [2022-12-13 19:45:32,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:32,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:45:32,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:32,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:45:32,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:45:32,603 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2022-12-13 19:45:32,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:32,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2022-12-13 19:45:32,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:32,787 INFO L130 PetriNetUnfolder]: 969/1450 cut-off events. [2022-12-13 19:45:32,787 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-13 19:45:32,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 1450 events. 969/1450 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5750 event pairs, 375 based on Foata normal form. 40/1490 useless extension candidates. Maximal degree in co-relation 3334. Up to 1003 conditions per place. [2022-12-13 19:45:32,792 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-13 19:45:32,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 176 flow [2022-12-13 19:45:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:45:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:45:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-12-13 19:45:32,794 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48830409356725146 [2022-12-13 19:45:32,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-12-13 19:45:32,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-12-13 19:45:32,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:32,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-12-13 19:45:32,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,796 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 74 flow. Second operand 3 states and 334 transitions. [2022-12-13 19:45:32,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 176 flow [2022-12-13 19:45:32,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:45:32,797 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 81 flow [2022-12-13 19:45:32,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2022-12-13 19:45:32,798 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2022-12-13 19:45:32,798 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 81 flow [2022-12-13 19:45:32,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:32,798 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:32,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:45:32,798 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-12-13 19:45:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1172759479, now seen corresponding path program 1 times [2022-12-13 19:45:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:32,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678638497] [2022-12-13 19:45:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:32,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:32,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678638497] [2022-12-13 19:45:32,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678638497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:32,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:32,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:45:32,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904880998] [2022-12-13 19:45:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:32,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:45:32,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:32,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:45:32,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:45:32,914 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2022-12-13 19:45:32,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:32,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:32,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2022-12-13 19:45:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:33,093 INFO L130 PetriNetUnfolder]: 911/1368 cut-off events. [2022-12-13 19:45:33,093 INFO L131 PetriNetUnfolder]: For 489/489 co-relation queries the response was YES. [2022-12-13 19:45:33,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 1368 events. 911/1368 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5183 event pairs, 287 based on Foata normal form. 24/1392 useless extension candidates. Maximal degree in co-relation 3290. Up to 925 conditions per place. [2022-12-13 19:45:33,104 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-13 19:45:33,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 172 flow [2022-12-13 19:45:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:45:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:45:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-12-13 19:45:33,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48391812865497075 [2022-12-13 19:45:33,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2022-12-13 19:45:33,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2022-12-13 19:45:33,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:33,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2022-12-13 19:45:33,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,110 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 81 flow. Second operand 3 states and 331 transitions. [2022-12-13 19:45:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 172 flow [2022-12-13 19:45:33,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:45:33,112 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 86 flow [2022-12-13 19:45:33,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-13 19:45:33,112 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-12-13 19:45:33,113 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 86 flow [2022-12-13 19:45:33,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:33,113 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:33,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:45:33,114 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-12-13 19:45:33,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:33,114 INFO L85 PathProgramCache]: Analyzing trace with hash 782253524, now seen corresponding path program 1 times [2022-12-13 19:45:33,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:33,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659218480] [2022-12-13 19:45:33,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:33,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:33,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659218480] [2022-12-13 19:45:33,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659218480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:33,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:33,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:45:33,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606649329] [2022-12-13 19:45:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:33,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:45:33,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:45:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:45:33,266 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-12-13 19:45:33,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:33,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-12-13 19:45:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:33,471 INFO L130 PetriNetUnfolder]: 529/905 cut-off events. [2022-12-13 19:45:33,471 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-12-13 19:45:33,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 905 events. 529/905 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4146 event pairs, 100 based on Foata normal form. 96/999 useless extension candidates. Maximal degree in co-relation 2204. Up to 495 conditions per place. [2022-12-13 19:45:33,476 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 49 selfloop transitions, 7 changer transitions 2/61 dead transitions. [2022-12-13 19:45:33,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 61 transitions, 312 flow [2022-12-13 19:45:33,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:45:33,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:45:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-12-13 19:45:33,478 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008771929824561 [2022-12-13 19:45:33,479 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2022-12-13 19:45:33,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2022-12-13 19:45:33,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:33,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2022-12-13 19:45:33,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,484 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,484 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 86 flow. Second operand 5 states and 571 transitions. [2022-12-13 19:45:33,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 61 transitions, 312 flow [2022-12-13 19:45:33,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 61 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:45:33,486 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 134 flow [2022-12-13 19:45:33,486 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-13 19:45:33,487 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-12-13 19:45:33,487 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 134 flow [2022-12-13 19:45:33,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,488 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:33,488 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:33,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:45:33,488 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-12-13 19:45:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:33,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1435706821, now seen corresponding path program 1 times [2022-12-13 19:45:33,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:33,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002579235] [2022-12-13 19:45:33,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:33,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:33,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:33,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:33,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002579235] [2022-12-13 19:45:33,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002579235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:33,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:33,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:45:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249372542] [2022-12-13 19:45:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:33,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:45:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:33,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:45:33,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:45:33,736 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-12-13 19:45:33,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:33,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-12-13 19:45:33,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:33,944 INFO L130 PetriNetUnfolder]: 391/707 cut-off events. [2022-12-13 19:45:33,945 INFO L131 PetriNetUnfolder]: For 430/430 co-relation queries the response was YES. [2022-12-13 19:45:33,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 707 events. 391/707 cut-off events. For 430/430 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3226 event pairs, 66 based on Foata normal form. 52/757 useless extension candidates. Maximal degree in co-relation 2148. Up to 233 conditions per place. [2022-12-13 19:45:33,949 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 57 selfloop transitions, 13 changer transitions 10/83 dead transitions. [2022-12-13 19:45:33,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 480 flow [2022-12-13 19:45:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:45:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 19:45:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 799 transitions. [2022-12-13 19:45:33,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5006265664160401 [2022-12-13 19:45:33,952 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 799 transitions. [2022-12-13 19:45:33,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 799 transitions. [2022-12-13 19:45:33,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:33,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 799 transitions. [2022-12-13 19:45:33,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,959 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,959 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 134 flow. Second operand 7 states and 799 transitions. [2022-12-13 19:45:33,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 480 flow [2022-12-13 19:45:33,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:45:33,963 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 218 flow [2022-12-13 19:45:33,963 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-12-13 19:45:33,963 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2022-12-13 19:45:33,964 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 218 flow [2022-12-13 19:45:33,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:33,964 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:33,964 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:33,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:45:33,964 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-12-13 19:45:33,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:33,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1891468266, now seen corresponding path program 1 times [2022-12-13 19:45:33,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:33,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494173829] [2022-12-13 19:45:33,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:33,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:34,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:34,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494173829] [2022-12-13 19:45:34,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494173829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:34,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:34,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:45:34,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393157985] [2022-12-13 19:45:34,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:34,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 19:45:34,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:34,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 19:45:34,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:45:34,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-12-13 19:45:34,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:34,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-12-13 19:45:34,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:34,335 INFO L130 PetriNetUnfolder]: 355/646 cut-off events. [2022-12-13 19:45:34,335 INFO L131 PetriNetUnfolder]: For 943/943 co-relation queries the response was YES. [2022-12-13 19:45:34,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 646 events. 355/646 cut-off events. For 943/943 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2921 event pairs, 63 based on Foata normal form. 12/656 useless extension candidates. Maximal degree in co-relation 2189. Up to 207 conditions per place. [2022-12-13 19:45:34,338 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 54 selfloop transitions, 17 changer transitions 9/83 dead transitions. [2022-12-13 19:45:34,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 538 flow [2022-12-13 19:45:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 19:45:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 19:45:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1005 transitions. [2022-12-13 19:45:34,340 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.489766081871345 [2022-12-13 19:45:34,340 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1005 transitions. [2022-12-13 19:45:34,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1005 transitions. [2022-12-13 19:45:34,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:34,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1005 transitions. [2022-12-13 19:45:34,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,344 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,344 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 218 flow. Second operand 9 states and 1005 transitions. [2022-12-13 19:45:34,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 538 flow [2022-12-13 19:45:34,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 83 transitions, 484 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 19:45:34,350 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 232 flow [2022-12-13 19:45:34,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=232, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2022-12-13 19:45:34,351 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2022-12-13 19:45:34,351 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 232 flow [2022-12-13 19:45:34,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,351 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:34,351 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] [2022-12-13 19:45:34,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:45:34,352 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-12-13 19:45:34,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:34,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1911651511, now seen corresponding path program 1 times [2022-12-13 19:45:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:34,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277470337] [2022-12-13 19:45:34,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:34,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:34,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277470337] [2022-12-13 19:45:34,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277470337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:34,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:34,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:45:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018408505] [2022-12-13 19:45:34,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:34,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:45:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:34,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:45:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:45:34,473 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 228 [2022-12-13 19:45:34,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:34,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 228 [2022-12-13 19:45:34,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:34,630 INFO L130 PetriNetUnfolder]: 542/965 cut-off events. [2022-12-13 19:45:34,630 INFO L131 PetriNetUnfolder]: For 1665/1665 co-relation queries the response was YES. [2022-12-13 19:45:34,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3291 conditions, 965 events. 542/965 cut-off events. For 1665/1665 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4719 event pairs, 94 based on Foata normal form. 1/966 useless extension candidates. Maximal degree in co-relation 3268. Up to 547 conditions per place. [2022-12-13 19:45:34,633 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 36 selfloop transitions, 1 changer transitions 42/80 dead transitions. [2022-12-13 19:45:34,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 684 flow [2022-12-13 19:45:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:45:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:45:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2022-12-13 19:45:34,634 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5032894736842105 [2022-12-13 19:45:34,634 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2022-12-13 19:45:34,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2022-12-13 19:45:34,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:34,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2022-12-13 19:45:34,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,637 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,637 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 232 flow. Second operand 4 states and 459 transitions. [2022-12-13 19:45:34,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 684 flow [2022-12-13 19:45:34,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 551 flow, removed 30 selfloop flow, removed 8 redundant places. [2022-12-13 19:45:34,643 INFO L231 Difference]: Finished difference. Result has 50 places, 29 transitions, 131 flow [2022-12-13 19:45:34,644 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=29} [2022-12-13 19:45:34,644 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-13 19:45:34,644 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 29 transitions, 131 flow [2022-12-13 19:45:34,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:34,644 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] [2022-12-13 19:45:34,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 19:45:34,645 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-12-13 19:45:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:34,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1608021295, now seen corresponding path program 2 times [2022-12-13 19:45:34,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:34,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813365222] [2022-12-13 19:45:34,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:34,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:34,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813365222] [2022-12-13 19:45:34,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813365222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:34,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:34,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 19:45:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19613268] [2022-12-13 19:45:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:45:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:45:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:45:34,781 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 228 [2022-12-13 19:45:34,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 29 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:34,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 228 [2022-12-13 19:45:34,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:34,932 INFO L130 PetriNetUnfolder]: 206/401 cut-off events. [2022-12-13 19:45:34,932 INFO L131 PetriNetUnfolder]: For 398/398 co-relation queries the response was YES. [2022-12-13 19:45:34,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 401 events. 206/401 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1596 event pairs, 44 based on Foata normal form. 1/402 useless extension candidates. Maximal degree in co-relation 1212. Up to 231 conditions per place. [2022-12-13 19:45:34,934 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 26 selfloop transitions, 3 changer transitions 39/68 dead transitions. [2022-12-13 19:45:34,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 435 flow [2022-12-13 19:45:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:45:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:45:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2022-12-13 19:45:34,935 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47002923976608185 [2022-12-13 19:45:34,935 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2022-12-13 19:45:34,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2022-12-13 19:45:34,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:34,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2022-12-13 19:45:34,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,938 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,938 INFO L175 Difference]: Start difference. First operand has 50 places, 29 transitions, 131 flow. Second operand 6 states and 643 transitions. [2022-12-13 19:45:34,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 435 flow [2022-12-13 19:45:34,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 412 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-13 19:45:34,940 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 121 flow [2022-12-13 19:45:34,940 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-12-13 19:45:34,941 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-12-13 19:45:34,941 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 121 flow [2022-12-13 19:45:34,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:34,941 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:34,941 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] [2022-12-13 19:45:34,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:45:34,941 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-12-13 19:45:34,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:34,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1388420993, now seen corresponding path program 3 times [2022-12-13 19:45:34,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:34,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033662660] [2022-12-13 19:45:34,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:34,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:45:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:45:35,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:45:35,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033662660] [2022-12-13 19:45:35,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033662660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:45:35,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:45:35,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 19:45:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164376693] [2022-12-13 19:45:35,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:45:35,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 19:45:35,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:45:35,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 19:45:35,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:45:35,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 228 [2022-12-13 19:45:35,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 121 flow. Second operand has 7 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-12-13 19:45:35,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:45:35,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 228 [2022-12-13 19:45:35,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:45:35,827 INFO L130 PetriNetUnfolder]: 80/187 cut-off events. [2022-12-13 19:45:35,827 INFO L131 PetriNetUnfolder]: For 222/222 co-relation queries the response was YES. [2022-12-13 19:45:35,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 187 events. 80/187 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 661 event pairs, 14 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 595. Up to 83 conditions per place. [2022-12-13 19:45:35,827 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 24 selfloop transitions, 5 changer transitions 18/49 dead transitions. [2022-12-13 19:45:35,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 325 flow [2022-12-13 19:45:35,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 19:45:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 19:45:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 850 transitions. [2022-12-13 19:45:35,830 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46600877192982454 [2022-12-13 19:45:35,830 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 850 transitions. [2022-12-13 19:45:35,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 850 transitions. [2022-12-13 19:45:35,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:45:35,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 850 transitions. [2022-12-13 19:45:35,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.25) internal successors, (850), 8 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:35,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 228.0) internal successors, (2052), 9 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:35,836 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 228.0) internal successors, (2052), 9 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:45:35,836 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 121 flow. Second operand 8 states and 850 transitions. [2022-12-13 19:45:35,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 325 flow [2022-12-13 19:45:35,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 319 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 19:45:35,839 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 131 flow [2022-12-13 19:45:35,839 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2022-12-13 19:45:35,839 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-12-13 19:45:35,840 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 131 flow [2022-12-13 19:45:35,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-12-13 19:45:35,840 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:45:35,840 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] [2022-12-13 19:45:35,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 19:45:35,840 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-12-13 19:45:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:45:35,841 INFO L85 PathProgramCache]: Analyzing trace with hash -256388883, now seen corresponding path program 4 times [2022-12-13 19:45:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:45:35,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23438966] [2022-12-13 19:45:35,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:45:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:45:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:45:35,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:45:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:45:35,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:45:35,915 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:45:35,916 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 19:45:35,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 19:45:35,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 19:45:35,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 19:45:35,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 19:45:35,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 19:45:35,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 19:45:35,918 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:45:35,922 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 19:45:35,923 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 19:45:35,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:45:35 BasicIcfg [2022-12-13 19:45:35,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 19:45:35,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:45:35,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:45:35,963 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:45:35,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:45:28" (3/4) ... [2022-12-13 19:45:35,965 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 19:45:36,021 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:45:36,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:45:36,022 INFO L158 Benchmark]: Toolchain (without parser) took 8376.19ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 99.0MB in the beginning and 117.4MB in the end (delta: -18.4MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-12-13 19:45:36,022 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:45:36,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.05ms. Allocated memory is still 134.2MB. Free memory was 98.6MB in the beginning and 71.2MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 19:45:36,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.05ms. Allocated memory is still 134.2MB. Free memory was 71.2MB in the beginning and 68.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:45:36,023 INFO L158 Benchmark]: Boogie Preprocessor took 20.43ms. Allocated memory is still 134.2MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:45:36,023 INFO L158 Benchmark]: RCFGBuilder took 515.07ms. Allocated memory is still 134.2MB. Free memory was 66.3MB in the beginning and 88.2MB in the end (delta: -22.0MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-12-13 19:45:36,023 INFO L158 Benchmark]: TraceAbstraction took 7386.23ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 87.5MB in the beginning and 127.9MB in the end (delta: -40.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-12-13 19:45:36,024 INFO L158 Benchmark]: Witness Printer took 58.19ms. Allocated memory is still 195.0MB. Free memory was 127.9MB in the beginning and 117.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:45:36,025 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.13ms. Allocated memory is still 134.2MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.05ms. Allocated memory is still 134.2MB. Free memory was 98.6MB in the beginning and 71.2MB in the end (delta: 27.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.05ms. Allocated memory is still 134.2MB. Free memory was 71.2MB in the beginning and 68.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.43ms. Allocated memory is still 134.2MB. Free memory was 68.4MB in the beginning and 66.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.07ms. Allocated memory is still 134.2MB. Free memory was 66.3MB in the beginning and 88.2MB in the end (delta: -22.0MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7386.23ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 87.5MB in the beginning and 127.9MB in the end (delta: -40.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 58.19ms. Allocated memory is still 195.0MB. Free memory was 127.9MB in the beginning and 117.4MB 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: 2.7s, 125 PlacesBefore, 33 PlacesAfterwards, 117 TransitionsBefore, 24 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 5199 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2697, independent: 2514, independent conditional: 0, independent unconditional: 2514, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1175, independent: 1137, independent conditional: 0, independent unconditional: 1137, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2697, independent: 1377, independent conditional: 0, independent unconditional: 1377, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1175, unknown conditional: 0, unknown unconditional: 1175] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-1, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=0, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=1, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, 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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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, 148 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: 7.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 929 IncrementalHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 59 mSDtfsCounter, 929 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 1025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-12-13 19:45:36,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74f76943-7222-4779-aa54-071d3fc77809/bin/uautomizer-uyxdKDjOR8/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