./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix043.oepc.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_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/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_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/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_4154e5d6-06d1-49be-a8ad-188e64039c1f/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 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 --- 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 18:22:35,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:22:35,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:22:35,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:22:35,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:22:35,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:22:35,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:22:35,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:22:35,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:22:35,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:22:35,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:22:35,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:22:35,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:22:35,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:22:35,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:22:35,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:22:35,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:22:35,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:22:35,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:22:35,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:22:35,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:22:35,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:22:35,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:22:35,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:22:35,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:22:35,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:22:35,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:22:35,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:22:35,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:22:35,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:22:35,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:22:35,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:22:35,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:22:35,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:22:35,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:22:35,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:22:35,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:22:35,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:22:35,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:22:35,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:22:35,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:22:35,652 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:22:35,670 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:22:35,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:22:35,671 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:22:35,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:22:35,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:22:35,672 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:22:35,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:22:35,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:22:35,672 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:22:35,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:22:35,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:22:35,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:22:35,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:22:35,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:22:35,673 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:22:35,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:22:35,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:22:35,674 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:22:35,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:22:35,674 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:22:35,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:22:35,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:22:35,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:22:35,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:22:35,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:22:35,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:22:35,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:22:35,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:22:35,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:22:35,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:22:35,676 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:22:35,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:22:35,676 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:22:35,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:22:35,677 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:22:35,677 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_4154e5d6-06d1-49be-a8ad-188e64039c1f/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_4154e5d6-06d1-49be-a8ad-188e64039c1f/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 -> 9bfd96daa3950021158d7079dc25a62741fa5d5a7f9e521049c1a78760db50f1 [2022-12-13 18:22:35,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:22:35,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:22:35,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:22:35,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:22:35,881 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:22:35,882 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2022-12-13 18:22:38,489 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:22:38,686 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:22:38,686 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/sv-benchmarks/c/pthread-wmm/mix043.oepc.i [2022-12-13 18:22:38,696 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/data/b72250fd1/8c17d11c693c4d708c9f7cec8b965ae6/FLAGe80d25ba1 [2022-12-13 18:22:38,707 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/data/b72250fd1/8c17d11c693c4d708c9f7cec8b965ae6 [2022-12-13 18:22:38,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:22:38,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:22:38,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:22:38,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:22:38,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:22:38,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:22:38" (1/1) ... [2022-12-13 18:22:38,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@963f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:38, skipping insertion in model container [2022-12-13 18:22:38,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:22:38" (1/1) ... [2022-12-13 18:22:38,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:22:38,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:22:38,863 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_4154e5d6-06d1-49be-a8ad-188e64039c1f/sv-benchmarks/c/pthread-wmm/mix043.oepc.i[945,958] [2022-12-13 18:22:38,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:38,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:38,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:22:39,018 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:22:39,028 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_4154e5d6-06d1-49be-a8ad-188e64039c1f/sv-benchmarks/c/pthread-wmm/mix043.oepc.i[945,958] [2022-12-13 18:22:39,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:22:39,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:22:39,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:22:39,091 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:22:39,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39 WrapperNode [2022-12-13 18:22:39,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:22:39,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:22:39,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:22:39,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:22:39,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,124 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-12-13 18:22:39,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:22:39,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:22:39,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:22:39,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:22:39,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,135 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,144 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:22:39,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:22:39,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:22:39,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:22:39,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (1/1) ... [2022-12-13 18:22:39,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:22:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:22:39,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:22:39,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:22:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:22:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 18:22:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:22:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:22:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:22:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 18:22:39,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 18:22:39,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 18:22:39,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 18:22:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 18:22:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 18:22:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 18:22:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 18:22:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:22:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 18:22:39,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:22:39,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:22:39,208 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 18:22:39,329 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:22:39,331 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:22:39,646 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:22:39,768 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:22:39,769 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:22:39,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:22:39 BoogieIcfgContainer [2022-12-13 18:22:39,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:22:39,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:22:39,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:22:39,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:22:39,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:22:38" (1/3) ... [2022-12-13 18:22:39,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1390b258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:22:39, skipping insertion in model container [2022-12-13 18:22:39,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:22:39" (2/3) ... [2022-12-13 18:22:39,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1390b258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:22:39, skipping insertion in model container [2022-12-13 18:22:39,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:22:39" (3/3) ... [2022-12-13 18:22:39,780 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2022-12-13 18:22:39,789 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 18:22:39,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:22:39,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 18:22:39,799 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:22:39,854 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:22:39,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-12-13 18:22:39,941 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-12-13 18:22:39,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:22:39,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-13 18:22:39,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-12-13 18:22:39,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-12-13 18:22:39,954 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:22:39,966 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2022-12-13 18:22:39,969 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2022-12-13 18:22:39,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2022-12-13 18:22:40,000 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-12-13 18:22:40,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:22:40,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-13 18:22:40,003 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2022-12-13 18:22:43,141 INFO L134 LiptonReduction]: Checked pairs total: 9001 [2022-12-13 18:22:43,141 INFO L136 LiptonReduction]: Total number of compositions: 117 [2022-12-13 18:22:43,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:22:43,156 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;@6e9eb3f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:22:43,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 18:22:43,157 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 18:22:43,158 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:22:43,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:43,158 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 18:22:43,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:43,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:43,162 INFO L85 PathProgramCache]: Analyzing trace with hash 576086, now seen corresponding path program 1 times [2022-12-13 18:22:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:43,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492120465] [2022-12-13 18:22:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:43,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:43,399 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 18:22:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:43,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492120465] [2022-12-13 18:22:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492120465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:43,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:43,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:22:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134522760] [2022-12-13 18:22:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:43,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:22:43,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:43,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:22:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:22:43,429 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 257 [2022-12-13 18:22:43,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 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 18:22:43,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:43,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 257 [2022-12-13 18:22:43,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:44,298 INFO L130 PetriNetUnfolder]: 5879/8107 cut-off events. [2022-12-13 18:22:44,299 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 18:22:44,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16251 conditions, 8107 events. 5879/8107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 40693 event pairs, 2239 based on Foata normal form. 0/7719 useless extension candidates. Maximal degree in co-relation 16239. Up to 6367 conditions per place. [2022-12-13 18:22:44,343 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-12-13 18:22:44,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 215 flow [2022-12-13 18:22:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:22:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:22:44,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-12-13 18:22:44,358 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5447470817120622 [2022-12-13 18:22:44,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2022-12-13 18:22:44,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2022-12-13 18:22:44,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:44,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2022-12-13 18:22:44,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 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 18:22:44,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:44,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:44,374 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 420 transitions. [2022-12-13 18:22:44,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 215 flow [2022-12-13 18:22:44,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:22:44,379 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2022-12-13 18:22:44,381 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, 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=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2022-12-13 18:22:44,384 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-13 18:22:44,384 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2022-12-13 18:22:44,384 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 18:22:44,384 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:44,384 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:22:44,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:22:44,385 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2025479736, now seen corresponding path program 1 times [2022-12-13 18:22:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:44,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361325988] [2022-12-13 18:22:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:44,567 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 18:22:44,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:44,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361325988] [2022-12-13 18:22:44,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361325988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:44,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:44,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:22:44,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612454216] [2022-12-13 18:22:44,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:44,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:22:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:44,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:22:44,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:22:44,584 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2022-12-13 18:22:44,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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 18:22:44,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:44,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2022-12-13 18:22:44,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:46,204 INFO L130 PetriNetUnfolder]: 14367/19536 cut-off events. [2022-12-13 18:22:46,204 INFO L131 PetriNetUnfolder]: For 1005/1005 co-relation queries the response was YES. [2022-12-13 18:22:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40520 conditions, 19536 events. 14367/19536 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 99913 event pairs, 5297 based on Foata normal form. 458/19994 useless extension candidates. Maximal degree in co-relation 40510. Up to 13505 conditions per place. [2022-12-13 18:22:46,281 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-13 18:22:46,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2022-12-13 18:22:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:22:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:22:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2022-12-13 18:22:46,283 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5175097276264592 [2022-12-13 18:22:46,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2022-12-13 18:22:46,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2022-12-13 18:22:46,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:46,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2022-12-13 18:22:46,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 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 18:22:46,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:46,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:46,286 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 399 transitions. [2022-12-13 18:22:46,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2022-12-13 18:22:46,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:22:46,287 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2022-12-13 18:22:46,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-13 18:22:46,288 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-13 18:22:46,288 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2022-12-13 18:22:46,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 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 18:22:46,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:46,288 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:22:46,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:22:46,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:46,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1634640020, now seen corresponding path program 1 times [2022-12-13 18:22:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:46,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743587094] [2022-12-13 18:22:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:46,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:46,412 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 18:22:46,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:46,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743587094] [2022-12-13 18:22:46,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743587094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:46,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:46,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:22:46,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027498543] [2022-12-13 18:22:46,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:46,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:22:46,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:46,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:22:46,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:22:46,431 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2022-12-13 18:22:46,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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 18:22:46,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:46,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2022-12-13 18:22:46,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:47,985 INFO L130 PetriNetUnfolder]: 13285/18086 cut-off events. [2022-12-13 18:22:47,985 INFO L131 PetriNetUnfolder]: For 5559/5559 co-relation queries the response was YES. [2022-12-13 18:22:48,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43686 conditions, 18086 events. 13285/18086 cut-off events. For 5559/5559 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 90148 event pairs, 3757 based on Foata normal form. 230/18316 useless extension candidates. Maximal degree in co-relation 43674. Up to 8781 conditions per place. [2022-12-13 18:22:48,042 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 18:22:48,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 314 flow [2022-12-13 18:22:48,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:22:48,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:22:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-12-13 18:22:48,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5038910505836576 [2022-12-13 18:22:48,044 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2022-12-13 18:22:48,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2022-12-13 18:22:48,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:48,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2022-12-13 18:22:48,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 18:22:48,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:48,048 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:48,048 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 518 transitions. [2022-12-13 18:22:48,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 314 flow [2022-12-13 18:22:48,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:22:48,082 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 152 flow [2022-12-13 18:22:48,083 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-12-13 18:22:48,083 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2022-12-13 18:22:48,083 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 152 flow [2022-12-13 18:22:48,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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 18:22:48,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:48,084 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:22:48,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:22:48,084 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:48,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash 822895008, now seen corresponding path program 1 times [2022-12-13 18:22:48,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:48,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675741833] [2022-12-13 18:22:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:48,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:48,235 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 18:22:48,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:48,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675741833] [2022-12-13 18:22:48,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675741833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:48,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:48,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:22:48,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822429380] [2022-12-13 18:22:48,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:48,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:22:48,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:22:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:22:48,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-12-13 18:22:48,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 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 18:22:48,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:48,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-12-13 18:22:48,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:49,641 INFO L130 PetriNetUnfolder]: 8939/13101 cut-off events. [2022-12-13 18:22:49,641 INFO L131 PetriNetUnfolder]: For 6224/6299 co-relation queries the response was YES. [2022-12-13 18:22:49,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31250 conditions, 13101 events. 8939/13101 cut-off events. For 6224/6299 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 78560 event pairs, 1713 based on Foata normal form. 997/13947 useless extension candidates. Maximal degree in co-relation 31235. Up to 5519 conditions per place. [2022-12-13 18:22:49,696 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 63 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2022-12-13 18:22:49,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 426 flow [2022-12-13 18:22:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:22:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:22:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2022-12-13 18:22:49,700 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.519455252918288 [2022-12-13 18:22:49,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2022-12-13 18:22:49,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2022-12-13 18:22:49,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:49,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2022-12-13 18:22:49,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 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 18:22:49,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:49,704 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:49,704 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 152 flow. Second operand 4 states and 534 transitions. [2022-12-13 18:22:49,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 426 flow [2022-12-13 18:22:49,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:22:49,727 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 195 flow [2022-12-13 18:22:49,728 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-12-13 18:22:49,728 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2022-12-13 18:22:49,728 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 195 flow [2022-12-13 18:22:49,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 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 18:22:49,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:49,729 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:22:49,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:22:49,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1038436418, now seen corresponding path program 1 times [2022-12-13 18:22:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:49,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879571890] [2022-12-13 18:22:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:49,939 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 18:22:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:49,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879571890] [2022-12-13 18:22:49,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879571890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:49,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:49,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:22:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016324550] [2022-12-13 18:22:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:49,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:22:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:49,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:22:49,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:22:49,951 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-12-13 18:22:49,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:49,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:49,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-12-13 18:22:49,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:51,022 INFO L130 PetriNetUnfolder]: 7159/10776 cut-off events. [2022-12-13 18:22:51,022 INFO L131 PetriNetUnfolder]: For 6938/6992 co-relation queries the response was YES. [2022-12-13 18:22:51,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31353 conditions, 10776 events. 7159/10776 cut-off events. For 6938/6992 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 65835 event pairs, 1638 based on Foata normal form. 635/11269 useless extension candidates. Maximal degree in co-relation 31335. Up to 4141 conditions per place. [2022-12-13 18:22:51,059 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 81 selfloop transitions, 10 changer transitions 0/100 dead transitions. [2022-12-13 18:22:51,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 100 transitions, 588 flow [2022-12-13 18:22:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:22:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:22:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2022-12-13 18:22:51,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5221789883268483 [2022-12-13 18:22:51,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2022-12-13 18:22:51,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2022-12-13 18:22:51,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:51,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2022-12-13 18:22:51,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 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 18:22:51,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:51,067 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:51,067 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 195 flow. Second operand 5 states and 671 transitions. [2022-12-13 18:22:51,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 100 transitions, 588 flow [2022-12-13 18:22:51,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 100 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:22:51,076 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 260 flow [2022-12-13 18:22:51,076 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-12-13 18:22:51,077 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2022-12-13 18:22:51,077 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 260 flow [2022-12-13 18:22:51,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:51,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:51,078 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:22:51,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:22:51,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1616786721, now seen corresponding path program 1 times [2022-12-13 18:22:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150438051] [2022-12-13 18:22:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:51,465 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 18:22:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:51,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150438051] [2022-12-13 18:22:51,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150438051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:51,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:51,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:22:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671227346] [2022-12-13 18:22:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:51,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:22:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:22:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:22:51,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 257 [2022-12-13 18:22:51,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 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 18:22:51,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:51,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 257 [2022-12-13 18:22:51,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:53,193 INFO L130 PetriNetUnfolder]: 12232/18690 cut-off events. [2022-12-13 18:22:53,194 INFO L131 PetriNetUnfolder]: For 31691/31811 co-relation queries the response was YES. [2022-12-13 18:22:53,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62307 conditions, 18690 events. 12232/18690 cut-off events. For 31691/31811 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 128242 event pairs, 3416 based on Foata normal form. 86/18653 useless extension candidates. Maximal degree in co-relation 62286. Up to 10447 conditions per place. [2022-12-13 18:22:53,256 INFO L137 encePairwiseOnDemand]: 249/257 looper letters, 93 selfloop transitions, 14 changer transitions 36/152 dead transitions. [2022-12-13 18:22:53,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 152 transitions, 1134 flow [2022-12-13 18:22:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:22:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:22:53,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2022-12-13 18:22:53,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5252918287937743 [2022-12-13 18:22:53,258 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 810 transitions. [2022-12-13 18:22:53,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions. [2022-12-13 18:22:53,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:53,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions. [2022-12-13 18:22:53,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 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 18:22:53,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:53,263 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:53,263 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 260 flow. Second operand 6 states and 810 transitions. [2022-12-13 18:22:53,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 152 transitions, 1134 flow [2022-12-13 18:22:53,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 152 transitions, 1073 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-13 18:22:53,294 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 362 flow [2022-12-13 18:22:53,294 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2022-12-13 18:22:53,295 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2022-12-13 18:22:53,295 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 362 flow [2022-12-13 18:22:53,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 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 18:22:53,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:53,296 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:22:53,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:22:53,296 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash -16665905, now seen corresponding path program 2 times [2022-12-13 18:22:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:53,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676630467] [2022-12-13 18:22:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:53,492 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 18:22:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:53,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676630467] [2022-12-13 18:22:53,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676630467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:53,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:53,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:22:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405404733] [2022-12-13 18:22:53,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:53,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:22:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:22:53,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:22:53,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-12-13 18:22:53,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 362 flow. Second operand has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 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 18:22:53,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:53,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-12-13 18:22:53,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:55,355 INFO L130 PetriNetUnfolder]: 10304/15732 cut-off events. [2022-12-13 18:22:55,355 INFO L131 PetriNetUnfolder]: For 27457/27674 co-relation queries the response was YES. [2022-12-13 18:22:55,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57932 conditions, 15732 events. 10304/15732 cut-off events. For 27457/27674 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 106670 event pairs, 1714 based on Foata normal form. 345/15838 useless extension candidates. Maximal degree in co-relation 57908. Up to 6542 conditions per place. [2022-12-13 18:22:55,419 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 134 selfloop transitions, 14 changer transitions 10/167 dead transitions. [2022-12-13 18:22:55,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 167 transitions, 1234 flow [2022-12-13 18:22:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:22:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:22:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2022-12-13 18:22:55,421 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.522697795071336 [2022-12-13 18:22:55,421 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2022-12-13 18:22:55,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2022-12-13 18:22:55,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:55,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2022-12-13 18:22:55,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 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 18:22:55,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:55,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:55,425 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 362 flow. Second operand 6 states and 806 transitions. [2022-12-13 18:22:55,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 167 transitions, 1234 flow [2022-12-13 18:22:55,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 167 transitions, 1225 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 18:22:55,473 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 437 flow [2022-12-13 18:22:55,473 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2022-12-13 18:22:55,474 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2022-12-13 18:22:55,474 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 437 flow [2022-12-13 18:22:55,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 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 18:22:55,474 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:55,474 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 18:22:55,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:22:55,474 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1381556248, now seen corresponding path program 1 times [2022-12-13 18:22:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:55,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192324562] [2022-12-13 18:22:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:55,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:55,894 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 18:22:55,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:55,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192324562] [2022-12-13 18:22:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192324562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:55,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:22:55,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249361547] [2022-12-13 18:22:55,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:22:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:22:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:22:55,921 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2022-12-13 18:22:55,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 437 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 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 18:22:55,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:55,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2022-12-13 18:22:55,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:22:57,696 INFO L130 PetriNetUnfolder]: 11447/17738 cut-off events. [2022-12-13 18:22:57,696 INFO L131 PetriNetUnfolder]: For 50747/51264 co-relation queries the response was YES. [2022-12-13 18:22:57,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71503 conditions, 17738 events. 11447/17738 cut-off events. For 50747/51264 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 124268 event pairs, 2166 based on Foata normal form. 336/17978 useless extension candidates. Maximal degree in co-relation 71486. Up to 6872 conditions per place. [2022-12-13 18:22:57,778 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 112 selfloop transitions, 12 changer transitions 50/183 dead transitions. [2022-12-13 18:22:57,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 183 transitions, 1672 flow [2022-12-13 18:22:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:22:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:22:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2022-12-13 18:22:57,781 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5108393551973318 [2022-12-13 18:22:57,781 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2022-12-13 18:22:57,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2022-12-13 18:22:57,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:22:57,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2022-12-13 18:22:57,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 0 states have call successors, (0), 0 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 18:22:57,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:57,785 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:22:57,785 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 437 flow. Second operand 7 states and 919 transitions. [2022-12-13 18:22:57,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 183 transitions, 1672 flow [2022-12-13 18:22:58,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 183 transitions, 1532 flow, removed 38 selfloop flow, removed 3 redundant places. [2022-12-13 18:22:58,391 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 499 flow [2022-12-13 18:22:58,392 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=499, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2022-12-13 18:22:58,392 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2022-12-13 18:22:58,392 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 499 flow [2022-12-13 18:22:58,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 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 18:22:58,392 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:22:58,392 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 18:22:58,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:22:58,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:22:58,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:22:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1781061930, now seen corresponding path program 2 times [2022-12-13 18:22:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:22:58,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458200692] [2022-12-13 18:22:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:22:58,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:22:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:22:58,527 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 18:22:58,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:22:58,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458200692] [2022-12-13 18:22:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458200692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:22:58,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:22:58,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:22:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621276867] [2022-12-13 18:22:58,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:22:58,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:22:58,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:22:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:22:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:22:58,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2022-12-13 18:22:58,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 499 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 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 18:22:58,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:22:58,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2022-12-13 18:22:58,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:23:01,191 INFO L130 PetriNetUnfolder]: 19836/29193 cut-off events. [2022-12-13 18:23:01,191 INFO L131 PetriNetUnfolder]: For 80452/80452 co-relation queries the response was YES. [2022-12-13 18:23:01,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122481 conditions, 29193 events. 19836/29193 cut-off events. For 80452/80452 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 193118 event pairs, 2195 based on Foata normal form. 16/29209 useless extension candidates. Maximal degree in co-relation 122461. Up to 11888 conditions per place. [2022-12-13 18:23:01,291 INFO L137 encePairwiseOnDemand]: 248/257 looper letters, 157 selfloop transitions, 20 changer transitions 74/251 dead transitions. [2022-12-13 18:23:01,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 251 transitions, 2336 flow [2022-12-13 18:23:01,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:23:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:23:01,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2022-12-13 18:23:01,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5129701686121919 [2022-12-13 18:23:01,294 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2022-12-13 18:23:01,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2022-12-13 18:23:01,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:23:01,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2022-12-13 18:23:01,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 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 18:23:01,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:01,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:01,297 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 499 flow. Second operand 6 states and 791 transitions. [2022-12-13 18:23:01,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 251 transitions, 2336 flow [2022-12-13 18:23:02,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 251 transitions, 2304 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 18:23:02,278 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 580 flow [2022-12-13 18:23:02,278 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2022-12-13 18:23:02,279 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2022-12-13 18:23:02,279 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 580 flow [2022-12-13 18:23:02,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 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 18:23:02,279 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:23:02,279 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 18:23:02,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:23:02,279 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:23:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1815492416, now seen corresponding path program 1 times [2022-12-13 18:23:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:02,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337049662] [2022-12-13 18:23:02,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:02,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:02,910 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 18:23:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:23:02,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337049662] [2022-12-13 18:23:02,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337049662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:23:02,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:23:02,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:23:02,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724438976] [2022-12-13 18:23:02,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:23:02,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:23:02,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:23:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:23:02,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:23:02,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2022-12-13 18:23:02,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 580 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 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 18:23:02,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:23:02,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2022-12-13 18:23:02,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:23:04,152 INFO L130 PetriNetUnfolder]: 5863/9525 cut-off events. [2022-12-13 18:23:04,152 INFO L131 PetriNetUnfolder]: For 29652/29983 co-relation queries the response was YES. [2022-12-13 18:23:04,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41307 conditions, 9525 events. 5863/9525 cut-off events. For 29652/29983 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 64616 event pairs, 1294 based on Foata normal form. 225/9638 useless extension candidates. Maximal degree in co-relation 41287. Up to 3808 conditions per place. [2022-12-13 18:23:04,210 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 113 selfloop transitions, 15 changer transitions 51/191 dead transitions. [2022-12-13 18:23:04,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 191 transitions, 1802 flow [2022-12-13 18:23:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:23:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:23:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2022-12-13 18:23:04,212 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5102834908282379 [2022-12-13 18:23:04,212 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2022-12-13 18:23:04,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2022-12-13 18:23:04,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:23:04,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2022-12-13 18:23:04,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 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 18:23:04,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:04,217 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:04,217 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 580 flow. Second operand 7 states and 918 transitions. [2022-12-13 18:23:04,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 191 transitions, 1802 flow [2022-12-13 18:23:04,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 191 transitions, 1616 flow, removed 33 selfloop flow, removed 5 redundant places. [2022-12-13 18:23:04,812 INFO L231 Difference]: Finished difference. Result has 77 places, 81 transitions, 664 flow [2022-12-13 18:23:04,812 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=664, PETRI_PLACES=77, PETRI_TRANSITIONS=81} [2022-12-13 18:23:04,813 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2022-12-13 18:23:04,813 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 81 transitions, 664 flow [2022-12-13 18:23:04,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 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 18:23:04,813 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:23:04,814 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 18:23:04,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:23:04,814 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:23:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:04,814 INFO L85 PathProgramCache]: Analyzing trace with hash 253957580, now seen corresponding path program 3 times [2022-12-13 18:23:04,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:04,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128700138] [2022-12-13 18:23:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:04,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:04,982 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 18:23:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:23:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128700138] [2022-12-13 18:23:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128700138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:23:04,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:23:04,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:23:04,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572354749] [2022-12-13 18:23:04,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:23:04,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:23:04,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:23:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:23:04,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:23:04,994 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 257 [2022-12-13 18:23:04,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 81 transitions, 664 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 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 18:23:04,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:23:04,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 257 [2022-12-13 18:23:04,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:23:05,993 INFO L130 PetriNetUnfolder]: 5476/8789 cut-off events. [2022-12-13 18:23:05,993 INFO L131 PetriNetUnfolder]: For 31504/31662 co-relation queries the response was YES. [2022-12-13 18:23:06,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37457 conditions, 8789 events. 5476/8789 cut-off events. For 31504/31662 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 58832 event pairs, 801 based on Foata normal form. 138/8772 useless extension candidates. Maximal degree in co-relation 37436. Up to 3569 conditions per place. [2022-12-13 18:23:06,020 INFO L137 encePairwiseOnDemand]: 250/257 looper letters, 128 selfloop transitions, 18 changer transitions 20/177 dead transitions. [2022-12-13 18:23:06,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 177 transitions, 1663 flow [2022-12-13 18:23:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:23:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:23:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 908 transitions. [2022-12-13 18:23:06,022 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5047248471372985 [2022-12-13 18:23:06,022 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 908 transitions. [2022-12-13 18:23:06,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 908 transitions. [2022-12-13 18:23:06,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:23:06,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 908 transitions. [2022-12-13 18:23:06,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 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 18:23:06,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:06,025 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:06,025 INFO L175 Difference]: Start difference. First operand has 77 places, 81 transitions, 664 flow. Second operand 7 states and 908 transitions. [2022-12-13 18:23:06,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 177 transitions, 1663 flow [2022-12-13 18:23:06,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 177 transitions, 1646 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 18:23:06,367 INFO L231 Difference]: Finished difference. Result has 80 places, 73 transitions, 593 flow [2022-12-13 18:23:06,367 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=593, PETRI_PLACES=80, PETRI_TRANSITIONS=73} [2022-12-13 18:23:06,367 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2022-12-13 18:23:06,368 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 73 transitions, 593 flow [2022-12-13 18:23:06,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 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 18:23:06,368 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:23:06,368 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, 1] [2022-12-13 18:23:06,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:23:06,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:23:06,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1985032027, now seen corresponding path program 1 times [2022-12-13 18:23:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:06,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516029901] [2022-12-13 18:23:06,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:06,494 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 18:23:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:23:06,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516029901] [2022-12-13 18:23:06,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516029901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:23:06,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:23:06,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:23:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929851834] [2022-12-13 18:23:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:23:06,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:23:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:23:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:23:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:23:06,514 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 257 [2022-12-13 18:23:06,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 73 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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 18:23:06,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:23:06,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 257 [2022-12-13 18:23:06,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:23:07,330 INFO L130 PetriNetUnfolder]: 5137/7972 cut-off events. [2022-12-13 18:23:07,331 INFO L131 PetriNetUnfolder]: For 30717/30717 co-relation queries the response was YES. [2022-12-13 18:23:07,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36475 conditions, 7972 events. 5137/7972 cut-off events. For 30717/30717 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 46247 event pairs, 1319 based on Foata normal form. 1/7973 useless extension candidates. Maximal degree in co-relation 36454. Up to 4621 conditions per place. [2022-12-13 18:23:07,359 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 90 selfloop transitions, 8 changer transitions 35/133 dead transitions. [2022-12-13 18:23:07,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 1305 flow [2022-12-13 18:23:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:23:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:23:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2022-12-13 18:23:07,361 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5068093385214008 [2022-12-13 18:23:07,361 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2022-12-13 18:23:07,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2022-12-13 18:23:07,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:23:07,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2022-12-13 18:23:07,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 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 18:23:07,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:07,366 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:07,366 INFO L175 Difference]: Start difference. First operand has 80 places, 73 transitions, 593 flow. Second operand 4 states and 521 transitions. [2022-12-13 18:23:07,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 1305 flow [2022-12-13 18:23:07,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 1211 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-13 18:23:07,528 INFO L231 Difference]: Finished difference. Result has 79 places, 63 transitions, 459 flow [2022-12-13 18:23:07,528 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=459, PETRI_PLACES=79, PETRI_TRANSITIONS=63} [2022-12-13 18:23:07,529 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 36 predicate places. [2022-12-13 18:23:07,529 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 63 transitions, 459 flow [2022-12-13 18:23:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 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 18:23:07,529 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:23:07,529 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, 1] [2022-12-13 18:23:07,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:23:07,529 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:23:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1406725685, now seen corresponding path program 2 times [2022-12-13 18:23:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:07,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270832994] [2022-12-13 18:23:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:07,647 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 18:23:07,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:23:07,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270832994] [2022-12-13 18:23:07,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270832994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:23:07,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:23:07,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:23:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028820928] [2022-12-13 18:23:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:23:07,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:23:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:23:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:23:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:23:07,657 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 257 [2022-12-13 18:23:07,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 63 transitions, 459 flow. Second operand has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:07,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:23:07,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 257 [2022-12-13 18:23:07,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:23:08,160 INFO L130 PetriNetUnfolder]: 2627/4115 cut-off events. [2022-12-13 18:23:08,160 INFO L131 PetriNetUnfolder]: For 12766/12772 co-relation queries the response was YES. [2022-12-13 18:23:08,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17794 conditions, 4115 events. 2627/4115 cut-off events. For 12766/12772 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 21632 event pairs, 561 based on Foata normal form. 7/4114 useless extension candidates. Maximal degree in co-relation 17772. Up to 1912 conditions per place. [2022-12-13 18:23:08,170 INFO L137 encePairwiseOnDemand]: 254/257 looper letters, 58 selfloop transitions, 1 changer transitions 59/120 dead transitions. [2022-12-13 18:23:08,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 120 transitions, 1089 flow [2022-12-13 18:23:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:23:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:23:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2022-12-13 18:23:08,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5214007782101168 [2022-12-13 18:23:08,173 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2022-12-13 18:23:08,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2022-12-13 18:23:08,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:23:08,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2022-12-13 18:23:08,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 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 18:23:08,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:08,177 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:08,178 INFO L175 Difference]: Start difference. First operand has 79 places, 63 transitions, 459 flow. Second operand 4 states and 536 transitions. [2022-12-13 18:23:08,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 120 transitions, 1089 flow [2022-12-13 18:23:08,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 120 transitions, 899 flow, removed 36 selfloop flow, removed 12 redundant places. [2022-12-13 18:23:08,226 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 285 flow [2022-12-13 18:23:08,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2022-12-13 18:23:08,226 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2022-12-13 18:23:08,227 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 285 flow [2022-12-13 18:23:08,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:08,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:23:08,227 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, 1] [2022-12-13 18:23:08,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:23:08,227 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:23:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash -27481467, now seen corresponding path program 3 times [2022-12-13 18:23:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:08,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659602849] [2022-12-13 18:23:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:23:08,850 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 18:23:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:23:08,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659602849] [2022-12-13 18:23:08,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659602849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:23:08,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:23:08,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:23:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854177427] [2022-12-13 18:23:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:23:08,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:23:08,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:23:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:23:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:23:08,934 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 257 [2022-12-13 18:23:08,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 285 flow. Second operand has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 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 18:23:08,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:23:08,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 257 [2022-12-13 18:23:08,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:23:09,247 INFO L130 PetriNetUnfolder]: 650/1074 cut-off events. [2022-12-13 18:23:09,247 INFO L131 PetriNetUnfolder]: For 2255/2298 co-relation queries the response was YES. [2022-12-13 18:23:09,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 1074 events. 650/1074 cut-off events. For 2255/2298 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4376 event pairs, 137 based on Foata normal form. 32/1102 useless extension candidates. Maximal degree in co-relation 3950. Up to 717 conditions per place. [2022-12-13 18:23:09,251 INFO L137 encePairwiseOnDemand]: 251/257 looper letters, 54 selfloop transitions, 7 changer transitions 34/98 dead transitions. [2022-12-13 18:23:09,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 661 flow [2022-12-13 18:23:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:23:09,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:23:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2022-12-13 18:23:09,253 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4947192884936076 [2022-12-13 18:23:09,253 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2022-12-13 18:23:09,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2022-12-13 18:23:09,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:23:09,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2022-12-13 18:23:09,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 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 18:23:09,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:09,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 257.0) internal successors, (2056), 8 states have internal predecessors, (2056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:23:09,256 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 285 flow. Second operand 7 states and 890 transitions. [2022-12-13 18:23:09,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 661 flow [2022-12-13 18:23:09,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 612 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-12-13 18:23:09,259 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 247 flow [2022-12-13 18:23:09,259 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2022-12-13 18:23:09,259 INFO L288 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2022-12-13 18:23:09,259 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 247 flow [2022-12-13 18:23:09,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 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 18:23:09,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:23:09,260 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, 1] [2022-12-13 18:23:09,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:23:09,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 18:23:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:23:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash -230763859, now seen corresponding path program 4 times [2022-12-13 18:23:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:23:09,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13707499] [2022-12-13 18:23:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:23:09,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:23:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:23:09,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:23:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:23:09,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:23:09,339 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:23:09,340 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 18:23:09,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 18:23:09,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 18:23:09,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 18:23:09,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 18:23:09,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 18:23:09,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 18:23:09,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:23:09,342 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 18:23:09,346 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 18:23:09,346 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:23:09,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:23:09 BasicIcfg [2022-12-13 18:23:09,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:23:09,395 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:23:09,395 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:23:09,395 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:23:09,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:22:39" (3/4) ... [2022-12-13 18:23:09,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 18:23:09,451 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:23:09,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:23:09,452 INFO L158 Benchmark]: Toolchain (without parser) took 30741.58ms. Allocated memory was 134.2MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 100.4MB in the beginning and 955.5MB in the end (delta: -855.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-13 18:23:09,452 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:23:09,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.36ms. Allocated memory is still 134.2MB. Free memory was 100.4MB in the beginning and 72.0MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 18:23:09,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.60ms. Allocated memory is still 134.2MB. Free memory was 72.0MB in the beginning and 69.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:23:09,452 INFO L158 Benchmark]: Boogie Preprocessor took 21.85ms. Allocated memory is still 134.2MB. Free memory was 69.5MB in the beginning and 67.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:23:09,453 INFO L158 Benchmark]: RCFGBuilder took 623.71ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 67.4MB in the beginning and 116.5MB in the end (delta: -49.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-12-13 18:23:09,453 INFO L158 Benchmark]: TraceAbstraction took 29620.29ms. Allocated memory was 161.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 116.5MB in the beginning and 972.3MB in the end (delta: -855.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-12-13 18:23:09,453 INFO L158 Benchmark]: Witness Printer took 56.73ms. Allocated memory is still 2.1GB. Free memory was 972.3MB in the beginning and 955.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 18:23:09,454 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.36ms. Allocated memory is still 134.2MB. Free memory was 100.4MB in the beginning and 72.0MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.60ms. Allocated memory is still 134.2MB. Free memory was 72.0MB in the beginning and 69.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.85ms. Allocated memory is still 134.2MB. Free memory was 69.5MB in the beginning and 67.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 623.71ms. Allocated memory was 134.2MB in the beginning and 161.5MB in the end (delta: 27.3MB). Free memory was 67.4MB in the beginning and 116.5MB in the end (delta: -49.1MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29620.29ms. Allocated memory was 161.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 116.5MB in the beginning and 972.3MB in the end (delta: -855.8MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 56.73ms. Allocated memory is still 2.1GB. Free memory was 972.3MB in the beginning and 955.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 147 PlacesBefore, 43 PlacesAfterwards, 136 TransitionsBefore, 30 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 9001 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3786, independent: 3551, independent conditional: 0, independent unconditional: 3551, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1839, independent: 1785, independent conditional: 0, independent unconditional: 1785, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3786, independent: 1766, independent conditional: 0, independent unconditional: 1766, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 1839, unknown conditional: 0, unknown unconditional: 1839] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-3, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-2, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2] - 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: 876]: 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. - UnprovableResult [Line: 878]: 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, 178 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: 29.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1115 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 952 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2286 IncrementalHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 94 mSDtfsCounter, 2286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=10, InterpolantAutomatonStates: 73, 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, 3.3s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 2395 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 18:23:09,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4154e5d6-06d1-49be-a8ad-188e64039c1f/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