./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/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_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/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_4add5f39-c5df-4bd0-899d-ef663b36fdbb/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 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 --- 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 13:36:52,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:36:52,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:36:52,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:36:52,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:36:52,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:36:52,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:36:52,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:36:52,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:36:52,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:36:52,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:36:52,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:36:52,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:36:52,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:36:52,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:36:52,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:36:52,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:36:52,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:36:52,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:36:52,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:36:52,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:36:52,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:36:52,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:36:52,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:36:52,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:36:52,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:36:52,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:36:52,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:36:52,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:36:52,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:36:52,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:36:52,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:36:52,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:36:52,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:36:52,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:36:52,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:36:52,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:36:52,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:36:52,723 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:36:52,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:36:52,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:36:52,724 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:36:52,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:36:52,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:36:52,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:36:52,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:36:52,740 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:36:52,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:36:52,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:36:52,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:36:52,741 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:36:52,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:36:52,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:36:52,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:36:52,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:36:52,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:36:52,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:36:52,742 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:36:52,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:36:52,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:36:52,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:36:52,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:36:52,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:36:52,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:36:52,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:36:52,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:36:52,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:36:52,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:36:52,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:36:52,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:36:52,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:36:52,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:36:52,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:36:52,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:36:52,749 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:36:52,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:36:52,749 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:36:52,749 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_4add5f39-c5df-4bd0-899d-ef663b36fdbb/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_4add5f39-c5df-4bd0-899d-ef663b36fdbb/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 -> 0c4e58b38f229da1b25a4c7b1c830f1f36e4dc5c1e18903f04a209f4b4cfa3c5 [2022-12-13 13:36:52,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:36:52,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:36:52,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:36:52,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:36:52,942 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:36:52,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix005.opt.i [2022-12-13 13:36:55,563 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:36:55,762 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:36:55,762 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/sv-benchmarks/c/pthread-wmm/mix005.opt.i [2022-12-13 13:36:55,772 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/data/bd7f3f390/ecc24fa84bda4f28a6837ce571585cbd/FLAG962af5b5c [2022-12-13 13:36:55,785 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/data/bd7f3f390/ecc24fa84bda4f28a6837ce571585cbd [2022-12-13 13:36:55,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:36:55,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:36:55,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:36:55,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:36:55,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:36:55,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:36:55" (1/1) ... [2022-12-13 13:36:55,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ffc218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:55, skipping insertion in model container [2022-12-13 13:36:55,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:36:55" (1/1) ... [2022-12-13 13:36:55,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:36:55,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:36:55,959 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_4add5f39-c5df-4bd0-899d-ef663b36fdbb/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2022-12-13 13:36:56,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:36:56,129 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:36:56,139 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_4add5f39-c5df-4bd0-899d-ef663b36fdbb/sv-benchmarks/c/pthread-wmm/mix005.opt.i[944,957] [2022-12-13 13:36:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:36:56,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:36:56,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:36:56,238 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:36:56,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56 WrapperNode [2022-12-13 13:36:56,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:36:56,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:36:56,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:36:56,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:36:56,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,276 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-13 13:36:56,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:36:56,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:36:56,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:36:56,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:36:56,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,296 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:36:56,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:36:56,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:36:56,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:36:56,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (1/1) ... [2022-12-13 13:36:56,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:36:56,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:36:56,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:36:56,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:36:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:36:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:36:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:36:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:36:56,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:36:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:36:56,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:36:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:36:56,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:36:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:36:56,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:36:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 13:36:56,354 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 13:36:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:36:56,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:36:56,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:36:56,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:36:56,356 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 13:36:56,452 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:36:56,454 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:36:56,719 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:36:56,794 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:36:56,794 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:36:56,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:36:56 BoogieIcfgContainer [2022-12-13 13:36:56,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:36:56,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:36:56,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:36:56,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:36:56,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:36:55" (1/3) ... [2022-12-13 13:36:56,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c78476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:36:56, skipping insertion in model container [2022-12-13 13:36:56,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:36:56" (2/3) ... [2022-12-13 13:36:56,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c78476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:36:56, skipping insertion in model container [2022-12-13 13:36:56,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:36:56" (3/3) ... [2022-12-13 13:36:56,802 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005.opt.i [2022-12-13 13:36:56,808 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:36:56,816 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:36:56,816 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:36:56,816 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:36:56,868 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:36:56,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 13:36:56,942 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 13:36:56,942 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:36:56,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:36:56,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-12-13 13:36:56,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-12-13 13:36:56,953 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:36:56,960 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 13:36:56,962 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 278 flow [2022-12-13 13:36:56,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 278 flow [2022-12-13 13:36:56,984 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-12-13 13:36:56,984 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:36:56,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:36:56,986 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2022-12-13 13:37:00,263 INFO L134 LiptonReduction]: Checked pairs total: 7607 [2022-12-13 13:37:00,263 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-12-13 13:37:00,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:37:00,278 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;@43c8909a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:37:00,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 13:37:00,282 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 13:37:00,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:37:00,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:00,284 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:00,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1376127878, now seen corresponding path program 1 times [2022-12-13 13:37:00,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:00,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524968241] [2022-12-13 13:37:00,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:00,599 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 13:37:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:00,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524968241] [2022-12-13 13:37:00,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524968241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:00,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:00,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:37:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611124951] [2022-12-13 13:37:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:00,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:00,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:00,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:37:00,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 256 [2022-12-13 13:37:00,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:00,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:00,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 256 [2022-12-13 13:37:00,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:01,137 INFO L130 PetriNetUnfolder]: 2594/3787 cut-off events. [2022-12-13 13:37:01,137 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-13 13:37:01,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7482 conditions, 3787 events. 2594/3787 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20006 event pairs, 518 based on Foata normal form. 0/3594 useless extension candidates. Maximal degree in co-relation 7470. Up to 2797 conditions per place. [2022-12-13 13:37:01,171 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-12-13 13:37:01,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2022-12-13 13:37:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:01,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:37:01,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-12-13 13:37:01,183 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5286458333333334 [2022-12-13 13:37:01,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-12-13 13:37:01,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-12-13 13:37:01,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:01,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-12-13 13:37:01,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:01,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:01,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:01,198 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 406 transitions. [2022-12-13 13:37:01,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2022-12-13 13:37:01,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:37:01,204 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-12-13 13:37:01,206 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 13:37:01,210 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 13:37:01,210 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-12-13 13:37:01,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:01,211 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:01,211 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:01,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:37:01,211 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash -390954963, now seen corresponding path program 1 times [2022-12-13 13:37:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:01,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060354317] [2022-12-13 13:37:01,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:01,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:01,430 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 13:37:01,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:01,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060354317] [2022-12-13 13:37:01,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060354317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:01,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:01,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:37:01,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852636917] [2022-12-13 13:37:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:01,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:01,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:37:01,451 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-12-13 13:37:01,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 13:37:01,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:01,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-12-13 13:37:01,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:02,638 INFO L130 PetriNetUnfolder]: 8249/11366 cut-off events. [2022-12-13 13:37:02,638 INFO L131 PetriNetUnfolder]: For 412/412 co-relation queries the response was YES. [2022-12-13 13:37:02,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23478 conditions, 11366 events. 8249/11366 cut-off events. For 412/412 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 56225 event pairs, 2997 based on Foata normal form. 248/11614 useless extension candidates. Maximal degree in co-relation 23468. Up to 8501 conditions per place. [2022-12-13 13:37:02,681 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 39 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2022-12-13 13:37:02,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow [2022-12-13 13:37:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:37:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-12-13 13:37:02,684 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50390625 [2022-12-13 13:37:02,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-12-13 13:37:02,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-12-13 13:37:02,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:02,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-12-13 13:37:02,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 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 13:37:02,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:02,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:02,689 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 387 transitions. [2022-12-13 13:37:02,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow [2022-12-13 13:37:02,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:37:02,696 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 122 flow [2022-12-13 13:37:02,696 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2022-12-13 13:37:02,697 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2022-12-13 13:37:02,697 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 122 flow [2022-12-13 13:37:02,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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 13:37:02,698 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:02,698 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:02,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:37:02,698 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash 765295720, now seen corresponding path program 1 times [2022-12-13 13:37:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:02,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871074867] [2022-12-13 13:37:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:02,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:02,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 13:37:02,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:02,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871074867] [2022-12-13 13:37:02,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871074867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:02,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:02,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:37:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170281816] [2022-12-13 13:37:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:02,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:37:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:02,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:37:02,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:37:02,871 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-12-13 13:37:02,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 13:37:02,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:02,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-12-13 13:37:02,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:03,872 INFO L130 PetriNetUnfolder]: 7489/10342 cut-off events. [2022-12-13 13:37:03,872 INFO L131 PetriNetUnfolder]: For 4014/4014 co-relation queries the response was YES. [2022-12-13 13:37:03,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26752 conditions, 10342 events. 7489/10342 cut-off events. For 4014/4014 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 50577 event pairs, 2285 based on Foata normal form. 176/10518 useless extension candidates. Maximal degree in co-relation 26740. Up to 5489 conditions per place. [2022-12-13 13:37:03,921 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 53 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2022-12-13 13:37:03,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 336 flow [2022-12-13 13:37:03,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:37:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:37:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2022-12-13 13:37:03,923 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4970703125 [2022-12-13 13:37:03,923 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2022-12-13 13:37:03,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2022-12-13 13:37:03,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:03,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2022-12-13 13:37:03,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 13:37:03,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:03,926 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:03,926 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 122 flow. Second operand 4 states and 509 transitions. [2022-12-13 13:37:03,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 336 flow [2022-12-13 13:37:03,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:37:03,944 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 174 flow [2022-12-13 13:37:03,944 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2022-12-13 13:37:03,945 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-12-13 13:37:03,945 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 174 flow [2022-12-13 13:37:03,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 13:37:03,946 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:03,946 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:03,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:37:03,947 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:03,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1688582587, now seen corresponding path program 1 times [2022-12-13 13:37:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:03,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987228089] [2022-12-13 13:37:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:03,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:04,078 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 13:37:04,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987228089] [2022-12-13 13:37:04,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987228089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:04,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:04,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:37:04,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233949956] [2022-12-13 13:37:04,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:04,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:37:04,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:37:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:37:04,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-12-13 13:37:04,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 13:37:04,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:04,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-12-13 13:37:04,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:04,958 INFO L130 PetriNetUnfolder]: 7291/10072 cut-off events. [2022-12-13 13:37:04,958 INFO L131 PetriNetUnfolder]: For 7119/7119 co-relation queries the response was YES. [2022-12-13 13:37:04,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27913 conditions, 10072 events. 7291/10072 cut-off events. For 7119/7119 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49223 event pairs, 1963 based on Foata normal form. 36/10108 useless extension candidates. Maximal degree in co-relation 27898. Up to 6991 conditions per place. [2022-12-13 13:37:05,008 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 57 selfloop transitions, 18 changer transitions 0/75 dead transitions. [2022-12-13 13:37:05,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 75 transitions, 446 flow [2022-12-13 13:37:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:37:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:37:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-12-13 13:37:05,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.505859375 [2022-12-13 13:37:05,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2022-12-13 13:37:05,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2022-12-13 13:37:05,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:05,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2022-12-13 13:37:05,016 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 13:37:05,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:05,019 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:05,019 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 174 flow. Second operand 4 states and 518 transitions. [2022-12-13 13:37:05,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 75 transitions, 446 flow [2022-12-13 13:37:05,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:37:05,031 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 273 flow [2022-12-13 13:37:05,031 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-13 13:37:05,032 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-12-13 13:37:05,032 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 273 flow [2022-12-13 13:37:05,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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 13:37:05,033 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:05,033 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:05,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:37:05,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash -806424270, now seen corresponding path program 1 times [2022-12-13 13:37:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:05,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009335064] [2022-12-13 13:37:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:05,189 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 13:37:05,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:05,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009335064] [2022-12-13 13:37:05,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009335064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:05,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:05,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:37:05,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755072847] [2022-12-13 13:37:05,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:05,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:05,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:37:05,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 256 [2022-12-13 13:37:05,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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 13:37:05,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:05,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 256 [2022-12-13 13:37:05,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:05,994 INFO L130 PetriNetUnfolder]: 4845/7128 cut-off events. [2022-12-13 13:37:05,995 INFO L131 PetriNetUnfolder]: For 8975/9711 co-relation queries the response was YES. [2022-12-13 13:37:06,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20510 conditions, 7128 events. 4845/7128 cut-off events. For 8975/9711 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 39406 event pairs, 1744 based on Foata normal form. 295/7176 useless extension candidates. Maximal degree in co-relation 20492. Up to 4032 conditions per place. [2022-12-13 13:37:06,026 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 38 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2022-12-13 13:37:06,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 421 flow [2022-12-13 13:37:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:37:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-12-13 13:37:06,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5221354166666666 [2022-12-13 13:37:06,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2022-12-13 13:37:06,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2022-12-13 13:37:06,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:06,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2022-12-13 13:37:06,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 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 13:37:06,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:06,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:06,030 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 273 flow. Second operand 3 states and 401 transitions. [2022-12-13 13:37:06,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 421 flow [2022-12-13 13:37:06,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 57 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:37:06,043 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 290 flow [2022-12-13 13:37:06,043 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-13 13:37:06,044 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2022-12-13 13:37:06,044 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 290 flow [2022-12-13 13:37:06,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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 13:37:06,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:06,044 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:06,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:37:06,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:06,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -59462050, now seen corresponding path program 1 times [2022-12-13 13:37:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127818402] [2022-12-13 13:37:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:06,193 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 13:37:06,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:06,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127818402] [2022-12-13 13:37:06,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127818402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:06,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:06,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:37:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063098939] [2022-12-13 13:37:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:06,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:37:06,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:06,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:37:06,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:37:06,205 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:37:06,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:06,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:06,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:37:06,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:06,900 INFO L130 PetriNetUnfolder]: 4715/7020 cut-off events. [2022-12-13 13:37:06,900 INFO L131 PetriNetUnfolder]: For 10248/10922 co-relation queries the response was YES. [2022-12-13 13:37:06,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20749 conditions, 7020 events. 4715/7020 cut-off events. For 10248/10922 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 41602 event pairs, 848 based on Foata normal form. 748/7418 useless extension candidates. Maximal degree in co-relation 20728. Up to 4494 conditions per place. [2022-12-13 13:37:06,925 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 80 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2022-12-13 13:37:06,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 104 transitions, 801 flow [2022-12-13 13:37:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:37:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:37:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-12-13 13:37:06,926 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5109375 [2022-12-13 13:37:06,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2022-12-13 13:37:06,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2022-12-13 13:37:06,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:06,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2022-12-13 13:37:06,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:06,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 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 13:37:06,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 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 13:37:06,930 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 290 flow. Second operand 5 states and 654 transitions. [2022-12-13 13:37:06,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 104 transitions, 801 flow [2022-12-13 13:37:06,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 104 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:37:06,939 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 355 flow [2022-12-13 13:37:06,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2022-12-13 13:37:06,940 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-12-13 13:37:06,940 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 355 flow [2022-12-13 13:37:06,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:06,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:06,941 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:06,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:37:06,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:06,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1620191346, now seen corresponding path program 1 times [2022-12-13 13:37:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:06,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266377265] [2022-12-13 13:37:06,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:07,117 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 13:37:07,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:07,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266377265] [2022-12-13 13:37:07,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266377265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:07,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:07,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:37:07,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383171332] [2022-12-13 13:37:07,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:07,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:37:07,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:07,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:37:07,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:37:07,125 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 256 [2022-12-13 13:37:07,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 13:37:07,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:07,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 256 [2022-12-13 13:37:07,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:08,169 INFO L130 PetriNetUnfolder]: 6846/10376 cut-off events. [2022-12-13 13:37:08,169 INFO L131 PetriNetUnfolder]: For 19291/19895 co-relation queries the response was YES. [2022-12-13 13:37:08,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39404 conditions, 10376 events. 6846/10376 cut-off events. For 19291/19895 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 65722 event pairs, 1328 based on Foata normal form. 337/10554 useless extension candidates. Maximal degree in co-relation 39380. Up to 5184 conditions per place. [2022-12-13 13:37:08,208 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 65 selfloop transitions, 3 changer transitions 25/104 dead transitions. [2022-12-13 13:37:08,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 104 transitions, 826 flow [2022-12-13 13:37:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:37:08,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:37:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2022-12-13 13:37:08,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.517578125 [2022-12-13 13:37:08,210 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2022-12-13 13:37:08,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2022-12-13 13:37:08,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:08,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2022-12-13 13:37:08,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:08,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:08,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:08,213 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 355 flow. Second operand 4 states and 530 transitions. [2022-12-13 13:37:08,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 104 transitions, 826 flow [2022-12-13 13:37:08,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 104 transitions, 814 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:37:08,249 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 347 flow [2022-12-13 13:37:08,249 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-12-13 13:37:08,250 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2022-12-13 13:37:08,250 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 347 flow [2022-12-13 13:37:08,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 13:37:08,251 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:08,251 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:08,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:37:08,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:08,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash 677291568, now seen corresponding path program 1 times [2022-12-13 13:37:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:08,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618919454] [2022-12-13 13:37:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:08,422 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 13:37:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:08,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618919454] [2022-12-13 13:37:08,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618919454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:08,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:08,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:37:08,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559420946] [2022-12-13 13:37:08,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:08,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:37:08,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:08,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:37:08,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:37:08,429 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 256 [2022-12-13 13:37:08,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 13:37:08,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:08,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 256 [2022-12-13 13:37:08,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:09,859 INFO L130 PetriNetUnfolder]: 7469/11381 cut-off events. [2022-12-13 13:37:09,859 INFO L131 PetriNetUnfolder]: For 23655/24153 co-relation queries the response was YES. [2022-12-13 13:37:09,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42458 conditions, 11381 events. 7469/11381 cut-off events. For 23655/24153 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 72344 event pairs, 3369 based on Foata normal form. 130/11048 useless extension candidates. Maximal degree in co-relation 42432. Up to 5589 conditions per place. [2022-12-13 13:37:09,894 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 53 selfloop transitions, 7 changer transitions 3/72 dead transitions. [2022-12-13 13:37:09,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 563 flow [2022-12-13 13:37:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:37:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:37:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-12-13 13:37:09,896 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.52734375 [2022-12-13 13:37:09,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-12-13 13:37:09,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-12-13 13:37:09,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:09,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-12-13 13:37:09,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 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 13:37:09,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:09,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 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 13:37:09,898 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 347 flow. Second operand 3 states and 405 transitions. [2022-12-13 13:37:09,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 563 flow [2022-12-13 13:37:10,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 72 transitions, 557 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 13:37:10,002 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 347 flow [2022-12-13 13:37:10,002 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-13 13:37:10,002 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2022-12-13 13:37:10,002 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 347 flow [2022-12-13 13:37:10,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 13:37:10,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:10,003 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:10,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:37:10,003 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:10,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash 437732177, now seen corresponding path program 1 times [2022-12-13 13:37:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957382903] [2022-12-13 13:37:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:10,197 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 13:37:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:10,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957382903] [2022-12-13 13:37:10,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957382903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:10,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:10,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:37:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277747413] [2022-12-13 13:37:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:10,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:37:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:10,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:37:10,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:37:10,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:37:10,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 347 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 13:37:10,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:10,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:37:10,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:11,109 INFO L130 PetriNetUnfolder]: 4806/7586 cut-off events. [2022-12-13 13:37:11,109 INFO L131 PetriNetUnfolder]: For 12378/13210 co-relation queries the response was YES. [2022-12-13 13:37:11,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27864 conditions, 7586 events. 4806/7586 cut-off events. For 12378/13210 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 49697 event pairs, 509 based on Foata normal form. 966/8274 useless extension candidates. Maximal degree in co-relation 27838. Up to 3243 conditions per place. [2022-12-13 13:37:11,131 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 104 selfloop transitions, 15 changer transitions 4/136 dead transitions. [2022-12-13 13:37:11,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 136 transitions, 1167 flow [2022-12-13 13:37:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:37:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:37:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 913 transitions. [2022-12-13 13:37:11,133 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5094866071428571 [2022-12-13 13:37:11,133 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 913 transitions. [2022-12-13 13:37:11,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 913 transitions. [2022-12-13 13:37:11,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:11,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 913 transitions. [2022-12-13 13:37:11,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.42857142857142) internal successors, (913), 7 states have internal predecessors, (913), 0 states have call successors, (0), 0 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 13:37:11,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 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 13:37:11,136 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 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 13:37:11,136 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 347 flow. Second operand 7 states and 913 transitions. [2022-12-13 13:37:11,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 136 transitions, 1167 flow [2022-12-13 13:37:11,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 136 transitions, 1133 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 13:37:11,146 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 460 flow [2022-12-13 13:37:11,146 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=460, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2022-12-13 13:37:11,147 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2022-12-13 13:37:11,147 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 460 flow [2022-12-13 13:37:11,147 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 13:37:11,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:11,147 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:11,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:37:11,148 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:11,148 INFO L85 PathProgramCache]: Analyzing trace with hash 564127142, now seen corresponding path program 1 times [2022-12-13 13:37:11,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:11,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477063103] [2022-12-13 13:37:11,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:11,245 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 13:37:11,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:11,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477063103] [2022-12-13 13:37:11,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477063103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:11,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:11,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:37:11,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733343835] [2022-12-13 13:37:11,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:11,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:37:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:11,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:37:11,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:37:11,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 256 [2022-12-13 13:37:11,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 13:37:11,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:11,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 256 [2022-12-13 13:37:11,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:12,396 INFO L130 PetriNetUnfolder]: 6628/10699 cut-off events. [2022-12-13 13:37:12,396 INFO L131 PetriNetUnfolder]: For 33580/34271 co-relation queries the response was YES. [2022-12-13 13:37:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49170 conditions, 10699 events. 6628/10699 cut-off events. For 33580/34271 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 74120 event pairs, 1471 based on Foata normal form. 237/10738 useless extension candidates. Maximal degree in co-relation 49140. Up to 5881 conditions per place. [2022-12-13 13:37:12,440 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 79 selfloop transitions, 3 changer transitions 25/117 dead transitions. [2022-12-13 13:37:12,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 117 transitions, 1122 flow [2022-12-13 13:37:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:37:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:37:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2022-12-13 13:37:12,442 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5205078125 [2022-12-13 13:37:12,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2022-12-13 13:37:12,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2022-12-13 13:37:12,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:12,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2022-12-13 13:37:12,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 13:37:12,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:12,445 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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 13:37:12,445 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 460 flow. Second operand 4 states and 533 transitions. [2022-12-13 13:37:12,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 117 transitions, 1122 flow [2022-12-13 13:37:12,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 117 transitions, 1001 flow, removed 47 selfloop flow, removed 2 redundant places. [2022-12-13 13:37:12,850 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 419 flow [2022-12-13 13:37:12,850 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=419, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2022-12-13 13:37:12,851 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2022-12-13 13:37:12,851 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 419 flow [2022-12-13 13:37:12,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 13:37:12,851 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:12,851 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 13:37:12,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:37:12,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash -568599169, now seen corresponding path program 1 times [2022-12-13 13:37:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:12,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903273068] [2022-12-13 13:37:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:13,060 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 13:37:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:13,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903273068] [2022-12-13 13:37:13,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903273068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:13,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:13,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:37:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264157242] [2022-12-13 13:37:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:13,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:37:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:37:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:37:13,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:37:13,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 13:37:13,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:13,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:37:13,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:14,161 INFO L130 PetriNetUnfolder]: 5474/8935 cut-off events. [2022-12-13 13:37:14,161 INFO L131 PetriNetUnfolder]: For 22176/23453 co-relation queries the response was YES. [2022-12-13 13:37:14,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36369 conditions, 8935 events. 5474/8935 cut-off events. For 22176/23453 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 64179 event pairs, 371 based on Foata normal form. 1044/9668 useless extension candidates. Maximal degree in co-relation 36338. Up to 2957 conditions per place. [2022-12-13 13:37:14,191 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 97 selfloop transitions, 19 changer transitions 39/166 dead transitions. [2022-12-13 13:37:14,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 166 transitions, 1473 flow [2022-12-13 13:37:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:37:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:37:14,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1173 transitions. [2022-12-13 13:37:14,195 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5091145833333334 [2022-12-13 13:37:14,195 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1173 transitions. [2022-12-13 13:37:14,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1173 transitions. [2022-12-13 13:37:14,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:14,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1173 transitions. [2022-12-13 13:37:14,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.33333333333334) internal successors, (1173), 9 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:14,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 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 13:37:14,203 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 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 13:37:14,203 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 419 flow. Second operand 9 states and 1173 transitions. [2022-12-13 13:37:14,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 166 transitions, 1473 flow [2022-12-13 13:37:14,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 166 transitions, 1451 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 13:37:14,425 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 487 flow [2022-12-13 13:37:14,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2022-12-13 13:37:14,426 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2022-12-13 13:37:14,426 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 487 flow [2022-12-13 13:37:14,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 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 13:37:14,426 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:14,427 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] [2022-12-13 13:37:14,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:37:14,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:14,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1574629962, now seen corresponding path program 1 times [2022-12-13 13:37:14,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:14,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146165188] [2022-12-13 13:37:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:14,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:14,624 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 13:37:14,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:14,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146165188] [2022-12-13 13:37:14,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146165188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:37:14,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:37:14,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:37:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847469315] [2022-12-13 13:37:14,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:37:14,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:37:14,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:14,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:37:14,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:37:14,642 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-13 13:37:14,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 58 transitions, 487 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 13:37:14,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:14,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-13 13:37:14,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:15,597 INFO L130 PetriNetUnfolder]: 4416/7416 cut-off events. [2022-12-13 13:37:15,598 INFO L131 PetriNetUnfolder]: For 21362/22628 co-relation queries the response was YES. [2022-12-13 13:37:15,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32342 conditions, 7416 events. 4416/7416 cut-off events. For 21362/22628 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 54194 event pairs, 344 based on Foata normal form. 675/7804 useless extension candidates. Maximal degree in co-relation 32308. Up to 2096 conditions per place. [2022-12-13 13:37:15,619 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 29 selfloop transitions, 17 changer transitions 103/153 dead transitions. [2022-12-13 13:37:15,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 153 transitions, 1360 flow [2022-12-13 13:37:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:37:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:37:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1406 transitions. [2022-12-13 13:37:15,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4992897727272727 [2022-12-13 13:37:15,622 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1406 transitions. [2022-12-13 13:37:15,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1406 transitions. [2022-12-13 13:37:15,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:37:15,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1406 transitions. [2022-12-13 13:37:15,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.81818181818181) internal successors, (1406), 11 states have internal predecessors, (1406), 0 states have call successors, (0), 0 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 13:37:15,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 256.0) internal successors, (3072), 12 states have internal predecessors, (3072), 0 states have call successors, (0), 0 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 13:37:15,627 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 256.0) internal successors, (3072), 12 states have internal predecessors, (3072), 0 states have call successors, (0), 0 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 13:37:15,627 INFO L175 Difference]: Start difference. First operand has 79 places, 58 transitions, 487 flow. Second operand 11 states and 1406 transitions. [2022-12-13 13:37:15,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 153 transitions, 1360 flow [2022-12-13 13:37:16,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 153 transitions, 1270 flow, removed 22 selfloop flow, removed 8 redundant places. [2022-12-13 13:37:16,109 INFO L231 Difference]: Finished difference. Result has 83 places, 38 transitions, 290 flow [2022-12-13 13:37:16,109 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=290, PETRI_PLACES=83, PETRI_TRANSITIONS=38} [2022-12-13 13:37:16,109 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2022-12-13 13:37:16,109 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 38 transitions, 290 flow [2022-12-13 13:37:16,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 13:37:16,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:16,110 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:16,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:37:16,110 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:37:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 200647201, now seen corresponding path program 1 times [2022-12-13 13:37:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:16,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354268120] [2022-12-13 13:37:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:37:16,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:37:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:37:16,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:37:16,195 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:37:16,196 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 13:37:16,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 13:37:16,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 13:37:16,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 13:37:16,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 13:37:16,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 13:37:16,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 13:37:16,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:37:16,199 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:16,205 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:37:16,205 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:37:16,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:37:16 BasicIcfg [2022-12-13 13:37:16,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:37:16,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:37:16,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:37:16,276 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:37:16,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:36:56" (3/4) ... [2022-12-13 13:37:16,278 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:37:16,357 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:37:16,357 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:37:16,358 INFO L158 Benchmark]: Toolchain (without parser) took 20568.72ms. Allocated memory was 123.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 76.2MB in the beginning and 1.0GB in the end (delta: -938.9MB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. [2022-12-13 13:37:16,358 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 91.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:37:16,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.05ms. Allocated memory is still 123.7MB. Free memory was 76.2MB in the beginning and 93.0MB in the end (delta: -16.8MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2022-12-13 13:37:16,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.36ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 90.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:37:16,359 INFO L158 Benchmark]: Boogie Preprocessor took 22.23ms. Allocated memory is still 123.7MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:37:16,359 INFO L158 Benchmark]: RCFGBuilder took 496.60ms. Allocated memory is still 123.7MB. Free memory was 88.1MB in the beginning and 51.0MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-12-13 13:37:16,360 INFO L158 Benchmark]: TraceAbstraction took 19477.70ms. Allocated memory was 123.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 50.3MB in the beginning and 1.0GB in the end (delta: -979.5MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. [2022-12-13 13:37:16,360 INFO L158 Benchmark]: Witness Printer took 81.77ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 13:37:16,362 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.17ms. Allocated memory is still 102.8MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 91.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.05ms. Allocated memory is still 123.7MB. Free memory was 76.2MB in the beginning and 93.0MB in the end (delta: -16.8MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.36ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 90.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.23ms. Allocated memory is still 123.7MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.60ms. Allocated memory is still 123.7MB. Free memory was 88.1MB in the beginning and 51.0MB in the end (delta: 37.0MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19477.70ms. Allocated memory was 123.7MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 50.3MB in the beginning and 1.0GB in the end (delta: -979.5MB). Peak memory consumption was 150.5MB. Max. memory is 16.1GB. * Witness Printer took 81.77ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 144 PlacesBefore, 41 PlacesAfterwards, 133 TransitionsBefore, 29 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 7607 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3618, independent: 3404, independent conditional: 0, independent unconditional: 3404, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1698, independent: 1654, independent conditional: 0, independent unconditional: 1654, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3618, independent: 1750, independent conditional: 0, independent unconditional: 1750, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1698, unknown conditional: 0, unknown unconditional: 1698] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t125; [L870] FCALL, FORK 0 pthread_create(&t125, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t125, ((void *)0), P0, ((void *)0))=-1, t125={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t126; [L872] FCALL, FORK 0 pthread_create(&t126, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t126, ((void *)0), P1, ((void *)0))=0, t125={5:0}, t126={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t127; [L874] FCALL, FORK 0 pthread_create(&t127, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t127, ((void *)0), P2, ((void *)0))=1, t125={5:0}, t126={6:0}, t127={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t128; [L876] FCALL, FORK 0 pthread_create(&t128, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t128, ((void *)0), P3, ((void *)0))=2, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L819] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L819] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t125={5:0}, t126={6:0}, t127={7:0}, t128={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 549 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1119 IncrementalHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 46 mSDtfsCounter, 1119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=11, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 13:37:16,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4add5f39-c5df-4bd0-899d-ef663b36fdbb/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