./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 --- 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-14 10:12:18,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:12:18,665 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:12:18,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:12:18,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:12:18,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:12:18,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:12:18,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:12:18,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:12:18,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:12:18,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:12:18,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:12:18,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:12:18,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:12:18,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:12:18,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:12:18,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:12:18,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:12:18,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:12:18,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:12:18,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:12:18,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:12:18,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:12:18,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:12:18,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:12:18,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:12:18,699 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:12:18,700 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:12:18,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:12:18,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:12:18,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:12:18,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:12:18,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:12:18,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:12:18,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:12:18,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:12:18,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:12:18,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:12:18,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:12:18,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:12:18,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:12:18,706 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 10:12:18,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:12:18,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:12:18,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:12:18,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:12:18,722 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:12:18,722 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:12:18,722 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:12:18,723 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:12:18,723 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:12:18,723 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:12:18,723 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:12:18,723 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:12:18,723 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:12:18,723 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:12:18,723 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:12:18,723 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:12:18,724 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:12:18,724 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:12:18,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:12:18,724 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:12:18,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:12:18,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:12:18,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:12:18,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:12:18,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:12:18,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:12:18,726 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:12:18,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:12:18,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:12:18,726 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:12:18,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:12:18,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:12:18,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:12:18,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/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_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 [2022-12-14 10:12:18,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:12:18,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:12:18,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:12:18,927 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:12:18,928 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:12:18,929 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-12-14 10:12:21,479 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:12:21,632 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:12:21,633 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-12-14 10:12:21,641 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/data/070bf5d65/02bdbb07e9dd4cd3be7e9fc38c8675df/FLAG12e214800 [2022-12-14 10:12:21,651 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/data/070bf5d65/02bdbb07e9dd4cd3be7e9fc38c8675df [2022-12-14 10:12:21,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:12:21,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:12:21,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:12:21,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:12:21,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:12:21,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c15be31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21, skipping insertion in model container [2022-12-14 10:12:21,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:12:21,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:12:21,794 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_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2022-12-14 10:12:21,823 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_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2022-12-14 10:12:21,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:12:21,856 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:12:21,865 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_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2022-12-14 10:12:21,876 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_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2022-12-14 10:12:21,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:12:21,905 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:12:21,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21 WrapperNode [2022-12-14 10:12:21,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:12:21,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:12:21,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:12:21,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:12:21,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,940 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 475 [2022-12-14 10:12:21,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:12:21,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:12:21,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:12:21,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:12:21,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,963 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:12:21,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:12:21,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:12:21,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:12:21,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (1/1) ... [2022-12-14 10:12:21,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:12:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:21,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:12:21,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:12:22,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:12:22,026 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-14 10:12:22,026 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-14 10:12:22,026 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-12-14 10:12:22,027 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-12-14 10:12:22,027 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-14 10:12:22,027 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-14 10:12:22,027 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-14 10:12:22,027 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-14 10:12:22,027 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-14 10:12:22,027 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-14 10:12:22,028 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-14 10:12:22,028 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-14 10:12:22,028 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-14 10:12:22,028 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-14 10:12:22,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:12:22,028 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-14 10:12:22,028 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-14 10:12:22,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:12:22,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:12:22,029 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-14 10:12:22,029 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-14 10:12:22,113 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:12:22,115 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:12:22,493 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:12:22,617 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:12:22,617 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 10:12:22,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:12:22 BoogieIcfgContainer [2022-12-14 10:12:22,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:12:22,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:12:22,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:12:22,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:12:22,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:12:21" (1/3) ... [2022-12-14 10:12:22,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229c2bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:12:22, skipping insertion in model container [2022-12-14 10:12:22,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:12:21" (2/3) ... [2022-12-14 10:12:22,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229c2bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:12:22, skipping insertion in model container [2022-12-14 10:12:22,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:12:22" (3/3) ... [2022-12-14 10:12:22,628 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-12-14 10:12:22,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:12:22,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 10:12:22,690 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:12:22,695 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=FINITE_AUTOMATA, 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;@2039352e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:12:22,695 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 10:12:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 95 states have (on average 1.5263157894736843) internal successors, (145), 100 states have internal predecessors, (145), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-12-14 10:12:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 10:12:22,705 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:22,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:22,706 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:22,710 INFO L85 PathProgramCache]: Analyzing trace with hash -17222052, now seen corresponding path program 1 times [2022-12-14 10:12:22,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:22,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103385188] [2022-12-14 10:12:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:22,959 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-14 10:12:22,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103385188] [2022-12-14 10:12:22,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103385188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:22,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:22,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:12:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361614575] [2022-12-14 10:12:22,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:22,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:22,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:22,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:22,994 INFO L87 Difference]: Start difference. First operand has 129 states, 95 states have (on average 1.5263157894736843) internal successors, (145), 100 states have internal predecessors, (145), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 10:12:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:23,119 INFO L93 Difference]: Finished difference Result 291 states and 426 transitions. [2022-12-14 10:12:23,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-12-14 10:12:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:23,130 INFO L225 Difference]: With dead ends: 291 [2022-12-14 10:12:23,130 INFO L226 Difference]: Without dead ends: 162 [2022-12-14 10:12:23,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:23,136 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 156 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:23,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 218 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-12-14 10:12:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-12-14 10:12:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.421487603305785) internal successors, (172), 124 states have internal predecessors, (172), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-12-14 10:12:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2022-12-14 10:12:23,186 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 28 [2022-12-14 10:12:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:23,187 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2022-12-14 10:12:23,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 10:12:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2022-12-14 10:12:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 10:12:23,190 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:23,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:23,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:12:23,191 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:23,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash -313366831, now seen corresponding path program 1 times [2022-12-14 10:12:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:23,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123546928] [2022-12-14 10:12:23,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:23,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:23,260 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-14 10:12:23,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:23,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123546928] [2022-12-14 10:12:23,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123546928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:23,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:23,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:12:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804815605] [2022-12-14 10:12:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:23,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:23,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:23,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:23,264 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 10:12:23,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:23,341 INFO L93 Difference]: Finished difference Result 314 states and 437 transitions. [2022-12-14 10:12:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-12-14 10:12:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:23,344 INFO L225 Difference]: With dead ends: 314 [2022-12-14 10:12:23,344 INFO L226 Difference]: Without dead ends: 233 [2022-12-14 10:12:23,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:23,346 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 154 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:23,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 203 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-12-14 10:12:23,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2022-12-14 10:12:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 184 states have internal predecessors, (253), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-12-14 10:12:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 315 transitions. [2022-12-14 10:12:23,372 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 315 transitions. Word has length 29 [2022-12-14 10:12:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:23,372 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 315 transitions. [2022-12-14 10:12:23,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 10:12:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 315 transitions. [2022-12-14 10:12:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 10:12:23,374 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:23,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:23,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 10:12:23,375 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:23,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:23,376 INFO L85 PathProgramCache]: Analyzing trace with hash 166969338, now seen corresponding path program 1 times [2022-12-14 10:12:23,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:23,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492291320] [2022-12-14 10:12:23,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:23,427 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-14 10:12:23,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:23,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492291320] [2022-12-14 10:12:23,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492291320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:23,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:23,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:12:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535498147] [2022-12-14 10:12:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:23,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:23,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:23,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:23,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:23,430 INFO L87 Difference]: Start difference. First operand 229 states and 315 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 10:12:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:23,496 INFO L93 Difference]: Finished difference Result 469 states and 643 transitions. [2022-12-14 10:12:23,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-12-14 10:12:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:23,499 INFO L225 Difference]: With dead ends: 469 [2022-12-14 10:12:23,499 INFO L226 Difference]: Without dead ends: 317 [2022-12-14 10:12:23,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:23,501 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 46 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:23,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 291 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-12-14 10:12:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 303. [2022-12-14 10:12:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 244 states have (on average 1.3852459016393444) internal successors, (338), 249 states have internal predecessors, (338), 38 states have call successors, (38), 20 states have call predecessors, (38), 19 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2022-12-14 10:12:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 412 transitions. [2022-12-14 10:12:23,532 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 412 transitions. Word has length 30 [2022-12-14 10:12:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:23,532 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 412 transitions. [2022-12-14 10:12:23,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 10:12:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 412 transitions. [2022-12-14 10:12:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 10:12:23,535 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:23,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:23,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 10:12:23,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1970867886, now seen corresponding path program 1 times [2022-12-14 10:12:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:23,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943196732] [2022-12-14 10:12:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:23,651 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-14 10:12:23,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:23,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943196732] [2022-12-14 10:12:23,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943196732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:23,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:23,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:23,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262177671] [2022-12-14 10:12:23,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:23,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:12:23,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:23,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:12:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:12:23,654 INFO L87 Difference]: Start difference. First operand 303 states and 412 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 10:12:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:24,028 INFO L93 Difference]: Finished difference Result 631 states and 901 transitions. [2022-12-14 10:12:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:12:24,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-12-14 10:12:24,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:24,032 INFO L225 Difference]: With dead ends: 631 [2022-12-14 10:12:24,032 INFO L226 Difference]: Without dead ends: 560 [2022-12-14 10:12:24,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:24,034 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 501 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:24,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 529 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:12:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-12-14 10:12:24,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 549. [2022-12-14 10:12:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 421 states have (on average 1.3776722090261282) internal successors, (580), 429 states have internal predecessors, (580), 83 states have call successors, (83), 44 states have call predecessors, (83), 43 states have return successors, (103), 76 states have call predecessors, (103), 81 states have call successors, (103) [2022-12-14 10:12:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 766 transitions. [2022-12-14 10:12:24,071 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 766 transitions. Word has length 37 [2022-12-14 10:12:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:24,071 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 766 transitions. [2022-12-14 10:12:24,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-14 10:12:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 766 transitions. [2022-12-14 10:12:24,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 10:12:24,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:24,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-14 10:12:24,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:12:24,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:24,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:24,074 INFO L85 PathProgramCache]: Analyzing trace with hash 464286221, now seen corresponding path program 1 times [2022-12-14 10:12:24,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:24,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561718455] [2022-12-14 10:12:24,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:24,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 10:12:24,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:24,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561718455] [2022-12-14 10:12:24,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561718455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:24,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:24,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:12:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951309584] [2022-12-14 10:12:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:24,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:24,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:24,124 INFO L87 Difference]: Start difference. First operand 549 states and 766 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 10:12:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:24,198 INFO L93 Difference]: Finished difference Result 712 states and 984 transitions. [2022-12-14 10:12:24,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2022-12-14 10:12:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:24,202 INFO L225 Difference]: With dead ends: 712 [2022-12-14 10:12:24,202 INFO L226 Difference]: Without dead ends: 554 [2022-12-14 10:12:24,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:24,204 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 32 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:24,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 323 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-12-14 10:12:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 543. [2022-12-14 10:12:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 415 states have (on average 1.363855421686747) internal successors, (566), 423 states have internal predecessors, (566), 83 states have call successors, (83), 44 states have call predecessors, (83), 43 states have return successors, (103), 76 states have call predecessors, (103), 81 states have call successors, (103) [2022-12-14 10:12:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 752 transitions. [2022-12-14 10:12:24,232 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 752 transitions. Word has length 43 [2022-12-14 10:12:24,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:24,233 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 752 transitions. [2022-12-14 10:12:24,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 10:12:24,233 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 752 transitions. [2022-12-14 10:12:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 10:12:24,234 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:24,234 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:24,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 10:12:24,235 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash 317826443, now seen corresponding path program 1 times [2022-12-14 10:12:24,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:24,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149655045] [2022-12-14 10:12:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:24,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 10:12:24,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:24,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149655045] [2022-12-14 10:12:24,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149655045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:24,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:24,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:12:24,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87927668] [2022-12-14 10:12:24,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:24,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:24,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:24,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:24,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:24,263 INFO L87 Difference]: Start difference. First operand 543 states and 752 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 10:12:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:24,340 INFO L93 Difference]: Finished difference Result 792 states and 1076 transitions. [2022-12-14 10:12:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:24,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-12-14 10:12:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:24,343 INFO L225 Difference]: With dead ends: 792 [2022-12-14 10:12:24,343 INFO L226 Difference]: Without dead ends: 589 [2022-12-14 10:12:24,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:24,344 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 140 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:24,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 201 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-12-14 10:12:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2022-12-14 10:12:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.341409691629956) internal successors, (609), 462 states have internal predecessors, (609), 87 states have call successors, (87), 47 states have call predecessors, (87), 46 states have return successors, (107), 80 states have call predecessors, (107), 85 states have call successors, (107) [2022-12-14 10:12:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 803 transitions. [2022-12-14 10:12:24,377 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 803 transitions. Word has length 46 [2022-12-14 10:12:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:24,377 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 803 transitions. [2022-12-14 10:12:24,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 10:12:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 803 transitions. [2022-12-14 10:12:24,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 10:12:24,378 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:24,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:24,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 10:12:24,379 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 697857022, now seen corresponding path program 1 times [2022-12-14 10:12:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:24,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558452764] [2022-12-14 10:12:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 10:12:24,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:24,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558452764] [2022-12-14 10:12:24,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558452764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:24,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:24,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 10:12:24,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991317668] [2022-12-14 10:12:24,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:24,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:12:24,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:12:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:12:24,426 INFO L87 Difference]: Start difference. First operand 589 states and 803 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 10:12:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:24,565 INFO L93 Difference]: Finished difference Result 629 states and 850 transitions. [2022-12-14 10:12:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:12:24,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-12-14 10:12:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:24,569 INFO L225 Difference]: With dead ends: 629 [2022-12-14 10:12:24,569 INFO L226 Difference]: Without dead ends: 626 [2022-12-14 10:12:24,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:12:24,570 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 264 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:24,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 199 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-12-14 10:12:24,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 588. [2022-12-14 10:12:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 454 states have (on average 1.3370044052863437) internal successors, (607), 461 states have internal predecessors, (607), 86 states have call successors, (86), 47 states have call predecessors, (86), 46 states have return successors, (107), 80 states have call predecessors, (107), 85 states have call successors, (107) [2022-12-14 10:12:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 800 transitions. [2022-12-14 10:12:24,616 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 800 transitions. Word has length 47 [2022-12-14 10:12:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:24,616 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 800 transitions. [2022-12-14 10:12:24,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 10:12:24,617 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-12-14 10:12:24,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 10:12:24,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:24,618 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:24,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:12:24,618 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:24,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 158071790, now seen corresponding path program 1 times [2022-12-14 10:12:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:24,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249347710] [2022-12-14 10:12:24,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 10:12:24,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:24,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249347710] [2022-12-14 10:12:24,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249347710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:24,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241730994] [2022-12-14 10:12:24,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:24,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:24,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:24,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:12:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:24,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 10:12:24,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:25,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:12:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 10:12:25,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241730994] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:12:25,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1031409679] [2022-12-14 10:12:25,236 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2022-12-14 10:12:25,237 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:12:25,240 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:12:25,245 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:12:25,245 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:12:26,450 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 85 for LOIs [2022-12-14 10:12:26,458 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 100 for LOIs [2022-12-14 10:12:26,468 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 216 for LOIs [2022-12-14 10:12:27,121 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:12:35,802 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10383#(and (= ~t1_pc~0 0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (= ~a_t~0 0) (= 0 ~t2_st~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-12-14 10:12:35,803 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:12:35,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:12:35,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-12-14 10:12:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61956370] [2022-12-14 10:12:35,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:12:35,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:12:35,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:35,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:12:35,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 10:12:35,804 INFO L87 Difference]: Start difference. First operand 588 states and 800 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 10:12:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:36,073 INFO L93 Difference]: Finished difference Result 1031 states and 1368 transitions. [2022-12-14 10:12:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:12:36,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-12-14 10:12:36,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:36,078 INFO L225 Difference]: With dead ends: 1031 [2022-12-14 10:12:36,079 INFO L226 Difference]: Without dead ends: 1028 [2022-12-14 10:12:36,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 10:12:36,080 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 261 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:36,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 803 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:12:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-12-14 10:12:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 797. [2022-12-14 10:12:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 631 states have (on average 1.3312202852614896) internal successors, (840), 640 states have internal predecessors, (840), 105 states have call successors, (105), 60 states have call predecessors, (105), 59 states have return successors, (126), 97 states have call predecessors, (126), 104 states have call successors, (126) [2022-12-14 10:12:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1071 transitions. [2022-12-14 10:12:36,155 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1071 transitions. Word has length 48 [2022-12-14 10:12:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:36,156 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1071 transitions. [2022-12-14 10:12:36,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-12-14 10:12:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1071 transitions. [2022-12-14 10:12:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 10:12:36,158 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:36,158 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:36,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:36,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 10:12:36,359 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:36,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1274156681, now seen corresponding path program 2 times [2022-12-14 10:12:36,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:36,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671264631] [2022-12-14 10:12:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 10:12:36,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671264631] [2022-12-14 10:12:36,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671264631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:36,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:36,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:12:36,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049699257] [2022-12-14 10:12:36,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:36,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:36,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:36,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:36,399 INFO L87 Difference]: Start difference. First operand 797 states and 1071 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 10:12:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:36,486 INFO L93 Difference]: Finished difference Result 1127 states and 1504 transitions. [2022-12-14 10:12:36,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:36,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2022-12-14 10:12:36,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:36,490 INFO L225 Difference]: With dead ends: 1127 [2022-12-14 10:12:36,490 INFO L226 Difference]: Without dead ends: 739 [2022-12-14 10:12:36,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:36,492 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 153 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:36,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 214 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-12-14 10:12:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 730. [2022-12-14 10:12:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 574 states have (on average 1.3222996515679442) internal successors, (759), 584 states have internal predecessors, (759), 99 states have call successors, (99), 56 states have call predecessors, (99), 55 states have return successors, (120), 90 states have call predecessors, (120), 98 states have call successors, (120) [2022-12-14 10:12:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 978 transitions. [2022-12-14 10:12:36,547 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 978 transitions. Word has length 61 [2022-12-14 10:12:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:36,547 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 978 transitions. [2022-12-14 10:12:36,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 10:12:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 978 transitions. [2022-12-14 10:12:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 10:12:36,548 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:36,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:36,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 10:12:36,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:36,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1535071580, now seen corresponding path program 1 times [2022-12-14 10:12:36,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:36,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891143251] [2022-12-14 10:12:36,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 10:12:36,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:36,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891143251] [2022-12-14 10:12:36,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891143251] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:36,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874389569] [2022-12-14 10:12:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:36,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:36,600 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:36,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:12:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:36,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 10:12:36,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 10:12:36,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:36,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874389569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:36,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:36,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-14 10:12:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130318949] [2022-12-14 10:12:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:36,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:36,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:36,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:36,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:36,692 INFO L87 Difference]: Start difference. First operand 730 states and 978 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 10:12:36,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:36,794 INFO L93 Difference]: Finished difference Result 1348 states and 1892 transitions. [2022-12-14 10:12:36,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:36,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-12-14 10:12:36,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:36,798 INFO L225 Difference]: With dead ends: 1348 [2022-12-14 10:12:36,798 INFO L226 Difference]: Without dead ends: 1031 [2022-12-14 10:12:36,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:36,799 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 146 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:36,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 229 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:36,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-12-14 10:12:36,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1024. [2022-12-14 10:12:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 786 states have (on average 1.3256997455470738) internal successors, (1042), 799 states have internal predecessors, (1042), 151 states have call successors, (151), 86 states have call predecessors, (151), 85 states have return successors, (190), 139 states have call predecessors, (190), 150 states have call successors, (190) [2022-12-14 10:12:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1383 transitions. [2022-12-14 10:12:36,855 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1383 transitions. Word has length 66 [2022-12-14 10:12:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:36,855 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1383 transitions. [2022-12-14 10:12:36,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-14 10:12:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1383 transitions. [2022-12-14 10:12:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 10:12:36,856 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:36,856 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:36,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:12:37,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 10:12:37,057 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1405079044, now seen corresponding path program 1 times [2022-12-14 10:12:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:37,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564827181] [2022-12-14 10:12:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 10:12:37,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:37,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564827181] [2022-12-14 10:12:37,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564827181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:37,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:37,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 10:12:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793320245] [2022-12-14 10:12:37,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:37,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:12:37,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:37,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:12:37,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:37,221 INFO L87 Difference]: Start difference. First operand 1024 states and 1383 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 10:12:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:37,544 INFO L93 Difference]: Finished difference Result 2030 states and 2836 transitions. [2022-12-14 10:12:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:12:37,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-12-14 10:12:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:37,551 INFO L225 Difference]: With dead ends: 2030 [2022-12-14 10:12:37,552 INFO L226 Difference]: Without dead ends: 1420 [2022-12-14 10:12:37,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:12:37,554 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 309 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:37,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 368 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:12:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-12-14 10:12:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1366. [2022-12-14 10:12:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1029 states have (on average 1.3177842565597668) internal successors, (1356), 1046 states have internal predecessors, (1356), 214 states have call successors, (214), 122 states have call predecessors, (214), 121 states have return successors, (280), 198 states have call predecessors, (280), 213 states have call successors, (280) [2022-12-14 10:12:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1850 transitions. [2022-12-14 10:12:37,646 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1850 transitions. Word has length 66 [2022-12-14 10:12:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:37,646 INFO L495 AbstractCegarLoop]: Abstraction has 1366 states and 1850 transitions. [2022-12-14 10:12:37,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 10:12:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1850 transitions. [2022-12-14 10:12:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-14 10:12:37,648 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:37,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:37,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 10:12:37,648 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:37,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1003439244, now seen corresponding path program 1 times [2022-12-14 10:12:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:37,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006785325] [2022-12-14 10:12:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 10:12:37,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:37,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006785325] [2022-12-14 10:12:37,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006785325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:37,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:37,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 10:12:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622714225] [2022-12-14 10:12:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:37,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:12:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:12:37,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:37,828 INFO L87 Difference]: Start difference. First operand 1366 states and 1850 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 10:12:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:38,228 INFO L93 Difference]: Finished difference Result 2811 states and 3930 transitions. [2022-12-14 10:12:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:12:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2022-12-14 10:12:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:38,238 INFO L225 Difference]: With dead ends: 2811 [2022-12-14 10:12:38,238 INFO L226 Difference]: Without dead ends: 1859 [2022-12-14 10:12:38,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-12-14 10:12:38,242 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 300 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:38,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 413 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:12:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-12-14 10:12:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2022-12-14 10:12:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1342 states have (on average 1.3077496274217586) internal successors, (1755), 1364 states have internal predecessors, (1755), 296 states have call successors, (296), 170 states have call predecessors, (296), 169 states have return successors, (392), 275 states have call predecessors, (392), 295 states have call successors, (392) [2022-12-14 10:12:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2443 transitions. [2022-12-14 10:12:38,373 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2443 transitions. Word has length 67 [2022-12-14 10:12:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:38,373 INFO L495 AbstractCegarLoop]: Abstraction has 1809 states and 2443 transitions. [2022-12-14 10:12:38,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 10:12:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2443 transitions. [2022-12-14 10:12:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-12-14 10:12:38,375 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:38,376 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 10:12:38,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1446754680, now seen corresponding path program 1 times [2022-12-14 10:12:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:38,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506673810] [2022-12-14 10:12:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:38,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 10:12:38,415 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:38,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506673810] [2022-12-14 10:12:38,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506673810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:38,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:38,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:12:38,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784971003] [2022-12-14 10:12:38,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:38,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:38,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:38,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:38,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:38,416 INFO L87 Difference]: Start difference. First operand 1809 states and 2443 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 10:12:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:38,637 INFO L93 Difference]: Finished difference Result 3324 states and 4570 transitions. [2022-12-14 10:12:38,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:38,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2022-12-14 10:12:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:38,644 INFO L225 Difference]: With dead ends: 3324 [2022-12-14 10:12:38,644 INFO L226 Difference]: Without dead ends: 2105 [2022-12-14 10:12:38,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:12:38,648 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 36 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:38,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 329 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2022-12-14 10:12:38,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1932. [2022-12-14 10:12:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1469 states have internal predecessors, (1908), 305 states have call successors, (305), 179 states have call predecessors, (305), 178 states have return successors, (401), 284 states have call predecessors, (401), 304 states have call successors, (401) [2022-12-14 10:12:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2614 transitions. [2022-12-14 10:12:38,798 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2614 transitions. Word has length 68 [2022-12-14 10:12:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:38,798 INFO L495 AbstractCegarLoop]: Abstraction has 1932 states and 2614 transitions. [2022-12-14 10:12:38,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-14 10:12:38,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2614 transitions. [2022-12-14 10:12:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 10:12:38,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:38,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-14 10:12:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 10:12:38,802 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash 521634260, now seen corresponding path program 1 times [2022-12-14 10:12:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:38,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106370101] [2022-12-14 10:12:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 10:12:38,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:38,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106370101] [2022-12-14 10:12:38,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106370101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:38,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592573221] [2022-12-14 10:12:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:38,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:38,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:38,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:12:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:38,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 10:12:38,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 10:12:38,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:38,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592573221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:38,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:38,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 10:12:38,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116496288] [2022-12-14 10:12:38,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:38,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:38,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:38,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:38,975 INFO L87 Difference]: Start difference. First operand 1932 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 10:12:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:39,159 INFO L93 Difference]: Finished difference Result 2059 states and 2773 transitions. [2022-12-14 10:12:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:39,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2022-12-14 10:12:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:39,165 INFO L225 Difference]: With dead ends: 2059 [2022-12-14 10:12:39,165 INFO L226 Difference]: Without dead ends: 1525 [2022-12-14 10:12:39,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:39,166 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 25 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:39,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 294 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-12-14 10:12:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2022-12-14 10:12:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1104 states have (on average 1.3278985507246377) internal successors, (1466), 1120 states have internal predecessors, (1466), 267 states have call successors, (267), 153 states have call predecessors, (267), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2022-12-14 10:12:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2097 transitions. [2022-12-14 10:12:39,277 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2097 transitions. Word has length 73 [2022-12-14 10:12:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:39,277 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 2097 transitions. [2022-12-14 10:12:39,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-14 10:12:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2097 transitions. [2022-12-14 10:12:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 10:12:39,280 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:39,280 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:39,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 10:12:39,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 10:12:39,481 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:39,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:39,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569580, now seen corresponding path program 1 times [2022-12-14 10:12:39,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:39,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73724199] [2022-12-14 10:12:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-12-14 10:12:39,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73724199] [2022-12-14 10:12:39,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73724199] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:39,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607066313] [2022-12-14 10:12:39,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:39,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:39,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:39,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:12:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:39,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 10:12:39,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 10:12:39,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:39,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607066313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:39,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:39,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 10:12:39,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268409091] [2022-12-14 10:12:39,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:39,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:39,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:39,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:39,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:39,677 INFO L87 Difference]: Start difference. First operand 1525 states and 2097 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:39,861 INFO L93 Difference]: Finished difference Result 2989 states and 4147 transitions. [2022-12-14 10:12:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:39,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-12-14 10:12:39,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:39,867 INFO L225 Difference]: With dead ends: 2989 [2022-12-14 10:12:39,867 INFO L226 Difference]: Without dead ends: 1866 [2022-12-14 10:12:39,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:39,870 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:39,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-12-14 10:12:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1810. [2022-12-14 10:12:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1351 states have (on average 1.313101406365655) internal successors, (1774), 1364 states have internal predecessors, (1774), 273 states have call successors, (273), 183 states have call predecessors, (273), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2022-12-14 10:12:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2416 transitions. [2022-12-14 10:12:40,000 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2416 transitions. Word has length 101 [2022-12-14 10:12:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:40,001 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 2416 transitions. [2022-12-14 10:12:40,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2416 transitions. [2022-12-14 10:12:40,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 10:12:40,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:40,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:40,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:40,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 10:12:40,205 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:40,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1932550509, now seen corresponding path program 1 times [2022-12-14 10:12:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:40,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836998625] [2022-12-14 10:12:40,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-12-14 10:12:40,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:40,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836998625] [2022-12-14 10:12:40,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836998625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:40,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008711269] [2022-12-14 10:12:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:40,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:40,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:40,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:40,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 10:12:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:40,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 10:12:40,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 10:12:40,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:40,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008711269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:40,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:40,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 10:12:40,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117117067] [2022-12-14 10:12:40,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:40,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:40,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:40,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:40,483 INFO L87 Difference]: Start difference. First operand 1810 states and 2416 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:40,701 INFO L93 Difference]: Finished difference Result 3450 states and 4662 transitions. [2022-12-14 10:12:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:40,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-12-14 10:12:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:40,710 INFO L225 Difference]: With dead ends: 3450 [2022-12-14 10:12:40,711 INFO L226 Difference]: Without dead ends: 2234 [2022-12-14 10:12:40,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:40,715 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:40,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2022-12-14 10:12:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1939. [2022-12-14 10:12:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1458 states have (on average 1.3237311385459534) internal successors, (1930), 1471 states have internal predecessors, (1930), 284 states have call successors, (284), 194 states have call predecessors, (284), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2022-12-14 10:12:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2594 transitions. [2022-12-14 10:12:40,876 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2594 transitions. Word has length 101 [2022-12-14 10:12:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:40,877 INFO L495 AbstractCegarLoop]: Abstraction has 1939 states and 2594 transitions. [2022-12-14 10:12:40,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2594 transitions. [2022-12-14 10:12:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 10:12:40,880 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:40,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:40,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 10:12:41,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:41,080 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:41,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1199324269, now seen corresponding path program 2 times [2022-12-14 10:12:41,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:41,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022330715] [2022-12-14 10:12:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 10:12:41,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:41,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022330715] [2022-12-14 10:12:41,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022330715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:41,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824830346] [2022-12-14 10:12:41,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:12:41,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:41,191 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:41,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:12:41,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:12:41,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:12:41,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 10:12:41,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 10:12:41,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:41,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824830346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:41,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:41,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-12-14 10:12:41,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595020248] [2022-12-14 10:12:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:41,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:12:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:41,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:12:41,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:12:41,301 INFO L87 Difference]: Start difference. First operand 1939 states and 2594 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 10:12:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:41,523 INFO L93 Difference]: Finished difference Result 3513 states and 4696 transitions. [2022-12-14 10:12:41,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:12:41,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-12-14 10:12:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:41,529 INFO L225 Difference]: With dead ends: 3513 [2022-12-14 10:12:41,529 INFO L226 Difference]: Without dead ends: 2093 [2022-12-14 10:12:41,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:12:41,533 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:41,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-12-14 10:12:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2024. [2022-12-14 10:12:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1518 states have (on average 1.3175230566534915) internal successors, (2000), 1537 states have internal predecessors, (2000), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-12-14 10:12:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2698 transitions. [2022-12-14 10:12:41,687 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2698 transitions. Word has length 101 [2022-12-14 10:12:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:41,687 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2698 transitions. [2022-12-14 10:12:41,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-14 10:12:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2698 transitions. [2022-12-14 10:12:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 10:12:41,690 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:41,690 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:41,695 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 10:12:41,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 10:12:41,891 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:41,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2072801964, now seen corresponding path program 2 times [2022-12-14 10:12:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:41,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943911196] [2022-12-14 10:12:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 10:12:42,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:42,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943911196] [2022-12-14 10:12:42,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943911196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:42,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315564718] [2022-12-14 10:12:42,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:12:42,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:42,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:42,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:42,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 10:12:42,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:12:42,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:12:42,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 10:12:42,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 10:12:42,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:12:42,550 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-14 10:12:42,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315564718] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:42,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 10:12:42,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 14 [2022-12-14 10:12:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695650229] [2022-12-14 10:12:42,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:42,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:12:42,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:42,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:12:42,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:12:42,552 INFO L87 Difference]: Start difference. First operand 2024 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 10:12:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:42,828 INFO L93 Difference]: Finished difference Result 3913 states and 5359 transitions. [2022-12-14 10:12:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:12:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-12-14 10:12:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:42,835 INFO L225 Difference]: With dead ends: 3913 [2022-12-14 10:12:42,835 INFO L226 Difference]: Without dead ends: 2536 [2022-12-14 10:12:42,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:12:42,838 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 89 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:42,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 217 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2022-12-14 10:12:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2452. [2022-12-14 10:12:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1907 states have (on average 1.2831672784478239) internal successors, (2447), 1929 states have internal predecessors, (2447), 294 states have call successors, (294), 232 states have call predecessors, (294), 250 states have return successors, (452), 291 states have call predecessors, (452), 294 states have call successors, (452) [2022-12-14 10:12:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3193 transitions. [2022-12-14 10:12:43,049 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3193 transitions. Word has length 101 [2022-12-14 10:12:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:43,050 INFO L495 AbstractCegarLoop]: Abstraction has 2452 states and 3193 transitions. [2022-12-14 10:12:43,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 10:12:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3193 transitions. [2022-12-14 10:12:43,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 10:12:43,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:43,054 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:43,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 10:12:43,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 10:12:43,254 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 453019885, now seen corresponding path program 1 times [2022-12-14 10:12:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:43,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569878606] [2022-12-14 10:12:43,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:43,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-12-14 10:12:43,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:43,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569878606] [2022-12-14 10:12:43,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569878606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:43,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345629845] [2022-12-14 10:12:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:43,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:43,324 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:43,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 10:12:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:43,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 10:12:43,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 10:12:43,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:43,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345629845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:43,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:43,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 10:12:43,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497078025] [2022-12-14 10:12:43,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:43,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:43,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:43,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:43,440 INFO L87 Difference]: Start difference. First operand 2452 states and 3193 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:43,691 INFO L93 Difference]: Finished difference Result 4637 states and 6117 transitions. [2022-12-14 10:12:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:43,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-12-14 10:12:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:43,702 INFO L225 Difference]: With dead ends: 4637 [2022-12-14 10:12:43,702 INFO L226 Difference]: Without dead ends: 2827 [2022-12-14 10:12:43,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:43,707 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:43,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 220 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-12-14 10:12:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2589. [2022-12-14 10:12:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2020 states have (on average 1.2900990099009901) internal successors, (2606), 2042 states have internal predecessors, (2606), 306 states have call successors, (306), 244 states have call predecessors, (306), 262 states have return successors, (464), 303 states have call predecessors, (464), 306 states have call successors, (464) [2022-12-14 10:12:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 3376 transitions. [2022-12-14 10:12:43,968 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 3376 transitions. Word has length 100 [2022-12-14 10:12:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:43,969 INFO L495 AbstractCegarLoop]: Abstraction has 2589 states and 3376 transitions. [2022-12-14 10:12:43,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 3376 transitions. [2022-12-14 10:12:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 10:12:43,972 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:43,972 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:43,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 10:12:44,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:44,173 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash 602041160, now seen corresponding path program 1 times [2022-12-14 10:12:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:44,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775857842] [2022-12-14 10:12:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-14 10:12:44,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:44,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775857842] [2022-12-14 10:12:44,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775857842] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:44,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226026357] [2022-12-14 10:12:44,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:44,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:44,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:44,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 10:12:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:44,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 10:12:44,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 10:12:44,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:44,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226026357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:44,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:44,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 10:12:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002686027] [2022-12-14 10:12:44,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:44,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:44,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:44,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:44,413 INFO L87 Difference]: Start difference. First operand 2589 states and 3376 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:44,683 INFO L93 Difference]: Finished difference Result 4975 states and 6674 transitions. [2022-12-14 10:12:44,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:44,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-12-14 10:12:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:44,691 INFO L225 Difference]: With dead ends: 4975 [2022-12-14 10:12:44,691 INFO L226 Difference]: Without dead ends: 3028 [2022-12-14 10:12:44,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:44,695 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:44,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 240 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2022-12-14 10:12:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2939. [2022-12-14 10:12:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2297 states have (on average 1.2742707879843274) internal successors, (2927), 2319 states have internal predecessors, (2927), 349 states have call successors, (349), 280 states have call predecessors, (349), 292 states have return successors, (541), 340 states have call predecessors, (541), 349 states have call successors, (541) [2022-12-14 10:12:44,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3817 transitions. [2022-12-14 10:12:44,914 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3817 transitions. Word has length 100 [2022-12-14 10:12:44,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:44,914 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 3817 transitions. [2022-12-14 10:12:44,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3817 transitions. [2022-12-14 10:12:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-14 10:12:44,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:44,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:44,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 10:12:45,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:45,118 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:45,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash -352847615, now seen corresponding path program 1 times [2022-12-14 10:12:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:45,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473191312] [2022-12-14 10:12:45,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 10:12:45,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:45,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473191312] [2022-12-14 10:12:45,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473191312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:45,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304067169] [2022-12-14 10:12:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:45,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:45,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:45,267 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:45,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 10:12:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:45,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 10:12:45,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 10:12:45,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:45,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304067169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:45,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:45,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 10:12:45,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183649557] [2022-12-14 10:12:45,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:45,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:45,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:45,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:45,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:45,386 INFO L87 Difference]: Start difference. First operand 2939 states and 3817 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:45,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:45,668 INFO L93 Difference]: Finished difference Result 4927 states and 6656 transitions. [2022-12-14 10:12:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:45,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-12-14 10:12:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:45,675 INFO L225 Difference]: With dead ends: 4927 [2022-12-14 10:12:45,675 INFO L226 Difference]: Without dead ends: 2920 [2022-12-14 10:12:45,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:45,679 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:45,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 228 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2022-12-14 10:12:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2895. [2022-12-14 10:12:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2257 states have (on average 1.2374833850243687) internal successors, (2793), 2275 states have internal predecessors, (2793), 349 states have call successors, (349), 280 states have call predecessors, (349), 288 states have return successors, (535), 340 states have call predecessors, (535), 349 states have call successors, (535) [2022-12-14 10:12:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3677 transitions. [2022-12-14 10:12:45,946 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3677 transitions. Word has length 100 [2022-12-14 10:12:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:45,946 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 3677 transitions. [2022-12-14 10:12:45,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-14 10:12:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3677 transitions. [2022-12-14 10:12:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-12-14 10:12:45,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:45,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:45,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:46,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 10:12:46,151 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:46,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1351835960, now seen corresponding path program 1 times [2022-12-14 10:12:46,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:46,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043437517] [2022-12-14 10:12:46,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:46,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-12-14 10:12:46,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043437517] [2022-12-14 10:12:46,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043437517] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038007473] [2022-12-14 10:12:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:46,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:46,258 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:46,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 10:12:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:46,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 10:12:46,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 10:12:46,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:46,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038007473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:46,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:46,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-12-14 10:12:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829488467] [2022-12-14 10:12:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:46,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:12:46,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:46,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:12:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:46,365 INFO L87 Difference]: Start difference. First operand 2895 states and 3677 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 10:12:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:46,672 INFO L93 Difference]: Finished difference Result 6742 states and 8676 transitions. [2022-12-14 10:12:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:12:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-12-14 10:12:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:46,684 INFO L225 Difference]: With dead ends: 6742 [2022-12-14 10:12:46,684 INFO L226 Difference]: Without dead ends: 3904 [2022-12-14 10:12:46,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:46,689 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 41 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:46,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 189 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:12:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2022-12-14 10:12:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3181. [2022-12-14 10:12:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 2493 states have (on average 1.2470918572001604) internal successors, (3109), 2512 states have internal predecessors, (3109), 374 states have call successors, (374), 305 states have call predecessors, (374), 313 states have return successors, (560), 364 states have call predecessors, (560), 374 states have call successors, (560) [2022-12-14 10:12:46,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4043 transitions. [2022-12-14 10:12:46,938 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4043 transitions. Word has length 101 [2022-12-14 10:12:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:46,938 INFO L495 AbstractCegarLoop]: Abstraction has 3181 states and 4043 transitions. [2022-12-14 10:12:46,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 10:12:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4043 transitions. [2022-12-14 10:12:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-12-14 10:12:46,940 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:46,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:46,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 10:12:47,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 10:12:47,141 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1391402660, now seen corresponding path program 1 times [2022-12-14 10:12:47,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:47,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416548127] [2022-12-14 10:12:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 10:12:47,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416548127] [2022-12-14 10:12:47,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416548127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819879092] [2022-12-14 10:12:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:47,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:47,247 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:47,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 10:12:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:47,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 10:12:47,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 10:12:47,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:47,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819879092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:47,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:47,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-14 10:12:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495754514] [2022-12-14 10:12:47,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:12:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:12:47,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:47,393 INFO L87 Difference]: Start difference. First operand 3181 states and 4043 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 10:12:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:47,821 INFO L93 Difference]: Finished difference Result 6925 states and 8850 transitions. [2022-12-14 10:12:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:12:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2022-12-14 10:12:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:47,829 INFO L225 Difference]: With dead ends: 6925 [2022-12-14 10:12:47,829 INFO L226 Difference]: Without dead ends: 4118 [2022-12-14 10:12:47,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:47,833 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 121 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:47,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 227 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2022-12-14 10:12:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3643. [2022-12-14 10:12:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 2891 states have (on average 1.2345209270148738) internal successors, (3569), 2920 states have internal predecessors, (3569), 397 states have call successors, (397), 338 states have call predecessors, (397), 354 states have return successors, (593), 385 states have call predecessors, (593), 397 states have call successors, (593) [2022-12-14 10:12:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4559 transitions. [2022-12-14 10:12:48,210 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4559 transitions. Word has length 102 [2022-12-14 10:12:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:48,210 INFO L495 AbstractCegarLoop]: Abstraction has 3643 states and 4559 transitions. [2022-12-14 10:12:48,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 10:12:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4559 transitions. [2022-12-14 10:12:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 10:12:48,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:48,213 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:48,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 10:12:48,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:48,413 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:48,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1144153186, now seen corresponding path program 1 times [2022-12-14 10:12:48,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:48,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432804873] [2022-12-14 10:12:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-12-14 10:12:48,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:48,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432804873] [2022-12-14 10:12:48,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432804873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:48,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:12:48,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:12:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674067657] [2022-12-14 10:12:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:48,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:12:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:12:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:12:48,513 INFO L87 Difference]: Start difference. First operand 3643 states and 4559 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 10:12:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:49,180 INFO L93 Difference]: Finished difference Result 9096 states and 11384 transitions. [2022-12-14 10:12:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:12:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2022-12-14 10:12:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:49,189 INFO L225 Difference]: With dead ends: 9096 [2022-12-14 10:12:49,189 INFO L226 Difference]: Without dead ends: 4771 [2022-12-14 10:12:49,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:12:49,195 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 80 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:49,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 281 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2022-12-14 10:12:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4597. [2022-12-14 10:12:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 3612 states have (on average 1.2134551495016612) internal successors, (4383), 3659 states have internal predecessors, (4383), 519 states have call successors, (519), 436 states have call predecessors, (519), 465 states have return successors, (789), 502 states have call predecessors, (789), 519 states have call successors, (789) [2022-12-14 10:12:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 5691 transitions. [2022-12-14 10:12:49,641 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 5691 transitions. Word has length 103 [2022-12-14 10:12:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:49,641 INFO L495 AbstractCegarLoop]: Abstraction has 4597 states and 5691 transitions. [2022-12-14 10:12:49,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-14 10:12:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 5691 transitions. [2022-12-14 10:12:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-12-14 10:12:49,644 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:49,644 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:49,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 10:12:49,644 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash -482084879, now seen corresponding path program 1 times [2022-12-14 10:12:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:49,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976513993] [2022-12-14 10:12:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-12-14 10:12:49,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976513993] [2022-12-14 10:12:49,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976513993] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:49,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835897550] [2022-12-14 10:12:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:49,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:49,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:49,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:49,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 10:12:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:49,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 10:12:49,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:12:49,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:12:49,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835897550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:12:49,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:12:49,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-12-14 10:12:49,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156587287] [2022-12-14 10:12:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:12:49,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:12:49,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:12:49,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:12:49,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:12:49,864 INFO L87 Difference]: Start difference. First operand 4597 states and 5691 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-14 10:12:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:12:50,616 INFO L93 Difference]: Finished difference Result 9058 states and 11289 transitions. [2022-12-14 10:12:50,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:12:50,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 103 [2022-12-14 10:12:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:12:50,627 INFO L225 Difference]: With dead ends: 9058 [2022-12-14 10:12:50,627 INFO L226 Difference]: Without dead ends: 5902 [2022-12-14 10:12:50,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:12:50,632 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 164 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:12:50,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 294 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:12:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2022-12-14 10:12:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 5570. [2022-12-14 10:12:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 4366 states have (on average 1.2052221713238662) internal successors, (5262), 4421 states have internal predecessors, (5262), 641 states have call successors, (641), 532 states have call predecessors, (641), 562 states have return successors, (1004), 617 states have call predecessors, (1004), 641 states have call successors, (1004) [2022-12-14 10:12:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 6907 transitions. [2022-12-14 10:12:51,136 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 6907 transitions. Word has length 103 [2022-12-14 10:12:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:12:51,136 INFO L495 AbstractCegarLoop]: Abstraction has 5570 states and 6907 transitions. [2022-12-14 10:12:51,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-14 10:12:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 6907 transitions. [2022-12-14 10:12:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-12-14 10:12:51,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:12:51,140 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:12:51,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 10:12:51,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 10:12:51,341 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:12:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:12:51,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1633722311, now seen corresponding path program 1 times [2022-12-14 10:12:51,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:12:51,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701236676] [2022-12-14 10:12:51,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:51,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:12:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 10:12:51,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:12:51,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701236676] [2022-12-14 10:12:51,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701236676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:12:51,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488411538] [2022-12-14 10:12:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:12:51,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:12:51,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:12:51,617 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:12:51,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 10:12:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:12:51,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 10:12:51,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:12:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:12:51,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:12:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 10:12:51,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488411538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:12:51,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1575108334] [2022-12-14 10:12:51,986 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-12-14 10:12:51,986 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:12:51,987 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:12:51,987 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:12:51,987 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:12:57,170 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 178 for LOIs [2022-12-14 10:13:00,716 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 62 for LOIs [2022-12-14 10:13:00,724 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 184 for LOIs [2022-12-14 10:13:00,769 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 71 for LOIs [2022-12-14 10:13:00,908 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2022-12-14 10:13:01,316 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 208 for LOIs [2022-12-14 10:13:02,197 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:13:20,856 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '181641#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 10:13:20,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:13:20,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:13:20,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2022-12-14 10:13:20,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344706174] [2022-12-14 10:13:20,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:13:20,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 10:13:20,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:13:20,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 10:13:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=4023, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 10:13:20,860 INFO L87 Difference]: Start difference. First operand 5570 states and 6907 transitions. Second operand has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 10:13:23,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:13:23,334 INFO L93 Difference]: Finished difference Result 9815 states and 12063 transitions. [2022-12-14 10:13:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-14 10:13:23,334 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 109 [2022-12-14 10:13:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:13:23,341 INFO L225 Difference]: With dead ends: 9815 [2022-12-14 10:13:23,342 INFO L226 Difference]: Without dead ends: 4242 [2022-12-14 10:13:23,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 310 SyntacticMatches, 10 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8134 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=1335, Invalid=17847, Unknown=0, NotChecked=0, Total=19182 [2022-12-14 10:13:23,351 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 960 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:13:23,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1861 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 10:13:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4242 states. [2022-12-14 10:13:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4242 to 3281. [2022-12-14 10:13:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 2594 states have (on average 1.1734772552043176) internal successors, (3044), 2629 states have internal predecessors, (3044), 347 states have call successors, (347), 315 states have call predecessors, (347), 339 states have return successors, (447), 336 states have call predecessors, (447), 347 states have call successors, (447) [2022-12-14 10:13:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 3838 transitions. [2022-12-14 10:13:23,648 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 3838 transitions. Word has length 109 [2022-12-14 10:13:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:13:23,648 INFO L495 AbstractCegarLoop]: Abstraction has 3281 states and 3838 transitions. [2022-12-14 10:13:23,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 10:13:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 3838 transitions. [2022-12-14 10:13:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-12-14 10:13:23,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:13:23,651 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:13:23,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 10:13:23,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 10:13:23,852 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:13:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:13:23,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1388062226, now seen corresponding path program 1 times [2022-12-14 10:13:23,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:13:23,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964166145] [2022-12-14 10:13:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:23,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:13:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:13:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-12-14 10:13:24,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:13:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964166145] [2022-12-14 10:13:24,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964166145] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:13:24,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076264811] [2022-12-14 10:13:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:13:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:13:24,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:13:24,098 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:13:24,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 10:13:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:13:24,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 10:13:24,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:13:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:13:24,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:13:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-12-14 10:13:24,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076264811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:13:24,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546212783] [2022-12-14 10:13:24,440 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-12-14 10:13:24,440 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:13:24,440 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:13:24,441 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:13:24,441 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:13:29,258 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 179 for LOIs [2022-12-14 10:13:36,274 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 63 for LOIs [2022-12-14 10:13:36,280 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 185 for LOIs [2022-12-14 10:13:36,325 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 72 for LOIs [2022-12-14 10:13:36,383 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 63 for LOIs [2022-12-14 10:13:36,653 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 209 for LOIs [2022-12-14 10:13:41,697 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:13:50,688 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 421 DAG size of output: 294 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:14:07,147 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '200848#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (= |#NULL.base| 0))' at error location [2022-12-14 10:14:07,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:14:07,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:14:07,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2022-12-14 10:14:07,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039326850] [2022-12-14 10:14:07,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:14:07,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 10:14:07,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:07,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 10:14:07,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=4863, Unknown=0, NotChecked=0, Total=5256 [2022-12-14 10:14:07,149 INFO L87 Difference]: Start difference. First operand 3281 states and 3838 transitions. Second operand has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 10:14:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:09,969 INFO L93 Difference]: Finished difference Result 6024 states and 7085 transitions. [2022-12-14 10:14:09,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-12-14 10:14:09,970 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 112 [2022-12-14 10:14:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:09,975 INFO L225 Difference]: With dead ends: 6024 [2022-12-14 10:14:09,975 INFO L226 Difference]: Without dead ends: 2892 [2022-12-14 10:14:09,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 314 SyntacticMatches, 12 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13809 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=1777, Invalid=29375, Unknown=0, NotChecked=0, Total=31152 [2022-12-14 10:14:09,984 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 1248 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 1858 mSolverCounterSat, 521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 521 IncrementalHoareTripleChecker+Valid, 1858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:09,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1538 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [521 Valid, 1858 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 10:14:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2022-12-14 10:14:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2305. [2022-12-14 10:14:10,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1826 states have (on average 1.1615553121577218) internal successors, (2121), 1851 states have internal predecessors, (2121), 237 states have call successors, (237), 221 states have call predecessors, (237), 241 states have return successors, (315), 232 states have call predecessors, (315), 237 states have call successors, (315) [2022-12-14 10:14:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 2673 transitions. [2022-12-14 10:14:10,209 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 2673 transitions. Word has length 112 [2022-12-14 10:14:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:10,209 INFO L495 AbstractCegarLoop]: Abstraction has 2305 states and 2673 transitions. [2022-12-14 10:14:10,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-12-14 10:14:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 2673 transitions. [2022-12-14 10:14:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-12-14 10:14:10,211 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:10,211 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:10,216 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 10:14:10,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:10,412 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:14:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:10,413 INFO L85 PathProgramCache]: Analyzing trace with hash -542754482, now seen corresponding path program 1 times [2022-12-14 10:14:10,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404378989] [2022-12-14 10:14:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:10,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 10:14:10,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:14:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404378989] [2022-12-14 10:14:10,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404378989] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:14:10,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966683597] [2022-12-14 10:14:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:10,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:10,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:14:10,801 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:14:10,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 10:14:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:10,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 10:14:10,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:14:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 10:14:11,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:14:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-14 10:14:11,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966683597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:14:11,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1849750327] [2022-12-14 10:14:11,928 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-12-14 10:14:11,928 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 10:14:11,928 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 10:14:11,928 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 10:14:11,928 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 10:14:20,351 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 112 for LOIs [2022-12-14 10:14:20,375 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 64 for LOIs [2022-12-14 10:14:20,381 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 112 for LOIs [2022-12-14 10:14:20,395 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 73 for LOIs [2022-12-14 10:14:20,467 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 108 for LOIs [2022-12-14 10:14:20,718 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 131 for LOIs [2022-12-14 10:14:20,747 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 10:14:35,882 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '213366#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-12-14 10:14:35,882 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 10:14:35,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:14:35,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 14] total 39 [2022-12-14 10:14:35,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458293556] [2022-12-14 10:14:35,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:14:35,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 10:14:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:35,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 10:14:35,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=7736, Unknown=0, NotChecked=0, Total=8372 [2022-12-14 10:14:35,885 INFO L87 Difference]: Start difference. First operand 2305 states and 2673 transitions. Second operand has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2022-12-14 10:14:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:46,525 INFO L93 Difference]: Finished difference Result 7067 states and 8335 transitions. [2022-12-14 10:14:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-12-14 10:14:46,526 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) Word has length 114 [2022-12-14 10:14:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:46,534 INFO L225 Difference]: With dead ends: 7067 [2022-12-14 10:14:46,534 INFO L226 Difference]: Without dead ends: 5076 [2022-12-14 10:14:46,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 308 SyntacticMatches, 15 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26558 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=6458, Invalid=57298, Unknown=0, NotChecked=0, Total=63756 [2022-12-14 10:14:46,544 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 3456 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 6574 mSolverCounterSat, 2528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 9102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2528 IncrementalHoareTripleChecker+Valid, 6574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:46,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 1818 Invalid, 9102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2528 Valid, 6574 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 10:14:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2022-12-14 10:14:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 2559. [2022-12-14 10:14:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2000 states have (on average 1.1525) internal successors, (2305), 2030 states have internal predecessors, (2305), 284 states have call successors, (284), 260 states have call predecessors, (284), 274 states have return successors, (339), 268 states have call predecessors, (339), 284 states have call successors, (339) [2022-12-14 10:14:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 2928 transitions. [2022-12-14 10:14:46,895 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 2928 transitions. Word has length 114 [2022-12-14 10:14:46,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:46,896 INFO L495 AbstractCegarLoop]: Abstraction has 2559 states and 2928 transitions. [2022-12-14 10:14:46,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 27 states have (on average 7.2592592592592595) internal successors, (196), 30 states have internal predecessors, (196), 17 states have call successors, (44), 12 states have call predecessors, (44), 19 states have return successors, (44), 17 states have call predecessors, (44), 17 states have call successors, (44) [2022-12-14 10:14:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 2928 transitions. [2022-12-14 10:14:46,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-12-14 10:14:46,897 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:46,897 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:46,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 10:14:47,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 10:14:47,098 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:14:47,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:47,098 INFO L85 PathProgramCache]: Analyzing trace with hash -71830771, now seen corresponding path program 1 times [2022-12-14 10:14:47,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:47,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015626491] [2022-12-14 10:14:47,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-14 10:14:47,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:14:47,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015626491] [2022-12-14 10:14:47,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015626491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:14:47,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:14:47,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 10:14:47,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343281653] [2022-12-14 10:14:47,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:14:47,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:14:47,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:47,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:14:47,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:14:47,194 INFO L87 Difference]: Start difference. First operand 2559 states and 2928 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 10:14:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:48,030 INFO L93 Difference]: Finished difference Result 6461 states and 7455 transitions. [2022-12-14 10:14:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:14:48,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 127 [2022-12-14 10:14:48,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:48,037 INFO L225 Difference]: With dead ends: 6461 [2022-12-14 10:14:48,037 INFO L226 Difference]: Without dead ends: 4725 [2022-12-14 10:14:48,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:14:48,039 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 229 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:48,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 551 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:14:48,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2022-12-14 10:14:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 3545. [2022-12-14 10:14:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3545 states, 2760 states have (on average 1.1605072463768116) internal successors, (3203), 2792 states have internal predecessors, (3203), 406 states have call successors, (406), 367 states have call predecessors, (406), 378 states have return successors, (472), 385 states have call predecessors, (472), 406 states have call successors, (472) [2022-12-14 10:14:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3545 states to 3545 states and 4081 transitions. [2022-12-14 10:14:48,502 INFO L78 Accepts]: Start accepts. Automaton has 3545 states and 4081 transitions. Word has length 127 [2022-12-14 10:14:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:48,502 INFO L495 AbstractCegarLoop]: Abstraction has 3545 states and 4081 transitions. [2022-12-14 10:14:48,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-12-14 10:14:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3545 states and 4081 transitions. [2022-12-14 10:14:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-14 10:14:48,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:48,504 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:48,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 10:14:48,504 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:14:48,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:48,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1541667770, now seen corresponding path program 1 times [2022-12-14 10:14:48,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:48,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801397928] [2022-12-14 10:14:48,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:48,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-14 10:14:48,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:14:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801397928] [2022-12-14 10:14:48,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801397928] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:14:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911627653] [2022-12-14 10:14:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:48,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:48,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:14:48,586 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:14:48,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 10:14:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:48,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 10:14:48,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:14:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-12-14 10:14:48,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:14:48,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911627653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:14:48,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:14:48,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-14 10:14:48,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460023506] [2022-12-14 10:14:48,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:14:48,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:14:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:14:48,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:14:48,684 INFO L87 Difference]: Start difference. First operand 3545 states and 4081 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-14 10:14:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:49,168 INFO L93 Difference]: Finished difference Result 6494 states and 7458 transitions. [2022-12-14 10:14:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:14:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2022-12-14 10:14:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:49,173 INFO L225 Difference]: With dead ends: 6494 [2022-12-14 10:14:49,173 INFO L226 Difference]: Without dead ends: 3318 [2022-12-14 10:14:49,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:14:49,178 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 69 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:49,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:14:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2022-12-14 10:14:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 3219. [2022-12-14 10:14:49,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2498 states have (on average 1.1269015212169735) internal successors, (2815), 2531 states have internal predecessors, (2815), 376 states have call successors, (376), 333 states have call predecessors, (376), 344 states have return successors, (438), 354 states have call predecessors, (438), 376 states have call successors, (438) [2022-12-14 10:14:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 3629 transitions. [2022-12-14 10:14:49,643 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 3629 transitions. Word has length 158 [2022-12-14 10:14:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:49,644 INFO L495 AbstractCegarLoop]: Abstraction has 3219 states and 3629 transitions. [2022-12-14 10:14:49,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-14 10:14:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 3629 transitions. [2022-12-14 10:14:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-14 10:14:49,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:49,646 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:49,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 10:14:49,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:49,847 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:14:49,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash -400276820, now seen corresponding path program 1 times [2022-12-14 10:14:49,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:49,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939965219] [2022-12-14 10:14:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-14 10:14:49,956 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:14:49,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939965219] [2022-12-14 10:14:49,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939965219] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:14:49,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241105059] [2022-12-14 10:14:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:49,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:49,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:14:49,957 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:14:49,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 10:14:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:50,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 10:14:50,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:14:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-12-14 10:14:50,058 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:14:50,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241105059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:14:50,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:14:50,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-12-14 10:14:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228841126] [2022-12-14 10:14:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:14:50,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:14:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:50,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:14:50,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:14:50,059 INFO L87 Difference]: Start difference. First operand 3219 states and 3629 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-14 10:14:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:50,411 INFO L93 Difference]: Finished difference Result 4661 states and 5242 transitions. [2022-12-14 10:14:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:14:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 159 [2022-12-14 10:14:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:50,414 INFO L225 Difference]: With dead ends: 4661 [2022-12-14 10:14:50,414 INFO L226 Difference]: Without dead ends: 1860 [2022-12-14 10:14:50,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:14:50,416 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:50,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 328 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:14:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-12-14 10:14:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1794. [2022-12-14 10:14:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1400 states have (on average 1.1107142857142858) internal successors, (1555), 1418 states have internal predecessors, (1555), 203 states have call successors, (203), 181 states have call predecessors, (203), 190 states have return successors, (241), 194 states have call predecessors, (241), 203 states have call successors, (241) [2022-12-14 10:14:50,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 1999 transitions. [2022-12-14 10:14:50,658 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 1999 transitions. Word has length 159 [2022-12-14 10:14:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:50,658 INFO L495 AbstractCegarLoop]: Abstraction has 1794 states and 1999 transitions. [2022-12-14 10:14:50,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-14 10:14:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 1999 transitions. [2022-12-14 10:14:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-12-14 10:14:50,659 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:14:50,659 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:14:50,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 10:14:50,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:50,861 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 10:14:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:14:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 881229656, now seen corresponding path program 1 times [2022-12-14 10:14:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:14:50,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191652047] [2022-12-14 10:14:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:50,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:14:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-12-14 10:14:50,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:14:50,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191652047] [2022-12-14 10:14:50,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191652047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:14:50,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512247119] [2022-12-14 10:14:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:14:50,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:50,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:14:50,988 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:14:50,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 10:14:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:14:51,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 10:14:51,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:14:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-14 10:14:51,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:14:51,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512247119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:14:51,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:14:51,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-12-14 10:14:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790152925] [2022-12-14 10:14:51,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:14:51,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 10:14:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:14:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 10:14:51,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 10:14:51,106 INFO L87 Difference]: Start difference. First operand 1794 states and 1999 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-14 10:14:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:14:51,401 INFO L93 Difference]: Finished difference Result 2373 states and 2639 transitions. [2022-12-14 10:14:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:14:51,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 160 [2022-12-14 10:14:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:14:51,402 INFO L225 Difference]: With dead ends: 2373 [2022-12-14 10:14:51,402 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 10:14:51,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:14:51,404 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 147 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:14:51,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 274 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:14:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 10:14:51,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 10:14:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-14 10:14:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 10:14:51,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2022-12-14 10:14:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:14:51,405 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 10:14:51,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-12-14 10:14:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 10:14:51,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 10:14:51,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-14 10:14:51,408 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-14 10:14:51,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 10:14:51,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:14:51,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 10:15:03,156 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 503 DAG size of output: 460 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-14 10:15:20,781 WARN L233 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 503 DAG size of output: 460 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-14 10:15:35,613 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 597 DAG size of output: 195 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 10:15:42,237 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 602 DAG size of output: 200 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 10:15:53,582 WARN L233 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 645 DAG size of output: 175 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 10:16:06,734 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 742 DAG size of output: 185 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-12-14 10:16:22,981 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 820 830) no Hoare annotation was computed. [2022-12-14 10:16:22,981 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 820 830) no Hoare annotation was computed. [2022-12-14 10:16:22,982 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 820 830) the Hoare annotation is: (let ((.cse42 (= ~E_1~0 1)) (.cse29 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse38 (+ ~local~0 1)) (.cse4 (= ~E_2~0 1)) (.cse51 (= ~p_dw_pc~0 0)) (.cse46 (<= 2 ~E_1~0)) (.cse53 (= ~p_num_write~0 0)) (.cse32 (not .cse29)) (.cse49 (= ~c_num_read~0 0)) (.cse52 (= ~t1_i~0 1)) (.cse50 (= ~p_last_write~0 ~q_buf_0~0)) (.cse41 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (= ~m_pc~0 1)) (.cse48 (= ~q_free~0 0)) (.cse56 (= ~p_dw_st~0 0)) (.cse55 (= ~t2_i~0 1)) (.cse54 (= ~c_dr_pc~0 0)) (.cse47 (= ~c_last_read~0 ~p_last_write~0)) (.cse45 (not .cse42)) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse39 (= |old(~t2_st~0)| ~t2_st~0)) (.cse36 (= ~t1_st~0 0))) (let ((.cse6 (and .cse35 .cse39 .cse36)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse23 (not (= ~m_pc~0 0))) (.cse33 (not (= ~t1_pc~0 0))) (.cse17 (not (= ~E_2~0 2))) (.cse20 (= |old(~m_st~0)| 0)) (.cse25 (and .cse45 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse26 (not (= |old(~t1_st~0)| 2))) (.cse34 (not (= 2 |old(~t2_st~0)|))) (.cse28 (not (= ~token~0 ~local~0))) (.cse30 (and .cse51 .cse46 .cse53 .cse32 .cse49 .cse52 .cse50 .cse41 (not .cse10) .cse35 .cse48 .cse39 .cse56 .cse55 .cse54 .cse47)) (.cse37 (= 0 ~t2_st~0)) (.cse31 (= ~E_M~0 1)) (.cse21 (not (= |old(~t2_st~0)| 0))) (.cse24 (not (<= ~t2_pc~0 0))) (.cse1 (not .cse56)) (.cse2 (not .cse55)) (.cse18 (and .cse41 .cse35 .cse39)) (.cse19 (not (= ~E_M~0 2))) (.cse3 (not .cse54)) (.cse22 (not (= ~t1_pc~0 1))) (.cse5 (not .cse53)) (.cse7 (not .cse52)) (.cse40 (not .cse4)) (.cse8 (not .cse51)) (.cse9 (not .cse50)) (.cse11 (not .cse49)) (.cse12 (not .cse48)) (.cse43 (not (<= .cse38 ~token~0))) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse14 (not (= ~t2_pc~0 1))) (.cse15 (not .cse47)) (.cse16 (not .cse46)) (.cse44 (not (<= ~token~0 .cse38))) (.cse27 (and (not (= ~E_M~0 ~E_1~0)) .cse45))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse1 .cse2 .cse18 .cse19 .cse3 .cse20 .cse21 .cse22 .cse23 .cse5 .cse7 .cse8 .cse9 .cse11 .cse24 .cse12 .cse25 .cse26 .cse15 .cse27 .cse28) (or .cse1 .cse2 .cse29 .cse3 .cse22 .cse5 .cse30 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse31) (or .cse0 .cse17 .cse32 .cse1 .cse2 .cse19 .cse3 .cse20 .cse5 .cse6 .cse7 .cse8 .cse9 .cse33 .cse11 .cse12 .cse25 .cse14 .cse34 .cse15 .cse27 .cse28) (or .cse0 .cse17 .cse1 .cse2 .cse19 .cse3 .cse20 .cse21 (and .cse35 .cse36 .cse37) .cse23 .cse5 .cse7 .cse8 .cse9 .cse33 .cse11 .cse24 .cse12 .cse25 .cse15 .cse27 .cse28) (or (not (< .cse38 ~token~0)) .cse17 .cse1 .cse2 .cse18 .cse3 .cse22 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse26 .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ 2 ~local~0))) (not .cse31)) (or .cse17 .cse1 .cse2 (and .cse35 (= 2 ~t1_st~0) .cse39) .cse19 .cse3 .cse20 .cse22 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse25 .cse26 .cse14 .cse34 .cse15 .cse27 .cse28) (or .cse1 .cse2 .cse29 .cse3 .cse4 .cse22 .cse5 .cse30 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse21 .cse22 .cse5 .cse7 .cse40 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 (and .cse41 .cse35 .cse37) .cse13 .cse15 .cse16 .cse31) (or .cse1 .cse2 .cse18 .cse19 .cse3 .cse21 .cse42 .cse22 .cse5 .cse7 .cse40 .cse8 .cse9 .cse11 .cse24 .cse12 .cse43 .cse13 .cse15 .cse44 .cse27) (or .cse1 .cse2 .cse18 .cse19 .cse3 .cse42 .cse22 .cse5 .cse7 .cse40 .cse8 .cse9 .cse11 .cse12 .cse43 .cse13 .cse14 .cse15 .cse16 .cse44 .cse27))))) [2022-12-14 10:16:22,982 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-12-14 10:16:22,982 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-12-14 10:16:22,982 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2022-12-14 10:16:22,982 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 108) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (<= 2 |old(~p_dw_st~0)|)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (not (<= ~t2_pc~0 0)) (not (= 0 ~t2_st~0)) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2022-12-14 10:16:22,982 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-12-14 10:16:22,982 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-12-14 10:16:22,982 INFO L895 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (<= 2 |old(~p_dw_st~0)|)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (not (<= ~t2_pc~0 0)) (not (= 0 ~t2_st~0)) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2022-12-14 10:16:22,983 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-12-14 10:16:22,983 INFO L902 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: true [2022-12-14 10:16:22,983 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-12-14 10:16:22,983 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 710 747) the Hoare annotation is: (let ((.cse31 (not (= ~m_st~0 0))) (.cse32 (= ~E_2~0 |old(~E_2~0)|))) (let ((.cse16 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse18 (and (= ~E_M~0 ~E_1~0) .cse32 (= ~E_1~0 2))) (.cse19 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse31)) (.cse22 (not (= ~token~0 ~local~0))) (.cse25 (+ ~local~0 1)) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not (= 2 ~t2_st~0))) (.cse23 (not (= 2 |old(~E_M~0)|))) (.cse24 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 2) .cse32)) (.cse10 (not (= 2 ~t1_st~0))) (.cse20 (not (= ~t2_pc~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~t2_i~0 1))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse7 (not (= ~t1_i~0 1))) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (<= 2 |old(~E_1~0)|))) (.cse26 (= ~m_pc~0 1)) (.cse12 (= |old(~E_M~0)| 1)) (.cse13 (not (= ~c_num_read~0 0))) (.cse27 (not (<= ~t2_pc~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse15 (not (= ~m_st~0 2))) (.cse17 (= |old(~E_2~0)| 1)) (.cse28 (not (= 0 ~t2_st~0))) (.cse29 (and (<= 2 ~E_1~0) (not (= ~E_2~0 1)) (not (= ~E_M~0 1)))) (.cse30 (not (= ~t1_st~0 0))) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (<= .cse25 ~token~0)) .cse17 .cse20 .cse21 (not (<= ~token~0 .cse25))) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse27 .cse14 .cse15 .cse17 .cse28 .cse29 .cse21) (or .cse0 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse17 .cse29 .cse30 .cse20 .cse21) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 (not (= 2 |old(~E_1~0)|)) .cse6 .cse7 .cse8 .cse9 (not (= ~t1_pc~0 0)) .cse13 .cse27 .cse14 .cse16 .cse18 .cse28 .cse19 .cse30 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse17 .cse29 .cse20 .cse21) (or (not (< .cse25 ~token~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse31 .cse20 .cse21 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_pc~0 0)) .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse17 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse11 .cse26 .cse12 .cse13 .cse27 .cse14 .cse15 .cse17 .cse28 .cse29 .cse30 .cse21)))) [2022-12-14 10:16:22,983 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 710 747) no Hoare annotation was computed. [2022-12-14 10:16:22,983 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 561) no Hoare annotation was computed. [2022-12-14 10:16:22,984 INFO L895 garLoopResultBuilder]: At program point L585(lines 573 587) the Hoare annotation is: (let ((.cse22 (= ~E_1~0 1)) (.cse65 (= ~E_2~0 1)) (.cse55 (= ~m_pc~0 1)) (.cse54 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse33 (= 0 ~t2_st~0)) (.cse57 (= ~t1_st~0 0)) (.cse16 (not (= ~E_M~0 ~E_1~0))) (.cse36 (= ~p_dw_pc~0 0)) (.cse37 (<= 2 ~E_1~0)) (.cse38 (= ~p_num_write~0 0)) (.cse39 (not .cse54)) (.cse40 (= ~c_num_read~0 0)) (.cse41 (= ~t1_i~0 1)) (.cse42 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (not .cse55)) (.cse43 (= ~q_free~0 0)) (.cse25 (not .cse65)) (.cse70 (= ~t2_pc~0 1)) (.cse45 (= ~p_dw_st~0 0)) (.cse46 (= ~t2_i~0 1)) (.cse47 (= ~c_dr_pc~0 0)) (.cse48 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse31 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse32 (= ~m_st~0 |old(~m_st~0)|)) (.cse62 (= 2 ~t1_st~0)) (.cse44 (= |old(~t2_st~0)| ~t2_st~0)) (.cse34 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse67 (= ~t1_pc~0 1)) (.cse68 (not .cse22)) (.cse69 (+ ~local~0 1)) (.cse58 (= |old(~m_st~0)| 0)) (.cse63 (= ~E_1~0 2))) (let ((.cse8 (not .cse63)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse17 (not .cse58)) (.cse12 (not (= ~t1_pc~0 0))) (.cse6 (not (= ~m_pc~0 0))) (.cse60 (not (< .cse69 ~token~0))) (.cse61 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse59 (and .cse68 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse64 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse20 (not (= ~token~0 ~local~0))) (.cse1 (not (= ~E_2~0 2))) (.cse21 (not (= ~E_M~0 2))) (.cse24 (not .cse67)) (.cse49 (and .cse29 .cse31 .cse32 .cse62 .cse44 .cse34)) (.cse26 (not (<= .cse69 ~token~0))) (.cse50 (not (= |old(~t1_st~0)| 2))) (.cse66 (and .cse67 .cse36 .cse37 .cse38 .cse39 .cse40 (= ~m_st~0 2) .cse41 .cse42 .cse23 .cse32 .cse43 .cse25 .cse44 .cse70 .cse45 .cse46 .cse47 .cse48)) (.cse51 (not .cse70)) (.cse52 (not (= 2 |old(~t2_st~0)|))) (.cse28 (not (<= ~token~0 .cse69))) (.cse35 (and .cse16 .cse68)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not .cse45)) (.cse3 (not .cse46)) (.cse4 (not .cse47)) (.cse56 (and .cse67 .cse57)) (.cse5 (not (= |old(~t2_st~0)| 0))) (.cse7 (not .cse38)) (.cse9 (not .cse41)) (.cse10 (not .cse36)) (.cse11 (not .cse42)) (.cse13 (not .cse40)) (.cse14 (not (<= ~t2_pc~0 0))) (.cse15 (not .cse43)) (.cse18 (and .cse29 .cse31 .cse32 .cse57 .cse33 .cse34)) (.cse27 (not (= 2 |old(~m_st~0)|))) (.cse19 (not .cse48)) (.cse53 (not .cse37))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse2 .cse3 .cse21 .cse4 .cse5 .cse22 .cse23 .cse24 .cse7 .cse9 .cse25 .cse10 .cse11 .cse13 .cse14 .cse15 .cse26 .cse27 .cse19 .cse28 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) .cse35) (or .cse1 .cse2 .cse3 .cse4 (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse23 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse49 .cse15 .cse16 .cse50 .cse27 .cse51 .cse52 .cse19 .cse53 .cse20) (or .cse1 .cse2 .cse3 .cse21 .cse54 .cse4 (and .cse29 .cse30 .cse31 (= 2 ~t2_st~0) .cse32 .cse34) .cse24 .cse6 .cse7 .cse9 .cse10 .cse11 .cse55 .cse13 .cse15 .cse50 .cse51 .cse52 .cse19 .cse53) (or .cse0 .cse2 .cse3 .cse4 .cse56 .cse7 .cse9 .cse10 .cse11 .cse55 .cse13 .cse15 (and .cse29 .cse32 .cse44 .cse57 .cse34) .cse27 .cse51 .cse19 .cse53) (or .cse0 .cse1 .cse39 .cse2 .cse3 .cse21 .cse4 .cse58 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse59 (and .cse29 .cse31 .cse32 .cse44 .cse57 .cse34) .cse51 .cse52 .cse19 .cse35 .cse20) (or (and .cse29 .cse30 .cse32 .cse44 (<= 1 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse34) .cse2 .cse3 (and .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse23 .cse43 .cse45 .cse47 .cse48 .cse33) .cse21 .cse4 .cse22 .cse24 .cse7 .cse9 .cse25 .cse10 .cse11 .cse13 .cse15 .cse26 .cse27 .cse51 .cse19 .cse53 .cse28 .cse35) (or .cse60 .cse1 .cse2 .cse3 .cse21 .cse4 .cse24 .cse7 .cse9 .cse10 .cse11 .cse13 .cse49 .cse15 .cse17 .cse50 .cse51 .cse52 .cse19 .cse53 .cse61) (or .cse0 .cse1 .cse2 .cse3 .cse21 .cse4 .cse58 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse59 .cse18 .cse19 .cse35 .cse20) (or .cse2 .cse3 .cse4 .cse5 .cse24 .cse7 .cse9 .cse10 .cse11 .cse55 .cse13 .cse14 .cse15 (and .cse29 .cse31 .cse32 .cse33) .cse27 .cse19 .cse53) (or .cse2 .cse3 .cse54 .cse4 (and .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse29 .cse23 .cse32 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) .cse24 .cse7 .cse9 .cse10 .cse11 .cse55 .cse13 .cse15 .cse27 .cse51 .cse19 .cse53) (or .cse1 .cse2 .cse3 .cse21 .cse4 .cse58 .cse5 .cse24 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse59 (and .cse62 .cse63 .cse34) .cse50 (and .cse64 .cse29 .cse31 .cse32 .cse57 .cse33) .cse19 .cse35 .cse20) (or .cse60 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse31 (= ~m_st~0 0) .cse62 .cse44 .cse34) .cse1 .cse2 .cse3 .cse4 .cse65 .cse24 .cse7 .cse9 .cse10 .cse11 .cse13 .cse15 .cse50 .cse66 .cse27 .cse51 .cse19 .cse53 .cse61 (not (= ~E_M~0 1))) (or .cse1 .cse2 .cse3 (and .cse31 .cse62 .cse34) (and .cse64 .cse31 .cse57) .cse21 .cse54 .cse4 .cse58 .cse24 .cse7 .cse9 .cse10 .cse11 .cse55 .cse13 .cse15 .cse59 .cse50 .cse51 .cse52 .cse19 .cse35 .cse20) (or .cse1 .cse2 .cse3 (and .cse64 .cse29 .cse31 .cse32 .cse44 .cse57) .cse21 .cse4 .cse58 .cse24 .cse7 .cse9 .cse10 .cse11 .cse13 .cse15 .cse50 .cse51 .cse63 .cse52 .cse19 .cse35 .cse20) (or .cse1 .cse2 .cse3 .cse21 .cse4 .cse65 .cse24 .cse7 .cse9 .cse10 .cse11 .cse13 .cse49 .cse15 .cse26 .cse50 .cse66 .cse27 .cse51 .cse52 .cse19 .cse53 .cse28 .cse35) (or .cse0 .cse2 .cse3 .cse4 .cse56 .cse5 .cse7 .cse9 .cse10 .cse11 .cse55 .cse13 .cse14 .cse15 .cse18 .cse27 .cse19 .cse53))))) [2022-12-14 10:16:22,984 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 545) no Hoare annotation was computed. [2022-12-14 10:16:22,984 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 536 545) no Hoare annotation was computed. [2022-12-14 10:16:22,984 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 583) no Hoare annotation was computed. [2022-12-14 10:16:22,985 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 583) no Hoare annotation was computed. [2022-12-14 10:16:22,985 INFO L899 garLoopResultBuilder]: For program point L537(lines 537 542) no Hoare annotation was computed. [2022-12-14 10:16:22,985 INFO L895 garLoopResultBuilder]: At program point L566(lines 554 568) the Hoare annotation is: (let ((.cse11 (= ~m_pc~0 1)) (.cse20 (= ~E_2~0 1)) (.cse31 (= ~E_1~0 1))) (let ((.cse53 (not (= ~E_M~0 ~E_1~0))) (.cse68 (not .cse31)) (.cse32 (not .cse20)) (.cse56 (= |old(~m_st~0)| 0)) (.cse72 (+ ~local~0 1)) (.cse49 (<= ~t2_pc~0 0)) (.cse71 (= ~t1_st~0 0)) (.cse36 (= 0 ~t2_st~0)) (.cse37 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse0 (= ~t1_pc~0 1)) (.cse38 (= ~p_dw_pc~0 0)) (.cse60 (<= 2 ~E_1~0)) (.cse39 (= ~p_num_write~0 0)) (.cse40 (not (= ~m_pc~0 ~t1_pc~0))) (.cse41 (= ~c_num_read~0 0)) (.cse42 (= ~t1_i~0 1)) (.cse43 (= ~p_last_write~0 ~q_buf_0~0)) (.cse33 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse34 (= |old(~t1_st~0)| ~t1_st~0)) (.cse44 (not .cse11)) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse45 (= ~q_free~0 0)) (.cse59 (= |old(~t2_st~0)| ~t2_st~0)) (.cse69 (= ~t2_pc~0 1)) (.cse46 (= ~p_dw_st~0 0)) (.cse61 (= ~t2_i~0 1)) (.cse47 (= ~c_dr_pc~0 0)) (.cse48 (= ~c_last_read~0 ~p_last_write~0)) (.cse70 (= ~E_1~0 2))) (let ((.cse51 (not .cse70)) (.cse30 (and .cse0 .cse38 .cse60 .cse39 .cse40 .cse41 (= ~m_st~0 2) .cse42 .cse43 .cse33 .cse34 .cse44 .cse35 .cse45 .cse59 .cse69 .cse46 .cse61 .cse47 .cse48)) (.cse4 (and .cse33 .cse35 .cse71 .cse36 .cse37)) (.cse52 (not (= ~t1_pc~0 0))) (.cse6 (not (= |old(~t2_st~0)| 0))) (.cse50 (not (= ~m_pc~0 0))) (.cse13 (not .cse49)) (.cse23 (not (<= .cse72 ~token~0))) (.cse26 (and .cse38 .cse60 .cse39 .cse41 .cse42 .cse43 .cse33 .cse34 .cse35 .cse45 .cse59 .cse46 .cse61 .cse47 .cse48 .cse37)) (.cse28 (not (<= ~token~0 .cse72))) (.cse54 (not .cse56)) (.cse65 (not (< .cse72 ~token~0))) (.cse66 (= ~m_st~0 0)) (.cse63 (= 2 ~t1_st~0)) (.cse22 (and .cse38 .cse60 .cse39 .cse40 .cse41 .cse42 .cse43 .cse34 .cse44 .cse45 .cse32 .cse59 .cse46 .cse61 .cse47 .cse48)) (.cse67 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse58 (and .cse33 .cse35 .cse59 .cse71 .cse37)) (.cse15 (not (= 2 |old(~m_st~0)|))) (.cse17 (not .cse60)) (.cse18 (not (= ~E_2~0 2))) (.cse2 (not .cse46)) (.cse3 (not .cse61)) (.cse19 (not (= ~E_M~0 2))) (.cse5 (not .cse47)) (.cse21 (not .cse0)) (.cse7 (not .cse39)) (.cse8 (not .cse42)) (.cse62 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse9 (not .cse38)) (.cse10 (not .cse43)) (.cse12 (not .cse41)) (.cse14 (not .cse45)) (.cse57 (and .cse68 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse64 (and .cse70 .cse37)) (.cse24 (not (= |old(~t1_st~0)| 2))) (.cse25 (not .cse69)) (.cse27 (not (= 2 |old(~t2_st~0)|))) (.cse16 (not .cse48)) (.cse29 (and .cse53 .cse68)) (.cse55 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse2 .cse3 .cse19 .cse5 .cse20 .cse21 .cse7 .cse8 .cse22 .cse9 .cse10 .cse12 .cse14 .cse23 .cse24 .cse15 .cse25 .cse26 .cse27 .cse16 .cse17 .cse28 .cse29) (or .cse2 .cse3 .cse5 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse25 .cse16 .cse17 .cse30) (or .cse2 .cse3 .cse19 .cse5 .cse6 .cse31 .cse21 .cse7 .cse8 .cse32 .cse9 .cse10 .cse12 .cse13 .cse14 (and .cse33 .cse34 .cse35 .cse36 .cse37) .cse23 .cse15 (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse34 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49) .cse16 .cse28 .cse29) (or .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse50 .cse7 .cse51 .cse8 .cse9 .cse10 .cse52 .cse12 .cse13 .cse14 .cse53 .cse54 .cse16 .cse55) (or .cse1 .cse18 .cse40 .cse2 .cse3 .cse19 .cse5 .cse56 .cse7 .cse8 .cse9 .cse10 .cse52 .cse12 .cse14 .cse57 .cse58 .cse25 .cse27 .cse16 .cse29 .cse55) (or .cse18 .cse2 .cse3 .cse5 .cse21 .cse7 .cse51 .cse8 .cse9 .cse10 .cse12 .cse14 .cse53 .cse24 .cse15 .cse25 (and .cse33 .cse34 .cse35 .cse59 .cse37) .cse27 .cse16 .cse17 .cse30 .cse55) (or .cse2 .cse3 .cse5 .cse6 .cse21 .cse7 (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse33 .cse34 .cse44 .cse35 .cse45 .cse46 .cse47 .cse48 .cse36 .cse49) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse18 .cse2 .cse3 .cse4 .cse19 .cse5 .cse56 .cse6 .cse50 .cse7 .cse8 .cse9 .cse10 .cse52 .cse12 .cse13 .cse14 .cse57 .cse16 .cse29 .cse55) (or .cse18 .cse2 .cse3 .cse19 .cse5 .cse21 .cse50 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse24 .cse25 .cse27 .cse16 .cse17 (and .cse38 .cse60 .cse39 .cse40 .cse41 .cse42 .cse43 .cse33 .cse34 .cse44 .cse35 .cse45 .cse32 .cse59 .cse46 .cse61 .cse47 .cse48 .cse37)) (or .cse18 .cse2 .cse3 .cse19 .cse5 .cse56 .cse6 .cse21 .cse50 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 (and .cse62 .cse33 .cse35 .cse63 .cse36) .cse57 .cse64 .cse24 .cse16 .cse29 .cse55) (or .cse2 .cse3 .cse19 .cse5 .cse31 .cse21 .cse7 .cse8 .cse32 (and .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse34 .cse44 .cse45 .cse46 .cse47 .cse48 .cse36) .cse9 .cse10 .cse12 .cse14 .cse23 .cse15 .cse25 .cse26 .cse16 .cse17 .cse28 .cse29) (or .cse65 .cse18 .cse2 .cse3 .cse19 .cse5 .cse20 .cse21 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 (and .cse38 .cse60 .cse39 .cse41 .cse42 .cse43 .cse33 .cse34 .cse66 .cse45 .cse59 .cse46 .cse61 .cse47 .cse48 .cse37) .cse54 .cse24 .cse25 .cse27 .cse16 .cse17 .cse67) (or .cse65 .cse18 .cse2 .cse3 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse66 .cse63 .cse59 .cse37) .cse5 .cse20 .cse21 .cse7 .cse8 .cse22 .cse9 .cse10 .cse12 .cse14 .cse24 .cse15 .cse25 .cse16 .cse17 .cse67 (not (= ~E_M~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse58 .cse15 .cse25 .cse16 .cse17) (or .cse18 .cse2 .cse3 .cse19 .cse5 .cse56 .cse21 .cse7 .cse8 (and .cse38 .cse39 .cse62 .cse41 .cse42 .cse43 .cse33 .cse34 .cse35 .cse45 .cse59 .cse46 .cse47 .cse48) .cse9 .cse10 .cse12 .cse14 .cse57 .cse64 .cse24 .cse25 .cse27 .cse16 .cse29 .cse55))))) [2022-12-14 10:16:22,986 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 786 819) the Hoare annotation is: (let ((.cse42 (= ~E_1~0 1)) (.cse22 (= ~E_2~0 1))) (let ((.cse41 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse39 (not (= ~E_M~0 ~E_1~0))) (.cse43 (not .cse22)) (.cse58 (not .cse42)) (.cse59 (+ ~local~0 1)) (.cse60 (= ~t1_pc~0 1)) (.cse51 (= ~p_dw_pc~0 0)) (.cse46 (<= 2 ~E_1~0)) (.cse53 (= ~p_num_write~0 0)) (.cse49 (= ~c_num_read~0 0)) (.cse52 (= ~t1_i~0 1)) (.cse50 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse48 (= ~q_free~0 0)) (.cse40 (= |old(~t2_st~0)| ~t2_st~0)) (.cse57 (= ~t2_pc~0 1)) (.cse56 (= ~p_dw_st~0 0)) (.cse55 (= ~t2_i~0 1)) (.cse54 (= ~c_dr_pc~0 0)) (.cse47 (= ~c_last_read~0 ~p_last_write~0)) (.cse31 (= |old(~m_st~0)| 0))) (let ((.cse24 (not .cse31)) (.cse29 (and .cse60 .cse51 .cse46 .cse53 .cse49 .cse52 .cse50 .cse13 (not .cse9) .cse14 .cse48 .cse40 .cse57 .cse56 .cse55 .cse54 .cse47)) (.cse32 (not (= ~m_pc~0 0))) (.cse38 (not (= ~t1_pc~0 0))) (.cse19 (not (< .cse59 ~token~0))) (.cse28 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse33 (and .cse58 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse35 (not (= ~token~0 ~local~0))) (.cse20 (not (= ~E_2~0 2))) (.cse21 (not (= ~E_M~0 2))) (.cse4 (not .cse60)) (.cse23 (and .cse60 .cse51 .cse46 .cse53 .cse49 .cse52 .cse50 .cse13 .cse14 .cse48 .cse43 .cse40 .cse57 .cse56 .cse55 .cse54 .cse47)) (.cse44 (not (<= .cse59 ~token~0))) (.cse25 (not (= |old(~t1_st~0)| 2))) (.cse27 (not (= 2 |old(~t2_st~0)|))) (.cse45 (not (<= ~token~0 .cse59))) (.cse34 (and .cse39 .cse58)) (.cse30 (and .cse13 .cse14 .cse40)) (.cse26 (not .cse57)) (.cse36 (not (= |old(~t1_st~0)| 0))) (.cse0 (not .cse56)) (.cse1 (not .cse55)) (.cse2 (not .cse54)) (.cse3 (not (= |old(~t2_st~0)| 0))) (.cse37 (and .cse14 .cse41 .cse15)) (.cse5 (not .cse53)) (.cse6 (not .cse52)) (.cse7 (not .cse51)) (.cse8 (not .cse50)) (.cse10 (not .cse49)) (.cse11 (not (<= ~t2_pc~0 0))) (.cse12 (not .cse48)) (.cse16 (not (= 2 |old(~m_st~0)|))) (.cse17 (not .cse47)) (.cse18 (not .cse46))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15) .cse16 .cse17 .cse18) (or .cse19 .cse20 .cse0 .cse1 .cse21 .cse2 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse17 .cse18 .cse28) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse29 .cse16 .cse26 .cse17 .cse18) (or .cse20 .cse0 .cse1 .cse30 .cse21 .cse2 .cse31 .cse3 .cse4 .cse32 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse33 .cse25 .cse17 .cse34 .cse35) (or .cse36 .cse20 .cse0 .cse1 .cse2 .cse3 .cse37 .cse32 .cse5 (not (= ~E_1~0 2)) .cse6 .cse7 .cse8 .cse38 .cse10 .cse11 .cse12 .cse39 .cse24 .cse17 .cse35) (or .cse20 .cse0 .cse1 .cse21 .cse2 .cse4 .cse32 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse25 .cse29 .cse26 .cse27 .cse17 .cse18) (or .cse36 .cse20 (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse21 .cse2 .cse31 .cse5 (and .cse14 .cse40 .cse41) .cse6 .cse7 .cse8 .cse38 .cse10 .cse12 .cse33 .cse26 .cse27 .cse17 .cse34 .cse35) (or .cse36 .cse20 .cse0 .cse1 .cse21 .cse2 .cse31 .cse3 .cse37 .cse32 .cse5 .cse6 .cse7 .cse8 .cse38 .cse10 .cse11 .cse12 .cse33 .cse17 .cse34 .cse35) (or .cse19 .cse20 .cse0 .cse1 .cse2 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse23 .cse25 .cse16 .cse26 .cse17 .cse18 .cse28 (not (= ~E_M~0 1))) (or .cse20 .cse0 .cse1 (and .cse14 (= 2 ~t1_st~0) .cse40) .cse21 .cse2 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse33 .cse25 .cse26 .cse27 .cse17 .cse34 .cse35) (or .cse0 .cse1 .cse30 .cse21 .cse2 .cse3 .cse42 .cse4 .cse5 .cse6 .cse43 .cse7 .cse8 .cse10 .cse11 .cse12 .cse44 .cse16 .cse17 .cse45 .cse34) (or .cse0 .cse1 .cse30 .cse21 .cse2 .cse42 .cse4 .cse5 .cse6 .cse43 .cse7 .cse8 .cse10 .cse12 .cse44 .cse16 .cse26 .cse17 .cse18 .cse45 .cse34) (or .cse20 .cse0 .cse1 .cse21 .cse2 .cse22 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse23 .cse44 .cse25 .cse16 .cse26 .cse27 .cse17 .cse18 .cse45 .cse34) (or .cse36 .cse0 .cse1 .cse30 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse16 .cse26 .cse17 .cse18) (or .cse36 .cse0 .cse1 .cse2 .cse3 .cse37 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18))))) [2022-12-14 10:16:22,986 INFO L899 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2022-12-14 10:16:22,986 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 786 819) no Hoare annotation was computed. [2022-12-14 10:16:22,986 INFO L899 garLoopResultBuilder]: For program point L555(lines 555 564) no Hoare annotation was computed. [2022-12-14 10:16:22,986 INFO L899 garLoopResultBuilder]: For program point L555-2(lines 555 564) no Hoare annotation was computed. [2022-12-14 10:16:22,987 INFO L895 garLoopResultBuilder]: At program point L547(lines 535 549) the Hoare annotation is: (let ((.cse50 (= ~E_1~0 1))) (let ((.cse46 (= 0 ~t2_st~0)) (.cse58 (not (= ~E_M~0 ~E_1~0))) (.cse5 (= ~E_2~0 1)) (.cse6 (= ~t1_pc~0 1)) (.cse19 (= ~t2_pc~0 1)) (.cse61 (= ~t1_st~0 0)) (.cse62 (not .cse50)) (.cse40 (= |old(~m_st~0)| 0)) (.cse7 (= ~p_dw_pc~0 0)) (.cse8 (<= 2 ~E_1~0)) (.cse9 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ~t1_i~0 1)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse14 (= |old(~t1_st~0)| ~t1_st~0)) (.cse15 (= ~m_st~0 |old(~m_st~0)|)) (.cse16 (= ~q_free~0 0)) (.cse18 (= |old(~t2_st~0)| ~t2_st~0)) (.cse20 (= ~p_dw_st~0 0)) (.cse21 (= ~t2_i~0 1)) (.cse22 (= ~c_dr_pc~0 0)) (.cse23 (= ~c_last_read~0 ~p_last_write~0)) (.cse63 (+ ~local~0 1)) (.cse48 (= ~m_pc~0 1))) (let ((.cse42 (not (= ~m_pc~0 0))) (.cse52 (not .cse48)) (.cse45 (= 2 ~t1_st~0)) (.cse51 (not (< .cse63 ~token~0))) (.cse49 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse20 .cse21 .cse22 .cse23)) (.cse59 (not .cse40)) (.cse32 (not (= |old(~t1_st~0)| 2))) (.cse53 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse0 (not (= ~E_2~0 2))) (.cse57 (not (= ~t1_pc~0 0))) (.cse44 (and .cse62 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse60 (and .cse13 .cse15 .cse18 .cse61)) (.cse34 (not .cse19)) (.cse35 (not (= 2 |old(~t2_st~0)|))) (.cse47 (not (= ~token~0 ~local~0))) (.cse3 (not (= ~E_M~0 2))) (.cse24 (not .cse6)) (.cse17 (not .cse5)) (.cse31 (not (<= .cse63 ~token~0))) (.cse54 (and .cse13 .cse14 .cse15 .cse18)) (.cse38 (not (<= ~token~0 .cse63))) (.cse39 (and .cse58 .cse62)) (.cse55 (not (= |old(~t1_st~0)| 0))) (.cse1 (not .cse20)) (.cse2 (not .cse21)) (.cse4 (not .cse22)) (.cse41 (not (= |old(~t2_st~0)| 0))) (.cse56 (and .cse13 .cse15 .cse61 .cse46)) (.cse25 (not .cse9)) (.cse26 (not .cse11)) (.cse27 (not .cse7)) (.cse28 (not .cse12)) (.cse29 (not .cse10)) (.cse43 (not (<= ~t2_pc~0 0))) (.cse30 (not .cse16)) (.cse33 (not (= 2 |old(~m_st~0)|))) (.cse36 (not .cse23)) (.cse37 (not .cse8))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse40 .cse41 .cse24 .cse42 .cse25 .cse26 .cse27 .cse28 .cse29 .cse43 .cse30 .cse44 (and .cse13 .cse15 .cse45 .cse46) .cse32 .cse36 .cse39 .cse47) (or .cse1 .cse2 (and .cse13 .cse14 .cse15 .cse46) .cse4 .cse41 .cse24 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 .cse43 .cse30 .cse33 .cse36 .cse37) (or .cse1 .cse2 .cse3 .cse49 .cse4 .cse50 .cse24 .cse25 .cse26 .cse17 .cse27 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39) (or .cse51 .cse0 .cse1 .cse2 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse52 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse4 .cse5 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 (and .cse6 .cse7 .cse8 (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse34 .cse36 .cse37 .cse53 (not (= ~E_M~0 1))) (or .cse1 .cse2 .cse4 .cse24 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 .cse30 .cse54 .cse33 .cse34 .cse36 .cse37) (or .cse55 .cse0 .cse1 .cse2 .cse4 .cse41 .cse56 .cse42 .cse25 (not (= ~E_1~0 2)) .cse26 .cse27 .cse28 .cse57 .cse29 .cse43 .cse30 .cse58 .cse59 .cse36 .cse47) (or .cse55 .cse0 .cse1 .cse2 .cse3 .cse4 .cse40 .cse41 .cse56 .cse42 .cse25 .cse26 .cse27 .cse28 .cse57 .cse29 .cse43 .cse30 .cse44 .cse36 .cse39 .cse47) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse24 .cse42 .cse25 .cse26 .cse27 .cse28 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse52 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse48 .cse29 .cse30 .cse32 .cse34 .cse35 .cse36 .cse37) (or .cse55 .cse1 .cse2 .cse4 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 .cse30 .cse60 .cse33 .cse34 .cse36 .cse37) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse40 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse44 .cse32 .cse34 .cse35 (and .cse13 .cse15 .cse45 .cse18) .cse36 .cse39 .cse47) (or .cse51 .cse0 .cse1 .cse2 .cse3 .cse49 .cse4 .cse5 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse59 .cse32 .cse34 .cse35 .cse36 .cse37 .cse53) (or .cse55 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse40 .cse25 .cse26 .cse27 .cse28 .cse57 .cse29 .cse30 .cse44 .cse60 .cse34 .cse35 .cse36 .cse39 .cse47) (or .cse1 .cse2 .cse3 .cse4 .cse41 .cse50 .cse24 .cse25 .cse26 .cse17 .cse27 .cse28 .cse29 .cse43 .cse30 .cse31 .cse54 .cse33 .cse36 .cse38 .cse39) (or .cse55 .cse1 .cse2 .cse4 .cse41 .cse56 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 .cse43 .cse30 .cse33 .cse36 .cse37))))) [2022-12-14 10:16:22,987 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 589 596) no Hoare annotation was computed. [2022-12-14 10:16:22,987 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 589 596) the Hoare annotation is: true [2022-12-14 10:16:22,987 INFO L895 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse5 (= ~m_st~0 2)) (.cse20 (= ~E_M~0 ~E_1~0)) (.cse23 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse18 (= ~m_st~0 0) .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (< .cse23 ~token~0) .cse14 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 (<= ~token~0 .cse23) .cse9 .cse19 .cse20 .cse21 (<= .cse23 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse14 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse24))) [2022-12-14 10:16:22,987 INFO L895 garLoopResultBuilder]: At program point L895-1(line 895) the Hoare annotation is: (let ((.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse5 (= ~m_st~0 2)) (.cse20 (= ~E_M~0 ~E_1~0)) (.cse23 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse18 (= ~m_st~0 0) .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (< .cse23 ~token~0) .cse14 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 (<= ~token~0 .cse23) .cse9 .cse19 .cse20 .cse21 (<= .cse23 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse14 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse24))) [2022-12-14 10:16:22,988 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 109 151) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= 2 ~p_dw_st~0) (<= ~t2_pc~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-12-14 10:16:22,988 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 671) no Hoare annotation was computed. [2022-12-14 10:16:22,988 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-12-14 10:16:22,988 INFO L899 garLoopResultBuilder]: For program point L500(lines 500 508) no Hoare annotation was computed. [2022-12-14 10:16:22,988 INFO L895 garLoopResultBuilder]: At program point L467(lines 467 471) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~E_2~0 2)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~E_1~0 2)) (.cse15 (= 0 ~t2_st~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse22 (not (= ~E_2~0 1))) (.cse19 (= ~t2_pc~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse14 .cse16 .cse17) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse8 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse23) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse8 .cse22 .cse19 .cse11 .cse12 .cse13 .cse14 .cse23))) [2022-12-14 10:16:22,988 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-12-14 10:16:22,988 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-12-14 10:16:22,988 INFO L895 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1)) (.cse18 (= ~E_M~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse20 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse11 (not (= ~E_2~0 1))) (.cse24 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 (<= ~token~0 .cse23) .cse9 .cse10 .cse11 .cse24 .cse12 (<= .cse23 ~token~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse25 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ 2 ~local~0)) .cse7 (= ~m_st~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse23 ~token~0) .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse25 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 ~local~0) (= ~E_1~0 2) .cse19))) [2022-12-14 10:16:22,988 INFO L899 garLoopResultBuilder]: For program point L931-1(line 931) no Hoare annotation was computed. [2022-12-14 10:16:22,989 INFO L895 garLoopResultBuilder]: At program point L503(lines 503 507) the Hoare annotation is: (let ((.cse33 (+ ~local~0 1)) (.cse10 (= ~E_M~0 ~E_1~0))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse7 (= ~m_st~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse4 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse26 (or (= ~E_1~0 1) .cse10)) (.cse27 (<= ~token~0 .cse33)) (.cse9 (= 2 ~t1_st~0)) (.cse32 (= ~t2_pc~0 1)) (.cse28 (<= .cse33 ~token~0)) (.cse11 (= ~E_2~0 2)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse29 (= ~E_M~0 2)) (.cse1 (= ~p_dw_pc~0 0)) (.cse22 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse23 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse24 (not (= ~E_2~0 1))) (.cse31 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (<= ~t2_pc~0 0)) (.cse25 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse21 .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25) (and .cse0 .cse21 .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse26 .cse27 .cse8 .cse9 .cse24 .cse28 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse29 .cse20 .cse25) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse23 .cse5 .cse6 .cse30 .cse8 .cse24 .cse12 .cse13 .cse14 .cse17 .cse20 .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 ~t1_pc~0) .cse7 .cse8 .cse10 .cse31 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse22 .cse2 .cse3 .cse23 .cse5 .cse6 .cse30 .cse8 .cse24 .cse31 .cse32 .cse12 .cse13 .cse14 .cse17 .cse25) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse23 .cse5 .cse6 .cse30 .cse8 .cse24 .cse32 .cse12 .cse13 .cse14 .cse17 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse31 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse23 .cse4 (= ~t1_pc~0 0) .cse5 .cse6 .cse8 .cse10 .cse31 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse23 .cse5 .cse6 .cse26 .cse27 .cse8 .cse9 .cse32 .cse28 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse16 .cse17 .cse29) (and .cse1 .cse22 .cse2 .cse3 .cse23 .cse5 .cse6 .cse30 .cse8 .cse24 .cse31 .cse12 .cse13 .cse14 .cse17 .cse20 .cse25)))) [2022-12-14 10:16:22,989 INFO L895 garLoopResultBuilder]: At program point L437(line 437) the Hoare annotation is: (let ((.cse27 (= ~E_1~0 1))) (let ((.cse7 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (= ~t1_st~0 0)) (.cse8 (= 2 ~t2_st~0)) (.cse12 (= ~t2_pc~0 1)) (.cse25 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (or .cse27 (= ~E_M~0 ~E_1~0))) (.cse9 (or (= ~m_st~0 ~E_M~0) .cse27)) (.cse10 (= ~q_free~0 0)) (.cse26 (= 2 ~t1_st~0)) (.cse13 (or .cse27 (and (or (= |old(~E_M~0)| 0) (= ~E_M~0 |old(~E_M~0)|)) (= ~E_1~0 |old(~E_1~0)|)))) (.cse14 (= ~E_2~0 2)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (not (= ~m_st~0 0))) (.cse17 (= ~t2_i~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse19 (= ~m_pc~0 0)) (.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~E_M~0 2)) (.cse23 (= 0 ~t2_st~0)) (.cse22 (= ~token~0 ~local~0)) (.cse24 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse22 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse20 .cse21 .cse22) (and .cse25 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse26 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 .cse22 .cse24)))) [2022-12-14 10:16:22,989 INFO L899 garLoopResultBuilder]: For program point L437-1(line 437) no Hoare annotation was computed. [2022-12-14 10:16:22,989 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-12-14 10:16:22,989 INFO L895 garLoopResultBuilder]: At program point start_simulation2_returnLabel#1(lines 908 966) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-12-14 10:16:22,989 INFO L895 garLoopResultBuilder]: At program point master_returnLabel#1(lines 416 459) the Hoare annotation is: (let ((.cse22 (not (= ~m_pc~0 ~t1_pc~0))) (.cse23 (= ~t1_pc~0 0)) (.cse6 (= ~m_st~0 ~E_M~0)) (.cse25 (= 2 ~t2_st~0)) (.cse9 (= 2 ~t1_st~0)) (.cse26 (= ~t2_pc~0 1)) (.cse11 (or (= |old(~E_M~0)| 0) (= ~E_M~0 |old(~E_M~0)|))) (.cse28 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse16 (= ~E_1~0 |old(~E_1~0)|)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse27 (= ~m_st~0 2)) (.cse4 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse5 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse10 (= ~E_M~0 ~E_1~0)) (.cse24 (= ~t1_st~0 0)) (.cse12 (= ~E_2~0 2)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (= ~token~0 ~local~0)) (.cse20 (= ~E_1~0 2)) (.cse21 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse6 .cse7 .cse8 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (and .cse1 .cse2 .cse22 .cse3 .cse4 .cse23 .cse5 .cse6 .cse7 .cse25 .cse8 .cse10 .cse24 .cse26 .cse12 .cse13 .cse14 .cse15 .cse17 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse7 .cse25 .cse8 .cse10 .cse24 .cse26 .cse12 .cse13 .cse14 .cse15 .cse28 .cse17 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse28 .cse16 .cse17 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse7 .cse8 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21))) [2022-12-14 10:16:22,989 INFO L902 garLoopResultBuilder]: At program point start_simulation1_returnLabel#1(lines 321 349) the Hoare annotation is: true [2022-12-14 10:16:22,989 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~t2_pc~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-12-14 10:16:22,989 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2022-12-14 10:16:22,989 INFO L895 garLoopResultBuilder]: At program point L935(line 935) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1)) (.cse18 (= ~E_M~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse20 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse11 (not (= ~E_2~0 1))) (.cse24 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 (<= ~token~0 .cse23) .cse9 .cse10 .cse11 .cse24 .cse12 (<= .cse23 ~token~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse25 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ 2 ~local~0)) .cse7 (= ~m_st~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse23 ~token~0) .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse25 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 ~local~0) (= ~E_1~0 2) .cse19))) [2022-12-14 10:16:22,990 INFO L895 garLoopResultBuilder]: At program point L935-1(line 935) the Hoare annotation is: (let ((.cse9 (= ~t1_st~0 0)) (.cse20 (= 0 ~t2_st~0)) (.cse21 (<= ~t2_pc~0 0)) (.cse7 (not (= ~m_pc~0 1))) (.cse15 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= 2 ~t2_st~0)) (.cse8 (= ~q_free~0 0)) (.cse17 (= 2 ~t1_st~0)) (.cse18 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse19 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse8 .cse17 .cse18 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse20 .cse21) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse16 .cse7 .cse8 .cse17 .cse10 .cse19 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse22) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (<= ~token~0 (+ 2 ~local~0)) .cse16 (= ~m_st~0 0) .cse8 .cse17 .cse10 .cse19 .cse11 .cse12 .cse13 (< .cse23 ~token~0) .cse14 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse21) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 (<= ~token~0 .cse23) .cse8 .cse17 .cse18 .cse10 (<= .cse23 ~token~0) .cse19 .cse11 .cse12 .cse13 .cse14 .cse22))) [2022-12-14 10:16:22,990 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 10:16:22,990 INFO L895 garLoopResultBuilder]: At program point L308-1(line 308) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 10:16:22,990 INFO L895 garLoopResultBuilder]: At program point L936(line 936) the Hoare annotation is: (let ((.cse4 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (not (= ~m_pc~0 1))) (.cse16 (= ~t1_st~0 0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~m_st~0 2)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse10 (= ~q_free~0 0)) (.cse20 (= 2 ~t1_st~0)) (.cse24 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse23 (+ ~local~0 1)) (.cse21 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14 (= ~m_pc~0 0) .cse15 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 (<= ~token~0 (+ 2 ~local~0)) .cse19 (= ~m_st~0 0) .cse10 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14 (< .cse23 ~token~0) .cse15 .cse22) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (= ~m_st~0 ~E_M~0) .cse8 .cse19 .cse10 .cse20 .cse24 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse19 (<= ~token~0 .cse23) .cse10 .cse20 .cse24 .cse11 (<= .cse23 ~token~0) .cse21 .cse12 .cse13 .cse14 .cse15 .cse22))) [2022-12-14 10:16:22,990 INFO L895 garLoopResultBuilder]: At program point eval2_returnLabel#1(lines 645 709) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1)) (.cse18 (= ~E_M~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse20 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse11 (not (= ~E_2~0 1))) (.cse24 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 (<= ~token~0 .cse23) .cse9 .cse10 .cse11 .cse24 .cse12 (<= .cse23 ~token~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse25 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 (+ 2 ~local~0)) .cse7 (= ~m_st~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< .cse23 ~token~0) .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse8 .cse9 .cse11 .cse25 .cse14 .cse15 .cse16 .cse17 .cse21 .cse22 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse20 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~token~0 ~local~0) (= ~E_1~0 2) .cse19))) [2022-12-14 10:16:22,991 INFO L895 garLoopResultBuilder]: At program point L937(line 937) the Hoare annotation is: (let ((.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse5 (= ~m_st~0 2)) (.cse20 (= ~E_M~0 ~E_1~0)) (.cse23 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse18 (= ~m_st~0 0) .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (< .cse23 ~token~0) .cse14 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 (<= ~token~0 .cse23) .cse9 .cse19 .cse20 .cse21 (<= .cse23 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse14 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse24))) [2022-12-14 10:16:22,991 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 153 209) the Hoare annotation is: (and (= ~c_dr_st~0 2) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~t2_pc~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-12-14 10:16:22,991 INFO L895 garLoopResultBuilder]: At program point L475-1(lines 475 488) the Hoare annotation is: (let ((.cse32 (+ ~local~0 1)) (.cse13 (= ~E_M~0 ~E_1~0))) (let ((.cse28 (or (= ~E_1~0 1) .cse13)) (.cse29 (<= ~token~0 .cse32)) (.cse30 (<= .cse32 ~token~0)) (.cse31 (= ~E_M~0 2)) (.cse20 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_pc~0 0)) (.cse25 (= 2 ~t2_st~0)) (.cse9 (= ~m_st~0 0)) (.cse14 (= ~E_2~0 2)) (.cse18 (= ~m_pc~0 0)) (.cse21 (= ~token~0 ~local~0)) (.cse22 (= ~E_1~0 2)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse24 (= ~m_st~0 2)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (not (= ~m_pc~0 1))) (.cse11 (= ~q_free~0 0)) (.cse12 (not (= ~E_2~0 1))) (.cse26 (= ~t2_pc~0 1)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~t2_i~0 1)) (.cse17 (= ~c_dr_pc~0 0)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse7 .cse8 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse19 .cse20 .cse23 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse7 .cse8 .cse28 .cse29 .cse11 .cse30 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse23 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse7 .cse8 .cse28 .cse29 .cse11 .cse12 .cse26 .cse30 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse19 .cse31 .cse20 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse7 .cse8 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse27) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse10 .cse11 .cse13 .cse26 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse7 .cse8 .cse10 .cse11 .cse12 .cse26 .cse15 .cse16 .cse17 .cse19 .cse27)))) [2022-12-14 10:16:22,991 INFO L895 garLoopResultBuilder]: At program point eval1_returnLabel#1(lines 248 301) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 10:16:22,991 INFO L899 garLoopResultBuilder]: For program point L675(lines 651 703) no Hoare annotation was computed. [2022-12-14 10:16:22,991 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-12-14 10:16:22,991 INFO L899 garLoopResultBuilder]: For program point L940(line 940) no Hoare annotation was computed. [2022-12-14 10:16:22,991 INFO L895 garLoopResultBuilder]: At program point L511-1(lines 511 524) the Hoare annotation is: (let ((.cse6 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse10 (= ~t1_st~0 0)) (.cse27 (<= 2 ~t1_st~0)) (.cse21 (= ~m_st~0 2)) (.cse23 (not (= ~E_2~0 1))) (.cse24 (not (= ~E_M~0 1))) (.cse26 (not .cse6)) (.cse3 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse22 (not (= ~m_pc~0 1))) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse15 (= ~m_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~E_1~0 2)) (.cse25 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse28 (= 2 ~t1_st~0)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse29 (+ ~local~0 1)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse30 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse20 .cse1 .cse2 .cse21 .cse4 .cse5 .cse22 .cse8 .cse23 .cse10 .cse12 .cse13 .cse14 .cse17 .cse24) (and .cse25 .cse0 .cse20 .cse1 .cse26 .cse2 .cse21 .cse4 .cse5 .cse22 .cse8 .cse23 .cse12 .cse13 .cse14 .cse17 .cse24) (and .cse25 .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse21 .cse3 (= ~t1_pc~0 0) .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse25 .cse27 .cse0 .cse20 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse8 .cse28 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse24) (and .cse25 .cse27 .cse0 .cse20 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 (<= ~token~0 .cse29) .cse8 .cse28 .cse23 .cse9 (<= .cse29 ~token~0) .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse30 .cse24) (and .cse25 .cse0 .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse7 .cse22 .cse8 .cse28 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse25 .cse0 .cse20 .cse1 .cse2 .cse4 .cse5 (<= ~token~0 (+ 2 ~local~0)) .cse7 .cse8 .cse28 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (< .cse29 ~token~0) .cse16 .cse17 .cse30)))) [2022-12-14 10:16:22,992 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 431 452) the Hoare annotation is: (let ((.cse20 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (= ~t1_st~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse7 (= 2 ~t2_st~0)) (.cse10 (= ~t2_pc~0 1)) (.cse16 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse18 (= ~E_M~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse19 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= 2 ~t1_st~0)) (.cse21 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse23 (= ~m_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= 0 ~t2_st~0)) (.cse24 (= ~token~0 ~local~0)) (.cse25 (= ~E_1~0 2)) (.cse27 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~token~0 (+ 2 ~local~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse3 .cse4 .cse19 .cse5 .cse6 .cse20 .cse7 .cse8 .cse21 .cse22 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse17 .cse24 .cse25) (and .cse1 .cse3 .cse4 .cse19 .cse5 .cse6 .cse20 .cse8 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse17 .cse26 .cse24 .cse25 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse19 .cse5 .cse6 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse17 .cse26 .cse24 .cse25 .cse27))) [2022-12-14 10:16:22,992 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 10:16:22,992 INFO L895 garLoopResultBuilder]: At program point L942(lines 942 951) the Hoare annotation is: (let ((.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse5 (= ~m_st~0 2)) (.cse20 (= ~E_M~0 ~E_1~0)) (.cse23 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse18 (= ~m_st~0 0) .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (< .cse23 ~token~0) .cse14 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 (<= ~token~0 .cse23) .cse9 .cse19 .cse20 .cse21 (<= .cse23 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse14 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse24))) [2022-12-14 10:16:22,992 INFO L899 garLoopResultBuilder]: For program point L942-2(lines 942 951) no Hoare annotation was computed. [2022-12-14 10:16:22,992 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 685) no Hoare annotation was computed. [2022-12-14 10:16:22,992 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-12-14 10:16:22,992 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-12-14 10:16:22,992 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 985) no Hoare annotation was computed. [2022-12-14 10:16:22,992 INFO L895 garLoopResultBuilder]: At program point L946(line 946) the Hoare annotation is: (let ((.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse5 (= ~m_st~0 2)) (.cse20 (= ~E_M~0 ~E_1~0)) (.cse23 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse18 (= ~m_st~0 0) .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (< .cse23 ~token~0) .cse14 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 (<= ~token~0 .cse23) .cse9 .cse19 .cse20 .cse21 (<= .cse23 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse14 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse24))) [2022-12-14 10:16:22,992 INFO L895 garLoopResultBuilder]: At program point L946-1(line 946) the Hoare annotation is: (let ((.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse25 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse5 (= ~m_st~0 2)) (.cse20 (= ~E_M~0 ~E_1~0)) (.cse23 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse19 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse18 .cse9 .cse19 .cse20 .cse21 .cse22 .cse11 .cse12 .cse13 .cse14 (= ~token~0 ~local~0) (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse18 (= ~m_st~0 0) .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (< .cse23 ~token~0) .cse14 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 (<= ~token~0 .cse23) .cse9 .cse19 .cse20 .cse21 (<= .cse23 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse14 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse18 .cse9 .cse19 .cse21 .cse22 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse24))) [2022-12-14 10:16:22,993 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= 2 ~p_dw_st~0) (<= ~t2_pc~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-12-14 10:16:22,993 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-12-14 10:16:22,993 INFO L895 garLoopResultBuilder]: At program point L485(line 485) the Hoare annotation is: (let ((.cse23 (+ ~local~0 1))) (let ((.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse9 (<= ~token~0 .cse23)) (.cse12 (<= .cse23 ~token~0)) (.cse17 (= ~E_M~0 2)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~E_2~0 1)) (.cse21 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse16 .cse17 (= ~E_1~0 2)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 (= ~E_M~0 ~E_1~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse21 .cse10 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse22) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse21 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse22)))) [2022-12-14 10:16:22,993 INFO L899 garLoopResultBuilder]: For program point L485-1(line 485) no Hoare annotation was computed. [2022-12-14 10:16:22,993 INFO L895 garLoopResultBuilder]: At program point L981(lines 981 984) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-12-14 10:16:22,993 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 428) no Hoare annotation was computed. [2022-12-14 10:16:22,993 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-12-14 10:16:22,993 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-12-14 10:16:22,993 INFO L895 garLoopResultBuilder]: At program point L652(line 652) the Hoare annotation is: (let ((.cse35 (+ ~local~0 1)) (.cse28 (= ~E_M~0 ~E_1~0))) (let ((.cse18 (or (= ~E_1~0 1) .cse28)) (.cse10 (not (= ~E_2~0 1))) (.cse19 (<= ~token~0 .cse35)) (.cse22 (<= .cse35 ~token~0)) (.cse36 (<= 2 ~t1_st~0)) (.cse17 (not (= ~E_M~0 1))) (.cse27 (= ~m_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse24 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse2 (<= 2 ~E_1~0)) (.cse34 (= 2 ~t2_st~0)) (.cse20 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse30 (= ~m_pc~0 0)) (.cse25 (= ~E_M~0 2)) (.cse26 (= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse33 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~q_free~0 0)) (.cse29 (= ~t1_st~0 0)) (.cse23 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~t2_st~0)) (.cse31 (= ~token~0 ~local~0)) (.cse32 (= ~E_1~0 2)) (.cse16 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse20 .cse21 .cse22 .cse23 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15) (and .cse1 .cse3 .cse4 .cse26 .cse6 .cse7 .cse27 .cse9 .cse28 .cse29 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse31 .cse32 .cse16) (and .cse1 .cse3 .cse4 .cse33 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse34 .cse27 .cse9 .cse28 .cse29 .cse21 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse31 .cse32) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse34 .cse9 .cse20 .cse28 .cse21 .cse23 .cse11 .cse12 .cse13 .cse14 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse34 .cse27 .cse9 .cse20 .cse21 .cse23 .cse11 .cse12 .cse13 (< .cse35 ~token~0) .cse14 .cse25) (and .cse0 .cse36 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse18 .cse19 .cse9 .cse20 .cse22 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse9 .cse28 .cse29 .cse21 .cse23 .cse11 .cse12 .cse13 .cse24 .cse14 .cse31 .cse32) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse19 .cse9 .cse20 .cse28 .cse21 .cse22 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse33 .cse6 .cse7 .cse27 .cse9 .cse20 .cse28 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse31 .cse32 .cse16) (and .cse1 .cse3 .cse4 .cse5 .cse33 .cse26 .cse6 .cse7 .cse34 .cse9 .cse28 .cse29 .cse21 .cse23 .cse11 .cse12 .cse13 .cse14 .cse31 .cse32) (and .cse0 .cse36 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse9 .cse20 .cse28 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse34 .cse27 .cse8 .cse9 .cse20 .cse21 .cse23 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse34 .cse9 .cse20 .cse21 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse25) (and .cse1 .cse3 .cse4 .cse5 .cse33 .cse26 .cse6 .cse7 .cse9 .cse28 .cse29 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse9 .cse28 .cse29 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse16)))) [2022-12-14 10:16:22,994 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 10:16:22,994 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 10:16:22,994 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-12-14 10:16:22,994 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-12-14 10:16:22,994 INFO L895 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse9 (= ~t2_pc~0 1)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~t2_i~0 1)) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse8 (= 2 ~t1_st~0) .cse9 (= ~E_2~0 2) .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (< (+ ~local~0 1) ~token~0) (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) .cse13 (= ~E_M~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 (= ~t1_st~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-14 10:16:22,994 INFO L899 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2022-12-14 10:16:22,994 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-12-14 10:16:22,994 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 125 145) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6))) [2022-12-14 10:16:22,994 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-12-14 10:16:22,994 INFO L895 garLoopResultBuilder]: At program point L918-1(line 918) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-12-14 10:16:22,994 INFO L899 garLoopResultBuilder]: For program point L654(line 654) no Hoare annotation was computed. [2022-12-14 10:16:22,994 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-12-14 10:16:22,994 INFO L895 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: false [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-12-14 10:16:22,995 INFO L895 garLoopResultBuilder]: At program point L919(line 919) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (= ~token~0 ~local~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-12-14 10:16:22,995 INFO L895 garLoopResultBuilder]: At program point L160(lines 160 164) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= 2 ~p_dw_st~0) (<= ~t2_pc~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-12-14 10:16:22,995 INFO L895 garLoopResultBuilder]: At program point L127(lines 127 135) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~t2_pc~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-12-14 10:16:22,995 INFO L895 garLoopResultBuilder]: At program point L689(lines 651 703) the Hoare annotation is: (let ((.cse35 (+ ~local~0 1)) (.cse28 (= ~E_M~0 ~E_1~0))) (let ((.cse18 (or (= ~E_1~0 1) .cse28)) (.cse10 (not (= ~E_2~0 1))) (.cse19 (<= ~token~0 .cse35)) (.cse22 (<= .cse35 ~token~0)) (.cse36 (<= 2 ~t1_st~0)) (.cse17 (not (= ~E_M~0 1))) (.cse27 (= ~m_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse24 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse2 (<= 2 ~E_1~0)) (.cse34 (= 2 ~t2_st~0)) (.cse20 (= 2 ~t1_st~0)) (.cse21 (= ~t2_pc~0 1)) (.cse30 (= ~m_pc~0 0)) (.cse25 (= ~E_M~0 2)) (.cse26 (= ~t1_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 2)) (.cse33 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (= ~q_free~0 0)) (.cse29 (= ~t1_st~0 0)) (.cse23 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= 0 ~t2_st~0)) (.cse31 (= ~token~0 ~local~0)) (.cse32 (= ~E_1~0 2)) (.cse16 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse9 .cse20 .cse21 .cse22 .cse23 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25 .cse15) (and .cse1 .cse3 .cse4 .cse26 .cse6 .cse7 .cse27 .cse9 .cse28 .cse29 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse31 .cse32 .cse16) (and .cse1 .cse3 .cse4 .cse33 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse34 .cse27 .cse9 .cse28 .cse29 .cse21 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse31 .cse32) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse34 .cse9 .cse20 .cse28 .cse21 .cse23 .cse11 .cse12 .cse13 .cse14 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse34 .cse27 .cse9 .cse20 .cse21 .cse23 .cse11 .cse12 .cse13 (< .cse35 ~token~0) .cse14 .cse25) (and .cse0 .cse36 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse18 .cse19 .cse9 .cse20 .cse22 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse9 .cse28 .cse29 .cse21 .cse23 .cse11 .cse12 .cse13 .cse24 .cse14 .cse31 .cse32) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse34 .cse19 .cse9 .cse20 .cse28 .cse21 .cse22 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse33 .cse6 .cse7 .cse27 .cse9 .cse20 .cse28 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse31 .cse32 .cse16) (and .cse1 .cse3 .cse4 .cse5 .cse33 .cse26 .cse6 .cse7 .cse34 .cse9 .cse28 .cse29 .cse21 .cse23 .cse11 .cse12 .cse13 .cse14 .cse31 .cse32) (and .cse0 .cse36 .cse1 .cse2 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse9 .cse20 .cse28 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse34 .cse27 .cse8 .cse9 .cse20 .cse21 .cse23 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse34 .cse9 .cse20 .cse21 .cse23 .cse11 .cse12 .cse13 .cse30 .cse14 .cse25) (and .cse1 .cse3 .cse4 .cse5 .cse33 .cse26 .cse6 .cse7 .cse9 .cse28 .cse29 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse33 .cse6 .cse7 .cse9 .cse28 .cse29 .cse23 .cse11 .cse12 .cse13 .cse14 .cse15 .cse31 .cse32 .cse16)))) [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point L656(lines 656 660) no Hoare annotation was computed. [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point L656-1(lines 651 703) no Hoare annotation was computed. [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 10:16:22,995 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2022-12-14 10:16:22,995 INFO L899 garLoopResultBuilder]: For program point L955(lines 955 959) no Hoare annotation was computed. [2022-12-14 10:16:22,996 INFO L895 garLoopResultBuilder]: At program point L923-1(lines 923 960) the Hoare annotation is: (let ((.cse23 (= ~token~0 ~local~0)) (.cse24 (= ~E_1~0 2)) (.cse18 (= ~m_st~0 0)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse20 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse5 (= ~m_st~0 2)) (.cse19 (= ~E_M~0 ~E_1~0)) (.cse28 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse26 (= 2 ~t1_st~0)) (.cse27 (= ~t2_pc~0 1)) (.cse21 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse22 (= ~m_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse29 (= ~E_M~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse3 .cse4 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse18 .cse9 .cse19 .cse20 .cse21 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse23 .cse24 .cse16) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= ~m_st~0 ~E_M~0) .cse7 .cse25 .cse9 .cse26 .cse19 .cse27 .cse21 .cse11 .cse12 .cse13 .cse14 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= ~token~0 (+ 2 ~local~0)) .cse25 .cse18 .cse9 .cse26 .cse27 .cse21 .cse11 .cse12 .cse13 (< .cse28 ~token~0) .cse14 .cse29) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse27 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 (<= ~token~0 .cse28) .cse9 .cse26 .cse19 .cse27 (<= .cse28 ~token~0) .cse21 .cse11 .cse12 .cse13 .cse14 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse9 .cse26 .cse27 .cse21 .cse11 .cse12 .cse13 .cse22 .cse14 .cse29))) [2022-12-14 10:16:22,996 INFO L899 garLoopResultBuilder]: For program point L692(lines 692 699) no Hoare annotation was computed. [2022-12-14 10:16:22,996 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-12-14 10:16:22,996 INFO L895 garLoopResultBuilder]: At program point $Ultimate##104(lines 445 451) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= ~q_free~0 0) (= 2 ~t1_st~0) (= ~t2_pc~0 1) (= ~E_2~0 2) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (< (+ ~local~0 1) ~token~0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2)) [2022-12-14 10:16:22,996 INFO L899 garLoopResultBuilder]: For program point L661(lines 651 703) no Hoare annotation was computed. [2022-12-14 10:16:22,996 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-12-14 10:16:22,996 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 10:16:22,996 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 472) no Hoare annotation was computed. [2022-12-14 10:16:22,996 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-12-14 10:16:22,996 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 168 203) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0)) (.cse4 (= 0 ~t2_st~0)) (.cse5 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 (= ~q_free~0 1) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse5 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 .cse4 (<= 2 ~p_dw_st~0) .cse5 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-14 10:16:22,996 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 247) the Hoare annotation is: true [2022-12-14 10:16:22,996 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2022-12-14 10:16:22,996 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 23 30) the Hoare annotation is: true [2022-12-14 10:16:22,997 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-12-14 10:16:22,997 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-12-14 10:16:22,997 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 620 644) the Hoare annotation is: true [2022-12-14 10:16:22,997 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 620 644) no Hoare annotation was computed. [2022-12-14 10:16:22,997 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 748 785) the Hoare annotation is: (let ((.cse17 (not (= ~m_st~0 0))) (.cse31 (= ~E_2~0 |old(~E_2~0)|))) (let ((.cse0 (+ ~local~0 1)) (.cse7 (not (= 2 |old(~E_M~0)|))) (.cse10 (and (= ~E_1~0 |old(~E_1~0)|) (= ~E_M~0 2) .cse31)) (.cse27 (not (= ~m_pc~0 0))) (.cse23 (not (<= ~t2_pc~0 0))) (.cse24 (not (= 0 ~t2_st~0))) (.cse20 (<= 2 ~E_1~0)) (.cse21 (= ~m_pc~0 1)) (.cse25 (not (= ~t1_st~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (= 2 |old(~E_2~0)|))) (.cse3 (not (= ~t2_i~0 1))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= 2 ~t2_st~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= 2 ~t1_st~0))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (not (= ~c_num_read~0 0))) (.cse16 (not (= ~q_free~0 0))) (.cse22 (not (= ~m_st~0 2))) (.cse26 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse28 (and (= ~E_M~0 ~E_1~0) .cse31 (= ~E_1~0 2))) (.cse29 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse17)) (.cse18 (not (= ~t2_pc~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse30 (not (= ~token~0 ~local~0)))) (and (or (not (< .cse0 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse21 .cse15 .cse16 .cse22 .cse18 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse12 .cse14 .cse21 .cse15 .cse23 .cse16 .cse22 .cse24 .cse25 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse22 .cse26 (not (<= .cse0 ~token~0)) .cse18 .cse19 (not (<= ~token~0 .cse0))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 (not (= 2 |old(~E_1~0)|)) .cse27 .cse8 .cse9 .cse11 .cse12 (not (= ~t1_pc~0 0)) .cse15 .cse23 .cse16 .cse26 .cse28 .cse24 .cse29 .cse25 .cse19 .cse30) (or .cse20 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9 .cse11 .cse12 .cse14 .cse21 .cse15 .cse23 .cse16 .cse22 .cse24 .cse19) (or .cse20 .cse1 .cse3 .cse4 .cse8 .cse9 .cse11 .cse12 .cse14 .cse21 .cse15 .cse16 .cse22 .cse25 .cse18 .cse19) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse22 .cse26 .cse28 .cse29 .cse18 .cse19 .cse30)))) [2022-12-14 10:16:22,997 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 748 785) no Hoare annotation was computed. [2022-12-14 10:16:22,999 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 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-14 10:16:23,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 10:16:23,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 10:16:23 BoogieIcfgContainer [2022-12-14 10:16:23,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 10:16:23,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 10:16:23,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 10:16:23,068 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 10:16:23,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:12:22" (3/4) ... [2022-12-14 10:16:23,070 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 10:16:23,074 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-12-14 10:16:23,074 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-12-14 10:16:23,074 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-12-14 10:16:23,074 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-12-14 10:16:23,074 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-12-14 10:16:23,075 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-12-14 10:16:23,075 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-12-14 10:16:23,075 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-12-14 10:16:23,075 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-12-14 10:16:23,081 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2022-12-14 10:16:23,082 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-12-14 10:16:23,082 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 10:16:23,083 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 10:16:23,101 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && 1 <= __retres1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(local + 1 <= token)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-12-14 10:16:23,102 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) [2022-12-14 10:16:23,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) [2022-12-14 10:16:23,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write))) && (((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0)) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || ((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || ((((1 <= __retres1 && 0 == __retres1) && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (E_1 == 2 && __retres1 == 0)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= __retres1) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (E_1 == 2 && __retres1 == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) [2022-12-14 10:16:23,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2) [2022-12-14 10:16:23,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0) || (((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1)) [2022-12-14 10:16:23,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_1 == \old(E_1)) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && E_1 == \old(E_1)) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) [2022-12-14 10:16:23,103 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || E_1 == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((((((((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 1 <= __retres1) && __retres1 == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || ((2 == t1_st && E_1 == 2) && __retres1 == 0)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((__retres1 == 0 && 2 == t1_st) && __retres1 == 0)) || ((1 <= __retres1 && __retres1 == 0) && t1_st == 0)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || E_1 == 2) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-12-14 10:16:23,104 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(m_pc == t1_pc) || !(2 <= \old(p_dw_st))) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || m_pc == 1) || !(t2_pc <= 0)) || !(0 == t2_st)) || !(t1_st == 0)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write) [2022-12-14 10:16:23,131 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 10:16:23,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 10:16:23,131 INFO L158 Benchmark]: Toolchain (without parser) took 241477.34ms. Allocated memory was 132.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 92.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2022-12-14 10:16:23,132 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 10:16:23,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.57ms. Allocated memory is still 132.1MB. Free memory was 91.7MB in the beginning and 75.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 10:16:23,132 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.88ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 72.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 10:16:23,132 INFO L158 Benchmark]: Boogie Preprocessor took 26.17ms. Allocated memory is still 132.1MB. Free memory was 72.3MB in the beginning and 69.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 10:16:23,132 INFO L158 Benchmark]: RCFGBuilder took 652.65ms. Allocated memory is still 132.1MB. Free memory was 69.6MB in the beginning and 68.7MB in the end (delta: 874.5kB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-12-14 10:16:23,132 INFO L158 Benchmark]: TraceAbstraction took 240444.97ms. Allocated memory was 132.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 68.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 819.5MB. Max. memory is 16.1GB. [2022-12-14 10:16:23,133 INFO L158 Benchmark]: Witness Printer took 63.57ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 10:16:23,133 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 132.1MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.57ms. Allocated memory is still 132.1MB. Free memory was 91.7MB in the beginning and 75.1MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.88ms. Allocated memory is still 132.1MB. Free memory was 75.1MB in the beginning and 72.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.17ms. Allocated memory is still 132.1MB. Free memory was 72.3MB in the beginning and 69.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.65ms. Allocated memory is still 132.1MB. Free memory was 69.6MB in the beginning and 68.7MB in the end (delta: 874.5kB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 240444.97ms. Allocated memory was 132.1MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 68.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 819.5MB. Max. memory is 16.1GB. * Witness Printer took 63.57ms. Allocated memory is still 1.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 129 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 240.3s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 91.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9646 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9568 mSDsluCounter, 13972 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9058 mSDsCounter, 4041 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13511 IncrementalHoareTripleChecker+Invalid, 17552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4041 mSolverCounterUnsat, 4914 mSDtfsCounter, 13511 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3612 GetRequests, 2845 SyntacticMatches, 41 SemanticMatches, 726 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49004 ImplicationChecksByTransitivity, 77.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5570occurred in iteration=25, InterpolantAutomatonStates: 494, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 32 MinimizatonAttempts, 8576 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 10939 PreInvPairs, 12287 NumberOfFragments, 23416 HoareAnnotationTreeSize, 10939 FomulaSimplifications, 296088 FormulaSimplificationTreeSizeReduction, 35.5s HoareSimplificationTime, 63 FomulaSimplificationsInter, 1387787 FormulaSimplificationTreeSizeReductionInter, 55.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 4770 NumberOfCodeBlocks, 4713 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 5198 ConstructedInterpolants, 0 QuantifiedInterpolants, 10812 SizeOfPredicates, 35 NumberOfNonLiveVariables, 9317 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 3199/3569 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && 1 <= __retres1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(local + 1 <= token)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: ((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0 - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && token == 2 + local) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write))) && (((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0)) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || ((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || ((((1 <= __retres1 && 0 == __retres1) && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (E_1 == 2 && __retres1 == 0)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= __retres1) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (E_1 == 2 && __retres1 == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local)) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(token == local)) && (((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || E_1 == 1) || !(m_pc == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && 2 == t2_st) && m_st == \old(m_st)) && __retres1 == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((((((((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 1 <= __retres1) && __retres1 == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_1 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || ((2 == t1_st && E_1 == 2) && __retres1 == 0)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((__retres1 == 0 && 2 == t1_st) && __retres1 == 0)) || ((1 <= __retres1 && __retres1 == 0) && t1_st == 0)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || E_1 == 2) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || !(token == local))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 651]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && 0 == t2_st)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && 2 == t1_st) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 946]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((!(m_pc == t1_pc) || !(2 <= \old(p_dw_st))) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || m_pc == 1) || !(t2_pc <= 0)) || !(0 == t2_st)) || !(t1_st == 0)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_1 == \old(E_1)) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && E_1 == \old(E_1)) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 923]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 475]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_M == 2) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 168]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1)) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 645]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(E_M == 1)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(E_M == 1))) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && E_M == 2) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2) && !(E_M == 1)) - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 467]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token == local) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0) || (((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && (E_1 == 1 || E_M == E_1)) && token <= local + 1) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1)) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token == local) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_M == 2) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && token <= 2 + local) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && local + 1 < token) && c_last_read == p_last_write) && E_M == 2 RESULT: Ultimate proved your program to be correct! [2022-12-14 10:16:23,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3dc8a941-7f5a-4b2a-8a82-0e9465423faa/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE