./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008.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_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/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_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/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_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/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 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 --- 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 11:21:47,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:21:47,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:21:47,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:21:47,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:21:47,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:21:47,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:21:47,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:21:47,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:21:47,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:21:47,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:21:47,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:21:47,579 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:21:47,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:21:47,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:21:47,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:21:47,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:21:47,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:21:47,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:21:47,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:21:47,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:21:47,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:21:47,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:21:47,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:21:47,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:21:47,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:21:47,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:21:47,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:21:47,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:21:47,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:21:47,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:21:47,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:21:47,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:21:47,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:21:47,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:21:47,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:21:47,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:21:47,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:21:47,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:21:47,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:21:47,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:21:47,616 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 11:21:47,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:21:47,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:21:47,648 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:21:47,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:21:47,649 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:21:47,649 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:21:47,650 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:21:47,650 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:21:47,650 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:21:47,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:21:47,651 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:21:47,651 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:21:47,651 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:21:47,651 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:21:47,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:21:47,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:21:47,652 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:21:47,652 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:21:47,652 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:21:47,652 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:21:47,652 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:21:47,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:21:47,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:21:47,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:21:47,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:21:47,653 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:21:47,653 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:21:47,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:21:47,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:21:47,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:21:47,654 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:21:47,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:21:47,654 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:21:47,654 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:21:47,654 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:21:47,655 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_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/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_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 [2022-12-13 11:21:47,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:21:47,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:21:47,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:21:47,873 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:21:47,873 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:21:47,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix008.opt.i [2022-12-13 11:21:50,458 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:21:50,665 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:21:50,666 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/sv-benchmarks/c/pthread-wmm/mix008.opt.i [2022-12-13 11:21:50,683 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/data/0d1aaacf8/d0e400b95e7a431387366688c7b812ce/FLAG1b6a7e591 [2022-12-13 11:21:50,696 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/data/0d1aaacf8/d0e400b95e7a431387366688c7b812ce [2022-12-13 11:21:50,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:21:50,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:21:50,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:21:50,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:21:50,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:21:50,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:21:50" (1/1) ... [2022-12-13 11:21:50,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2c00e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:50, skipping insertion in model container [2022-12-13 11:21:50,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:21:50" (1/1) ... [2022-12-13 11:21:50,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:21:50,743 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:21:50,902 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_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957] [2022-12-13 11:21:51,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,057 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:21:51,079 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:21:51,087 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_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/sv-benchmarks/c/pthread-wmm/mix008.opt.i[944,957] [2022-12-13 11:21:51,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,123 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:21:51,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:21:51,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:21:51,148 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:21:51,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51 WrapperNode [2022-12-13 11:21:51,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:21:51,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:21:51,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:21:51,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:21:51,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,184 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2022-12-13 11:21:51,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:21:51,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:21:51,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:21:51,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:21:51,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,203 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:21:51,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:21:51,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:21:51,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:21:51,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (1/1) ... [2022-12-13 11:21:51,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:21:51,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:21:51,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:21:51,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:21:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:21:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:21:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:21:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:21:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:21:51,268 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:21:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:21:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:21:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:21:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:21:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:21:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:21:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:21:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:21:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:21:51,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:21:51,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:21:51,270 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 11:21:51,382 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:21:51,384 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:21:51,647 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:21:51,782 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:21:51,782 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:21:51,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:21:51 BoogieIcfgContainer [2022-12-13 11:21:51,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:21:51,787 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:21:51,787 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:21:51,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:21:51,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:21:50" (1/3) ... [2022-12-13 11:21:51,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd05c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:21:51, skipping insertion in model container [2022-12-13 11:21:51,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:21:51" (2/3) ... [2022-12-13 11:21:51,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cd05c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:21:51, skipping insertion in model container [2022-12-13 11:21:51,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:21:51" (3/3) ... [2022-12-13 11:21:51,794 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2022-12-13 11:21:51,802 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 11:21:51,812 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:21:51,812 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:21:51,813 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:21:51,865 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:21:51,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 11:21:51,952 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 11:21:51,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:21:51,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 11:21:51,959 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-12-13 11:21:51,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-12-13 11:21:51,967 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:21:51,977 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 11:21:51,979 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 276 flow [2022-12-13 11:21:51,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 276 flow [2022-12-13 11:21:52,006 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 11:21:52,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:21:52,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 11:21:52,009 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2022-12-13 11:21:54,607 INFO L134 LiptonReduction]: Checked pairs total: 7934 [2022-12-13 11:21:54,607 INFO L136 LiptonReduction]: Total number of compositions: 113 [2022-12-13 11:21:54,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:21:54,624 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;@38dbb0e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:21:54,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 11:21:54,629 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 11:21:54,629 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:21:54,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:21:54,630 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:54,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:21:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash -858713527, now seen corresponding path program 1 times [2022-12-13 11:21:54,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:54,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114099105] [2022-12-13 11:21:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:54,992 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 11:21:54,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:54,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114099105] [2022-12-13 11:21:54,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114099105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:54,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:54,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:21:54,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68452815] [2022-12-13 11:21:54,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:55,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:21:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:55,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:21:55,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:21:55,031 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 249 [2022-12-13 11:21:55,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 11:21:55,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:21:55,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 249 [2022-12-13 11:21:55,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:21:55,576 INFO L130 PetriNetUnfolder]: 3632/5267 cut-off events. [2022-12-13 11:21:55,576 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-13 11:21:55,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10360 conditions, 5267 events. 3632/5267 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 29332 event pairs, 668 based on Foata normal form. 180/5074 useless extension candidates. Maximal degree in co-relation 10348. Up to 3973 conditions per place. [2022-12-13 11:21:55,599 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 32 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2022-12-13 11:21:55,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 172 flow [2022-12-13 11:21:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:21:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:21:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2022-12-13 11:21:55,609 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5448460508701473 [2022-12-13 11:21:55,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2022-12-13 11:21:55,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2022-12-13 11:21:55,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:21:55,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2022-12-13 11:21:55,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 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 11:21:55,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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 11:21:55,619 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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 11:21:55,620 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 407 transitions. [2022-12-13 11:21:55,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 172 flow [2022-12-13 11:21:55,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:21:55,624 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2022-12-13 11:21:55,626 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-13 11:21:55,629 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-13 11:21:55,629 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2022-12-13 11:21:55,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 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 11:21:55,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:21:55,629 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:55,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:21:55,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:21:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1106600023, now seen corresponding path program 1 times [2022-12-13 11:21:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:55,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938691543] [2022-12-13 11:21:55,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:55,838 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 11:21:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:55,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938691543] [2022-12-13 11:21:55,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938691543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:55,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:55,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:21:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20809554] [2022-12-13 11:21:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:55,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:21:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:55,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:21:55,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:21:55,865 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-12-13 11:21:55,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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 11:21:55,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:21:55,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-12-13 11:21:55,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:21:57,568 INFO L130 PetriNetUnfolder]: 13983/19192 cut-off events. [2022-12-13 11:21:57,569 INFO L131 PetriNetUnfolder]: For 710/710 co-relation queries the response was YES. [2022-12-13 11:21:57,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39466 conditions, 19192 events. 13983/19192 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 101964 event pairs, 4335 based on Foata normal form. 820/20012 useless extension candidates. Maximal degree in co-relation 39456. Up to 10247 conditions per place. [2022-12-13 11:21:57,646 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 40 selfloop transitions, 9 changer transitions 31/80 dead transitions. [2022-12-13 11:21:57,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 80 transitions, 342 flow [2022-12-13 11:21:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:21:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:21:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2022-12-13 11:21:57,651 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5076305220883535 [2022-12-13 11:21:57,651 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2022-12-13 11:21:57,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2022-12-13 11:21:57,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:21:57,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2022-12-13 11:21:57,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 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 11:21:57,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:21:57,658 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:21:57,659 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 632 transitions. [2022-12-13 11:21:57,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 80 transitions, 342 flow [2022-12-13 11:21:57,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:21:57,680 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 152 flow [2022-12-13 11:21:57,680 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-13 11:21:57,681 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-13 11:21:57,681 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 152 flow [2022-12-13 11:21:57,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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 11:21:57,682 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:21:57,682 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:57,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:21:57,682 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:21:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 55095078, now seen corresponding path program 1 times [2022-12-13 11:21:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:57,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416989670] [2022-12-13 11:21:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:57,876 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 11:21:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:57,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416989670] [2022-12-13 11:21:57,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416989670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:57,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:57,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:21:57,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444348574] [2022-12-13 11:21:57,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:21:57,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:21:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:21:57,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-12-13 11:21:57,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 11:21:57,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:21:57,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-12-13 11:21:57,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:21:59,457 INFO L130 PetriNetUnfolder]: 12949/17918 cut-off events. [2022-12-13 11:21:59,457 INFO L131 PetriNetUnfolder]: For 13891/13891 co-relation queries the response was YES. [2022-12-13 11:21:59,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53022 conditions, 17918 events. 12949/17918 cut-off events. For 13891/13891 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 98103 event pairs, 1191 based on Foata normal form. 764/18682 useless extension candidates. Maximal degree in co-relation 53008. Up to 9393 conditions per place. [2022-12-13 11:21:59,534 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 57 selfloop transitions, 13 changer transitions 47/117 dead transitions. [2022-12-13 11:21:59,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 117 transitions, 718 flow [2022-12-13 11:21:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:21:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:21:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2022-12-13 11:21:59,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.504302925989673 [2022-12-13 11:21:59,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2022-12-13 11:21:59,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2022-12-13 11:21:59,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:21:59,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2022-12-13 11:21:59,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 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 11:21:59,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:21:59,542 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:21:59,542 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 152 flow. Second operand 7 states and 879 transitions. [2022-12-13 11:21:59,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 117 transitions, 718 flow [2022-12-13 11:21:59,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 117 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:21:59,593 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 254 flow [2022-12-13 11:21:59,594 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-13 11:21:59,594 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places. [2022-12-13 11:21:59,594 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 254 flow [2022-12-13 11:21:59,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 11:21:59,595 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:21:59,595 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:21:59,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:21:59,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:21:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:21:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash 55121986, now seen corresponding path program 1 times [2022-12-13 11:21:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:21:59,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181608623] [2022-12-13 11:21:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:21:59,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:21:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:21:59,725 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 11:21:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:21:59,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181608623] [2022-12-13 11:21:59,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181608623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:21:59,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:21:59,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:21:59,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130621583] [2022-12-13 11:21:59,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:21:59,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:21:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:21:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:21:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:21:59,750 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-12-13 11:21:59,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 11:21:59,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:21:59,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-12-13 11:21:59,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:01,194 INFO L130 PetriNetUnfolder]: 12123/16788 cut-off events. [2022-12-13 11:22:01,194 INFO L131 PetriNetUnfolder]: For 38266/38266 co-relation queries the response was YES. [2022-12-13 11:22:01,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56264 conditions, 16788 events. 12123/16788 cut-off events. For 38266/38266 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 89404 event pairs, 2311 based on Foata normal form. 652/17440 useless extension candidates. Maximal degree in co-relation 56244. Up to 8703 conditions per place. [2022-12-13 11:22:01,248 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 62 selfloop transitions, 20 changer transitions 40/122 dead transitions. [2022-12-13 11:22:01,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 842 flow [2022-12-13 11:22:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:22:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:22:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2022-12-13 11:22:01,250 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2022-12-13 11:22:01,250 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2022-12-13 11:22:01,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2022-12-13 11:22:01,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:01,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2022-12-13 11:22:01,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 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 11:22:01,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:22:01,254 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:22:01,255 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 254 flow. Second operand 7 states and 882 transitions. [2022-12-13 11:22:01,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 842 flow [2022-12-13 11:22:01,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 122 transitions, 834 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 11:22:01,349 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 383 flow [2022-12-13 11:22:01,350 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2022-12-13 11:22:01,350 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2022-12-13 11:22:01,350 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 383 flow [2022-12-13 11:22:01,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 11:22:01,351 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:01,351 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:01,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:22:01,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1707931749, now seen corresponding path program 1 times [2022-12-13 11:22:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:01,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988004936] [2022-12-13 11:22:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:01,455 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 11:22:01,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:01,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988004936] [2022-12-13 11:22:01,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988004936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:01,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:01,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:22:01,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176884089] [2022-12-13 11:22:01,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:01,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:22:01,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:01,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:22:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:22:01,477 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-12-13 11:22:01,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:22:01,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:01,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-12-13 11:22:01,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:03,148 INFO L130 PetriNetUnfolder]: 10977/15230 cut-off events. [2022-12-13 11:22:03,148 INFO L131 PetriNetUnfolder]: For 55753/55753 co-relation queries the response was YES. [2022-12-13 11:22:03,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57047 conditions, 15230 events. 10977/15230 cut-off events. For 55753/55753 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 79978 event pairs, 2109 based on Foata normal form. 624/15854 useless extension candidates. Maximal degree in co-relation 57020. Up to 6097 conditions per place. [2022-12-13 11:22:03,255 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 74 selfloop transitions, 10 changer transitions 45/129 dead transitions. [2022-12-13 11:22:03,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 129 transitions, 1088 flow [2022-12-13 11:22:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:22:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:22:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2022-12-13 11:22:03,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5002868617326449 [2022-12-13 11:22:03,258 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2022-12-13 11:22:03,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2022-12-13 11:22:03,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:03,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2022-12-13 11:22:03,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 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 11:22:03,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:22:03,261 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:22:03,261 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 383 flow. Second operand 7 states and 872 transitions. [2022-12-13 11:22:03,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 129 transitions, 1088 flow [2022-12-13 11:22:03,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 129 transitions, 1048 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-13 11:22:03,500 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 492 flow [2022-12-13 11:22:03,500 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2022-12-13 11:22:03,501 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2022-12-13 11:22:03,501 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 492 flow [2022-12-13 11:22:03,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:22:03,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:03,501 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:03,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:22:03,502 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:03,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:03,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1065772789, now seen corresponding path program 1 times [2022-12-13 11:22:03,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:03,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355208849] [2022-12-13 11:22:03,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:03,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:03,585 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 11:22:03,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:03,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355208849] [2022-12-13 11:22:03,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355208849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:03,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:03,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:22:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041999285] [2022-12-13 11:22:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:03,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:22:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:22:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:22:03,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 249 [2022-12-13 11:22:03,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 492 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 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 11:22:03,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:03,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 249 [2022-12-13 11:22:03,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:04,631 INFO L130 PetriNetUnfolder]: 6796/10051 cut-off events. [2022-12-13 11:22:04,632 INFO L131 PetriNetUnfolder]: For 45886/48111 co-relation queries the response was YES. [2022-12-13 11:22:04,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38228 conditions, 10051 events. 6796/10051 cut-off events. For 45886/48111 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 59038 event pairs, 1939 based on Foata normal form. 946/10807 useless extension candidates. Maximal degree in co-relation 38198. Up to 5488 conditions per place. [2022-12-13 11:22:04,673 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 47 selfloop transitions, 6 changer transitions 20/92 dead transitions. [2022-12-13 11:22:04,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 868 flow [2022-12-13 11:22:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:22:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:22:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2022-12-13 11:22:04,675 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5269076305220883 [2022-12-13 11:22:04,675 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2022-12-13 11:22:04,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2022-12-13 11:22:04,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:04,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2022-12-13 11:22:04,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:22:04,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:22:04,677 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:22:04,677 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 492 flow. Second operand 5 states and 656 transitions. [2022-12-13 11:22:04,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 868 flow [2022-12-13 11:22:04,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 851 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 11:22:04,834 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 499 flow [2022-12-13 11:22:04,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2022-12-13 11:22:04,834 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2022-12-13 11:22:04,834 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 499 flow [2022-12-13 11:22:04,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 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 11:22:04,835 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:04,835 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:04,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:22:04,835 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash 23544931, now seen corresponding path program 1 times [2022-12-13 11:22:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:04,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739155672] [2022-12-13 11:22:04,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:04,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:04,937 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 11:22:04,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:04,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739155672] [2022-12-13 11:22:04,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739155672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:04,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:04,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:22:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921252767] [2022-12-13 11:22:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:04,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:22:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:04,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:22:04,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:22:04,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2022-12-13 11:22:04,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 11:22:04,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:04,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2022-12-13 11:22:04,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:05,616 INFO L130 PetriNetUnfolder]: 4401/6585 cut-off events. [2022-12-13 11:22:05,616 INFO L131 PetriNetUnfolder]: For 23740/25024 co-relation queries the response was YES. [2022-12-13 11:22:05,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24359 conditions, 6585 events. 4401/6585 cut-off events. For 23740/25024 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 37818 event pairs, 938 based on Foata normal form. 495/6843 useless extension candidates. Maximal degree in co-relation 24327. Up to 5582 conditions per place. [2022-12-13 11:22:05,663 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 60 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2022-12-13 11:22:05,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 831 flow [2022-12-13 11:22:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:22:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:22:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2022-12-13 11:22:05,664 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5287817938420348 [2022-12-13 11:22:05,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2022-12-13 11:22:05,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2022-12-13 11:22:05,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:05,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2022-12-13 11:22:05,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 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 11:22:05,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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 11:22:05,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 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 11:22:05,666 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 499 flow. Second operand 3 states and 395 transitions. [2022-12-13 11:22:05,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 831 flow [2022-12-13 11:22:05,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 801 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-12-13 11:22:05,703 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 510 flow [2022-12-13 11:22:05,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2022-12-13 11:22:05,704 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 17 predicate places. [2022-12-13 11:22:05,704 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 510 flow [2022-12-13 11:22:05,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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 11:22:05,704 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:05,704 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:05,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:22:05,705 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1801284757, now seen corresponding path program 1 times [2022-12-13 11:22:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:05,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269177830] [2022-12-13 11:22:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:05,823 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 11:22:05,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:05,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269177830] [2022-12-13 11:22:05,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269177830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:05,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:05,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:22:05,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612471268] [2022-12-13 11:22:05,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:05,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:22:05,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:05,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:22:05,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:22:05,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-12-13 11:22:05,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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 11:22:05,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:05,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-12-13 11:22:05,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:07,112 INFO L130 PetriNetUnfolder]: 8260/12035 cut-off events. [2022-12-13 11:22:07,113 INFO L131 PetriNetUnfolder]: For 47815/47815 co-relation queries the response was YES. [2022-12-13 11:22:07,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51827 conditions, 12035 events. 8260/12035 cut-off events. For 47815/47815 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 66615 event pairs, 1971 based on Foata normal form. 198/12233 useless extension candidates. Maximal degree in co-relation 51798. Up to 4904 conditions per place. [2022-12-13 11:22:07,158 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 81 selfloop transitions, 24 changer transitions 35/140 dead transitions. [2022-12-13 11:22:07,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 140 transitions, 1297 flow [2022-12-13 11:22:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:22:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:22:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2022-12-13 11:22:07,161 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4979919678714859 [2022-12-13 11:22:07,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2022-12-13 11:22:07,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2022-12-13 11:22:07,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:07,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2022-12-13 11:22:07,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 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 11:22:07,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:22:07,165 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 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 11:22:07,165 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 510 flow. Second operand 7 states and 868 transitions. [2022-12-13 11:22:07,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 140 transitions, 1297 flow [2022-12-13 11:22:07,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 140 transitions, 1284 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:22:07,342 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 701 flow [2022-12-13 11:22:07,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=701, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2022-12-13 11:22:07,343 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2022-12-13 11:22:07,343 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 701 flow [2022-12-13 11:22:07,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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 11:22:07,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:07,343 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:07,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:22:07,343 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:07,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1717654585, now seen corresponding path program 1 times [2022-12-13 11:22:07,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:07,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634951720] [2022-12-13 11:22:07,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:07,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:07,473 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 11:22:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:07,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634951720] [2022-12-13 11:22:07,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634951720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:07,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:07,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:22:07,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689849382] [2022-12-13 11:22:07,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:07,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:22:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:22:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:22:07,485 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2022-12-13 11:22:07,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 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 11:22:07,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:07,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2022-12-13 11:22:07,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:08,280 INFO L130 PetriNetUnfolder]: 2938/4764 cut-off events. [2022-12-13 11:22:08,280 INFO L131 PetriNetUnfolder]: For 23822/24849 co-relation queries the response was YES. [2022-12-13 11:22:08,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20520 conditions, 4764 events. 2938/4764 cut-off events. For 23822/24849 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 29153 event pairs, 403 based on Foata normal form. 666/5289 useless extension candidates. Maximal degree in co-relation 20484. Up to 2710 conditions per place. [2022-12-13 11:22:08,305 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 89 selfloop transitions, 9 changer transitions 1/119 dead transitions. [2022-12-13 11:22:08,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 119 transitions, 1441 flow [2022-12-13 11:22:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:22:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:22:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2022-12-13 11:22:08,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5301204819277109 [2022-12-13 11:22:08,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2022-12-13 11:22:08,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2022-12-13 11:22:08,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:08,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2022-12-13 11:22:08,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 11:22:08,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 11:22:08,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 11:22:08,310 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 701 flow. Second operand 4 states and 528 transitions. [2022-12-13 11:22:08,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 119 transitions, 1441 flow [2022-12-13 11:22:08,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 119 transitions, 1427 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 11:22:08,335 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 743 flow [2022-12-13 11:22:08,335 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=743, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2022-12-13 11:22:08,336 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2022-12-13 11:22:08,336 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 743 flow [2022-12-13 11:22:08,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 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 11:22:08,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:08,336 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 11:22:08,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:22:08,337 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1939372316, now seen corresponding path program 1 times [2022-12-13 11:22:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:08,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654092842] [2022-12-13 11:22:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:08,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:08,486 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 11:22:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:08,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654092842] [2022-12-13 11:22:08,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654092842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:08,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:08,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:22:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113701955] [2022-12-13 11:22:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:08,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:22:08,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:22:08,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:22:08,494 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2022-12-13 11:22:08,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 743 flow. Second operand has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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 11:22:08,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:08,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2022-12-13 11:22:08,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:08,943 INFO L130 PetriNetUnfolder]: 2025/3299 cut-off events. [2022-12-13 11:22:08,943 INFO L131 PetriNetUnfolder]: For 18621/19622 co-relation queries the response was YES. [2022-12-13 11:22:08,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16443 conditions, 3299 events. 2025/3299 cut-off events. For 18621/19622 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 19433 event pairs, 220 based on Foata normal form. 588/3772 useless extension candidates. Maximal degree in co-relation 16405. Up to 1246 conditions per place. [2022-12-13 11:22:08,957 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 102 selfloop transitions, 13 changer transitions 3/138 dead transitions. [2022-12-13 11:22:08,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 138 transitions, 1678 flow [2022-12-13 11:22:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:22:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:22:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2022-12-13 11:22:08,960 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5293172690763053 [2022-12-13 11:22:08,960 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2022-12-13 11:22:08,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2022-12-13 11:22:08,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:08,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2022-12-13 11:22:08,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 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 11:22:08,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:22:08,963 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:22:08,963 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 743 flow. Second operand 5 states and 659 transitions. [2022-12-13 11:22:08,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 138 transitions, 1678 flow [2022-12-13 11:22:08,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 138 transitions, 1654 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 11:22:08,982 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 787 flow [2022-12-13 11:22:08,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2022-12-13 11:22:08,983 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2022-12-13 11:22:08,983 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 787 flow [2022-12-13 11:22:08,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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 11:22:08,983 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:08,983 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:08,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:22:08,983 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:08,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:08,984 INFO L85 PathProgramCache]: Analyzing trace with hash -287975093, now seen corresponding path program 1 times [2022-12-13 11:22:08,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:08,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003521581] [2022-12-13 11:22:08,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:08,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:09,110 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 11:22:09,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003521581] [2022-12-13 11:22:09,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003521581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:09,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:09,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:22:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408172570] [2022-12-13 11:22:09,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:09,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:22:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:22:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:22:09,119 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2022-12-13 11:22:09,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 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 11:22:09,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:09,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2022-12-13 11:22:09,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:09,561 INFO L130 PetriNetUnfolder]: 1924/3070 cut-off events. [2022-12-13 11:22:09,561 INFO L131 PetriNetUnfolder]: For 18849/19851 co-relation queries the response was YES. [2022-12-13 11:22:09,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15769 conditions, 3070 events. 1924/3070 cut-off events. For 18849/19851 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 17966 event pairs, 206 based on Foata normal form. 436/3392 useless extension candidates. Maximal degree in co-relation 15731. Up to 1163 conditions per place. [2022-12-13 11:22:09,571 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 89 selfloop transitions, 17 changer transitions 16/138 dead transitions. [2022-12-13 11:22:09,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 1698 flow [2022-12-13 11:22:09,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:22:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:22:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2022-12-13 11:22:09,573 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5200803212851406 [2022-12-13 11:22:09,573 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2022-12-13 11:22:09,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2022-12-13 11:22:09,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:09,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2022-12-13 11:22:09,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 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 11:22:09,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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 11:22:09,576 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 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 11:22:09,576 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 787 flow. Second operand 6 states and 777 transitions. [2022-12-13 11:22:09,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 1698 flow [2022-12-13 11:22:09,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 138 transitions, 1614 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-13 11:22:09,635 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 695 flow [2022-12-13 11:22:09,635 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=723, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=695, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2022-12-13 11:22:09,636 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2022-12-13 11:22:09,636 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 695 flow [2022-12-13 11:22:09,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.5) internal successors, (729), 6 states have internal predecessors, (729), 0 states have call successors, (0), 0 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 11:22:09,636 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:09,636 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:09,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:22:09,636 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:09,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:09,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2048087051, now seen corresponding path program 1 times [2022-12-13 11:22:09,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:09,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764732128] [2022-12-13 11:22:09,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:09,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:09,761 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 11:22:09,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764732128] [2022-12-13 11:22:09,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764732128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:09,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:09,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:22:09,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893048625] [2022-12-13 11:22:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:09,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:22:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:09,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:22:09,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:22:09,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 249 [2022-12-13 11:22:09,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 695 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:22:09,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:09,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 249 [2022-12-13 11:22:09,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:10,071 INFO L130 PetriNetUnfolder]: 1164/1958 cut-off events. [2022-12-13 11:22:10,071 INFO L131 PetriNetUnfolder]: For 13117/13283 co-relation queries the response was YES. [2022-12-13 11:22:10,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 1958 events. 1164/1958 cut-off events. For 13117/13283 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10312 event pairs, 171 based on Foata normal form. 76/2020 useless extension candidates. Maximal degree in co-relation 10702. Up to 1146 conditions per place. [2022-12-13 11:22:10,077 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 46 selfloop transitions, 1 changer transitions 59/115 dead transitions. [2022-12-13 11:22:10,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 115 transitions, 1314 flow [2022-12-13 11:22:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:22:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:22:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 640 transitions. [2022-12-13 11:22:10,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5140562248995983 [2022-12-13 11:22:10,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 640 transitions. [2022-12-13 11:22:10,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 640 transitions. [2022-12-13 11:22:10,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:10,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 640 transitions. [2022-12-13 11:22:10,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 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 11:22:10,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:22:10,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 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 11:22:10,083 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 695 flow. Second operand 5 states and 640 transitions. [2022-12-13 11:22:10,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 115 transitions, 1314 flow [2022-12-13 11:22:10,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 115 transitions, 1053 flow, removed 43 selfloop flow, removed 11 redundant places. [2022-12-13 11:22:10,117 INFO L231 Difference]: Finished difference. Result has 68 places, 53 transitions, 389 flow [2022-12-13 11:22:10,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=68, PETRI_TRANSITIONS=53} [2022-12-13 11:22:10,118 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2022-12-13 11:22:10,118 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 53 transitions, 389 flow [2022-12-13 11:22:10,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:22:10,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:10,118 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:10,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:22:10,118 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:10,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -421255893, now seen corresponding path program 2 times [2022-12-13 11:22:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:10,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146504160] [2022-12-13 11:22:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:10,700 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 11:22:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:10,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146504160] [2022-12-13 11:22:10,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146504160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:10,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:10,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:22:10,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456000615] [2022-12-13 11:22:10,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:10,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:22:10,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:10,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:22:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:22:10,751 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 249 [2022-12-13 11:22:10,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 389 flow. Second operand has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 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 11:22:10,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:10,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 249 [2022-12-13 11:22:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:11,085 INFO L130 PetriNetUnfolder]: 718/1223 cut-off events. [2022-12-13 11:22:11,085 INFO L131 PetriNetUnfolder]: For 4280/4490 co-relation queries the response was YES. [2022-12-13 11:22:11,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5328 conditions, 1223 events. 718/1223 cut-off events. For 4280/4490 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6290 event pairs, 136 based on Foata normal form. 71/1239 useless extension candidates. Maximal degree in co-relation 5306. Up to 408 conditions per place. [2022-12-13 11:22:11,088 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 52 selfloop transitions, 6 changer transitions 57/125 dead transitions. [2022-12-13 11:22:11,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 125 transitions, 1140 flow [2022-12-13 11:22:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:22:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:22:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1107 transitions. [2022-12-13 11:22:11,090 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4939759036144578 [2022-12-13 11:22:11,090 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1107 transitions. [2022-12-13 11:22:11,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1107 transitions. [2022-12-13 11:22:11,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:11,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1107 transitions. [2022-12-13 11:22:11,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.0) internal successors, (1107), 9 states have internal predecessors, (1107), 0 states have call successors, (0), 0 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 11:22:11,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 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 11:22:11,094 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 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 11:22:11,094 INFO L175 Difference]: Start difference. First operand has 68 places, 53 transitions, 389 flow. Second operand 9 states and 1107 transitions. [2022-12-13 11:22:11,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 125 transitions, 1140 flow [2022-12-13 11:22:11,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 125 transitions, 1104 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 11:22:11,105 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 396 flow [2022-12-13 11:22:11,105 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=396, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2022-12-13 11:22:11,105 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2022-12-13 11:22:11,105 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 396 flow [2022-12-13 11:22:11,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 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 11:22:11,106 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:11,106 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:11,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:22:11,106 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash -425995367, now seen corresponding path program 3 times [2022-12-13 11:22:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:11,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325927422] [2022-12-13 11:22:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:22:11,208 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 11:22:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:22:11,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325927422] [2022-12-13 11:22:11,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325927422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:22:11,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:22:11,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:22:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450584770] [2022-12-13 11:22:11,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:22:11,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:22:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:22:11,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:22:11,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:22:11,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 249 [2022-12-13 11:22:11,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 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 11:22:11,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:22:11,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 249 [2022-12-13 11:22:11,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:22:11,410 INFO L130 PetriNetUnfolder]: 748/1292 cut-off events. [2022-12-13 11:22:11,410 INFO L131 PetriNetUnfolder]: For 5620/5744 co-relation queries the response was YES. [2022-12-13 11:22:11,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5879 conditions, 1292 events. 748/1292 cut-off events. For 5620/5744 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6551 event pairs, 214 based on Foata normal form. 57/1309 useless extension candidates. Maximal degree in co-relation 5857. Up to 679 conditions per place. [2022-12-13 11:22:11,415 INFO L137 encePairwiseOnDemand]: 245/249 looper letters, 38 selfloop transitions, 2 changer transitions 35/78 dead transitions. [2022-12-13 11:22:11,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 674 flow [2022-12-13 11:22:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:22:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:22:11,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2022-12-13 11:22:11,416 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5170682730923695 [2022-12-13 11:22:11,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2022-12-13 11:22:11,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2022-12-13 11:22:11,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:22:11,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2022-12-13 11:22:11,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 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 11:22:11,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 11:22:11,419 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 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 11:22:11,419 INFO L175 Difference]: Start difference. First operand has 72 places, 53 transitions, 396 flow. Second operand 4 states and 515 transitions. [2022-12-13 11:22:11,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 674 flow [2022-12-13 11:22:11,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 78 transitions, 648 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-12-13 11:22:11,432 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 226 flow [2022-12-13 11:22:11,432 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2022-12-13 11:22:11,432 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2022-12-13 11:22:11,432 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 226 flow [2022-12-13 11:22:11,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 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 11:22:11,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:22:11,433 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:11,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:22:11,433 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 11:22:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:22:11,433 INFO L85 PathProgramCache]: Analyzing trace with hash 308862613, now seen corresponding path program 4 times [2022-12-13 11:22:11,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:22:11,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388399766] [2022-12-13 11:22:11,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:22:11,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:22:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:22:11,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:22:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:22:11,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:22:11,505 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:22:11,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 11:22:11,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 11:22:11,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 11:22:11,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 11:22:11,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 11:22:11,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 11:22:11,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 11:22:11,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:22:11,508 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:22:11,512 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:22:11,513 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:22:11,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:22:11 BasicIcfg [2022-12-13 11:22:11,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:22:11,569 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:22:11,569 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:22:11,569 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:22:11,569 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:21:51" (3/4) ... [2022-12-13 11:22:11,570 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 11:22:11,624 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 11:22:11,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:22:11,624 INFO L158 Benchmark]: Toolchain (without parser) took 20925.42ms. Allocated memory was 144.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 100.5MB in the beginning and 724.6MB in the end (delta: -624.1MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-12-13 11:22:11,624 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 144.7MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:22:11,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.38ms. Allocated memory is still 144.7MB. Free memory was 100.5MB in the beginning and 71.9MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 11:22:11,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.09ms. Allocated memory is still 144.7MB. Free memory was 71.9MB in the beginning and 69.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 11:22:11,625 INFO L158 Benchmark]: Boogie Preprocessor took 21.31ms. Allocated memory is still 144.7MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:22:11,625 INFO L158 Benchmark]: RCFGBuilder took 577.86ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 67.0MB in the beginning and 137.8MB in the end (delta: -70.8MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2022-12-13 11:22:11,625 INFO L158 Benchmark]: TraceAbstraction took 19781.11ms. Allocated memory was 182.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 136.8MB in the beginning and 740.4MB in the end (delta: -603.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-12-13 11:22:11,625 INFO L158 Benchmark]: Witness Printer took 55.11ms. Allocated memory is still 2.0GB. Free memory was 740.4MB in the beginning and 724.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 11:22:11,626 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.12ms. Allocated memory is still 144.7MB. Free memory is still 109.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.38ms. Allocated memory is still 144.7MB. Free memory was 100.5MB in the beginning and 71.9MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.09ms. Allocated memory is still 144.7MB. Free memory was 71.9MB in the beginning and 69.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.31ms. Allocated memory is still 144.7MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 577.86ms. Allocated memory was 144.7MB in the beginning and 182.5MB in the end (delta: 37.7MB). Free memory was 67.0MB in the beginning and 137.8MB in the end (delta: -70.8MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19781.11ms. Allocated memory was 182.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 136.8MB in the beginning and 740.4MB in the end (delta: -603.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 55.11ms. Allocated memory is still 2.0GB. Free memory was 740.4MB in the beginning and 724.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 143 PlacesBefore, 43 PlacesAfterwards, 132 TransitionsBefore, 31 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 7934 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3737, independent: 3516, independent conditional: 0, independent unconditional: 3516, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1653, independent: 1619, independent conditional: 0, independent unconditional: 1619, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3737, independent: 1897, independent conditional: 0, independent unconditional: 1897, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1653, unknown conditional: 0, unknown unconditional: 1653] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=-2, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=-1, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=0, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=1, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 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) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 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) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 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 [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=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: 874]: 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: 870]: 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: 868]: 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: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 802 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 665 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1773 IncrementalHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 84 mSDtfsCounter, 1773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=787occurred in iteration=10, InterpolantAutomatonStates: 77, 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.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 11:22:11,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bbd172f-7dfd-46b4-9b39-a51b3f66af38/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