./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V --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 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 03:40:07,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 03:40:07,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 03:40:07,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 03:40:07,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 03:40:07,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 03:40:07,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 03:40:07,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 03:40:07,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 03:40:07,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 03:40:07,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 03:40:07,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 03:40:07,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 03:40:07,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 03:40:07,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 03:40:07,782 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 03:40:07,783 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 03:40:07,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 03:40:07,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 03:40:07,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 03:40:07,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 03:40:07,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 03:40:07,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 03:40:07,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 03:40:07,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 03:40:07,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 03:40:07,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 03:40:07,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 03:40:07,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 03:40:07,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 03:40:07,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 03:40:07,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 03:40:07,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 03:40:07,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 03:40:07,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 03:40:07,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 03:40:07,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 03:40:07,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 03:40:07,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 03:40:07,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 03:40:07,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 03:40:07,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 03:40:07,852 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 03:40:07,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 03:40:07,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 03:40:07,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 03:40:07,858 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 03:40:07,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 03:40:07,859 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 03:40:07,859 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 03:40:07,860 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 03:40:07,860 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 03:40:07,861 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 03:40:07,861 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 03:40:07,861 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 03:40:07,862 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 03:40:07,862 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 03:40:07,862 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 03:40:07,862 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 03:40:07,863 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 03:40:07,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 03:40:07,864 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 03:40:07,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 03:40:07,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 03:40:07,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 03:40:07,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 03:40:07,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 03:40:07,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 03:40:07,865 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 03:40:07,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 03:40:07,866 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 03:40:07,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 03:40:07,867 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 03:40:07,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 03:40:07,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:40:07,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 03:40:07,868 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 03:40:07,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 03:40:07,868 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 03:40:07,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 03:40:07,869 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 03:40:07,869 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 03:40:07,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 03:40:07,869 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/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_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V 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 -> 4ebb73aa3b2fe06c298821e537034d0c16e316e18b31a7db411eb85fc916df11 [2021-11-23 03:40:08,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 03:40:08,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 03:40:08,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 03:40:08,232 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 03:40:08,232 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 03:40:08,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2021-11-23 03:40:08,321 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/data/ae2c20a07/7ba88415484848cc8ed755d46a055a9f/FLAGe1366b20e [2021-11-23 03:40:08,988 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 03:40:08,989 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c [2021-11-23 03:40:09,003 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/data/ae2c20a07/7ba88415484848cc8ed755d46a055a9f/FLAGe1366b20e [2021-11-23 03:40:09,249 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/data/ae2c20a07/7ba88415484848cc8ed755d46a055a9f [2021-11-23 03:40:09,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 03:40:09,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 03:40:09,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 03:40:09,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 03:40:09,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 03:40:09,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c2e0a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09, skipping insertion in model container [2021-11-23 03:40:09,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 03:40:09,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 03:40:09,562 WARN L230 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_29ec6e07-9560-4b08-89bd-f9105fdb47dd/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2021-11-23 03:40:09,636 WARN L230 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_29ec6e07-9560-4b08-89bd-f9105fdb47dd/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2021-11-23 03:40:09,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:40:09,728 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 03:40:09,758 WARN L230 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_29ec6e07-9560-4b08-89bd-f9105fdb47dd/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[911,924] [2021-11-23 03:40:09,792 WARN L230 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_29ec6e07-9560-4b08-89bd-f9105fdb47dd/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-1.c[8416,8429] [2021-11-23 03:40:09,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 03:40:09,853 INFO L208 MainTranslator]: Completed translation [2021-11-23 03:40:09,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09 WrapperNode [2021-11-23 03:40:09,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 03:40:09,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 03:40:09,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 03:40:09,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 03:40:09,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,922 INFO L137 Inliner]: procedures = 59, calls = 67, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 498 [2021-11-23 03:40:09,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 03:40:09,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 03:40:09,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 03:40:09,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 03:40:09,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 03:40:09,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 03:40:09,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 03:40:09,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 03:40:09,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (1/1) ... [2021-11-23 03:40:09,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 03:40:10,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:10,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 03:40:10,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 03:40:10,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 03:40:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-23 03:40:10,102 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-23 03:40:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-11-23 03:40:10,102 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-11-23 03:40:10,102 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-23 03:40:10,103 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-23 03:40:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-23 03:40:10,103 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-23 03:40:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-11-23 03:40:10,103 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-11-23 03:40:10,103 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-23 03:40:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-23 03:40:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-23 03:40:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-23 03:40:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-11-23 03:40:10,104 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-11-23 03:40:10,104 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-11-23 03:40:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-11-23 03:40:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-11-23 03:40:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-11-23 03:40:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-23 03:40:10,105 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-23 03:40:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 03:40:10,105 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-23 03:40:10,106 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-23 03:40:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-11-23 03:40:10,106 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-11-23 03:40:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 03:40:10,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 03:40:10,106 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-23 03:40:10,107 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-23 03:40:10,227 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 03:40:10,229 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 03:40:10,916 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2021-11-23 03:40:10,917 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2021-11-23 03:40:10,986 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 03:40:11,275 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 03:40:11,276 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-23 03:40:11,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:40:11 BoogieIcfgContainer [2021-11-23 03:40:11,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 03:40:11,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 03:40:11,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 03:40:11,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 03:40:11,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:40:09" (1/3) ... [2021-11-23 03:40:11,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a08f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:40:11, skipping insertion in model container [2021-11-23 03:40:11,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:09" (2/3) ... [2021-11-23 03:40:11,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a08f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:40:11, skipping insertion in model container [2021-11-23 03:40:11,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:40:11" (3/3) ... [2021-11-23 03:40:11,297 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-1.c [2021-11-23 03:40:11,309 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 03:40:11,309 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-23 03:40:11,365 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 03:40:11,374 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 03:40:11,374 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-23 03:40:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2021-11-23 03:40:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 03:40:11,414 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:11,414 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:11,415 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:11,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1579192629, now seen corresponding path program 1 times [2021-11-23 03:40:11,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:11,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673961479] [2021-11-23 03:40:11,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:11,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:40:11,735 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:11,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673961479] [2021-11-23 03:40:11,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673961479] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:11,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:11,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:40:11,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561986000] [2021-11-23 03:40:11,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:11,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:40:11,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:40:11,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:40:11,790 INFO L87 Difference]: Start difference. First operand has 157 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 114 states have internal predecessors, (161), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) 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) [2021-11-23 03:40:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:12,778 INFO L93 Difference]: Finished difference Result 571 states and 847 transitions. [2021-11-23 03:40:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 03:40:12,781 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 [2021-11-23 03:40:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:12,822 INFO L225 Difference]: With dead ends: 571 [2021-11-23 03:40:12,823 INFO L226 Difference]: Without dead ends: 409 [2021-11-23 03:40:12,835 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:12,843 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 556 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:12,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 574 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 03:40:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-11-23 03:40:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 398. [2021-11-23 03:40:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 282 states have (on average 1.3865248226950355) internal successors, (391), 289 states have internal predecessors, (391), 77 states have call successors, (77), 38 states have call predecessors, (77), 37 states have return successors, (97), 72 states have call predecessors, (97), 75 states have call successors, (97) [2021-11-23 03:40:13,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 565 transitions. [2021-11-23 03:40:13,024 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 565 transitions. Word has length 37 [2021-11-23 03:40:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:13,025 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 565 transitions. [2021-11-23 03:40:13,026 INFO L471 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) [2021-11-23 03:40:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 565 transitions. [2021-11-23 03:40:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-23 03:40:13,030 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:13,030 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:40:13,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 03:40:13,031 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1155886822, now seen corresponding path program 1 times [2021-11-23 03:40:13,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:13,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769602995] [2021-11-23 03:40:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:13,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:40:13,148 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:13,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769602995] [2021-11-23 03:40:13,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769602995] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:13,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:13,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 03:40:13,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519570080] [2021-11-23 03:40:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:13,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:40:13,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:40:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:40:13,153 INFO L87 Difference]: Start difference. First operand 398 states and 565 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:40:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:13,529 INFO L93 Difference]: Finished difference Result 598 states and 842 transitions. [2021-11-23 03:40:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:40:13,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 44 [2021-11-23 03:40:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:13,542 INFO L225 Difference]: With dead ends: 598 [2021-11-23 03:40:13,542 INFO L226 Difference]: Without dead ends: 527 [2021-11-23 03:40:13,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 03:40:13,553 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 269 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:13,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 419 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:40:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2021-11-23 03:40:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 516. [2021-11-23 03:40:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 366 states have (on average 1.3743169398907105) internal successors, (503), 373 states have internal predecessors, (503), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (120), 92 states have call predecessors, (120), 95 states have call successors, (120) [2021-11-23 03:40:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 720 transitions. [2021-11-23 03:40:13,643 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 720 transitions. Word has length 44 [2021-11-23 03:40:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:13,644 INFO L470 AbstractCegarLoop]: Abstraction has 516 states and 720 transitions. [2021-11-23 03:40:13,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:40:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 720 transitions. [2021-11-23 03:40:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-23 03:40:13,659 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:13,659 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:40:13,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 03:40:13,661 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:13,662 INFO L85 PathProgramCache]: Analyzing trace with hash 863856876, now seen corresponding path program 1 times [2021-11-23 03:40:13,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832001672] [2021-11-23 03:40:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:13,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:40:13,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832001672] [2021-11-23 03:40:13,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832001672] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:13,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:13,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:40:13,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382082421] [2021-11-23 03:40:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:13,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:40:13,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:40:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:40:13,806 INFO L87 Difference]: Start difference. First operand 516 states and 720 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:40:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:14,623 INFO L93 Difference]: Finished difference Result 1053 states and 1443 transitions. [2021-11-23 03:40:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:40:14,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2021-11-23 03:40:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:14,629 INFO L225 Difference]: With dead ends: 1053 [2021-11-23 03:40:14,629 INFO L226 Difference]: Without dead ends: 587 [2021-11-23 03:40:14,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:40:14,633 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 654 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:14,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 792 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-23 03:40:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-11-23 03:40:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 502. [2021-11-23 03:40:14,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 352 states have (on average 1.3352272727272727) internal successors, (470), 359 states have internal predecessors, (470), 97 states have call successors, (97), 52 states have call predecessors, (97), 51 states have return successors, (117), 92 states have call predecessors, (117), 95 states have call successors, (117) [2021-11-23 03:40:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 684 transitions. [2021-11-23 03:40:14,686 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 684 transitions. Word has length 45 [2021-11-23 03:40:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:14,687 INFO L470 AbstractCegarLoop]: Abstraction has 502 states and 684 transitions. [2021-11-23 03:40:14,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:40:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 684 transitions. [2021-11-23 03:40:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 03:40:14,689 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:14,689 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:40:14,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 03:40:14,690 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:14,691 INFO L85 PathProgramCache]: Analyzing trace with hash 857725223, now seen corresponding path program 1 times [2021-11-23 03:40:14,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:14,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646949729] [2021-11-23 03:40:14,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:14,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:40:14,784 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:14,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646949729] [2021-11-23 03:40:14,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646949729] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:14,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:14,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:40:14,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228121843] [2021-11-23 03:40:14,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:14,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:40:14,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:40:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:40:14,788 INFO L87 Difference]: Start difference. First operand 502 states and 684 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:40:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:15,529 INFO L93 Difference]: Finished difference Result 968 states and 1292 transitions. [2021-11-23 03:40:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:40:15,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2021-11-23 03:40:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:15,538 INFO L225 Difference]: With dead ends: 968 [2021-11-23 03:40:15,538 INFO L226 Difference]: Without dead ends: 791 [2021-11-23 03:40:15,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-23 03:40:15,550 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 568 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:15,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 735 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-11-23 03:40:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-11-23 03:40:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 766. [2021-11-23 03:40:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 533 states have (on average 1.2926829268292683) internal successors, (689), 540 states have internal predecessors, (689), 146 states have call successors, (146), 86 states have call predecessors, (146), 85 states have return successors, (183), 141 states have call predecessors, (183), 144 states have call successors, (183) [2021-11-23 03:40:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1018 transitions. [2021-11-23 03:40:15,643 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1018 transitions. Word has length 46 [2021-11-23 03:40:15,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:15,644 INFO L470 AbstractCegarLoop]: Abstraction has 766 states and 1018 transitions. [2021-11-23 03:40:15,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-11-23 03:40:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1018 transitions. [2021-11-23 03:40:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-23 03:40:15,646 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:15,647 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:40:15,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 03:40:15,650 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:15,652 INFO L85 PathProgramCache]: Analyzing trace with hash 63830602, now seen corresponding path program 1 times [2021-11-23 03:40:15,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:15,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46817273] [2021-11-23 03:40:15,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:15,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:40:15,755 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:15,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46817273] [2021-11-23 03:40:15,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46817273] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:15,755 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:15,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:40:15,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052594] [2021-11-23 03:40:15,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:15,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:15,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:15,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:40:15,758 INFO L87 Difference]: Start difference. First operand 766 states and 1018 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-23 03:40:15,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:15,865 INFO L93 Difference]: Finished difference Result 767 states and 1019 transitions. [2021-11-23 03:40:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:15,865 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 50 [2021-11-23 03:40:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:15,869 INFO L225 Difference]: With dead ends: 767 [2021-11-23 03:40:15,869 INFO L226 Difference]: Without dead ends: 323 [2021-11-23 03:40:15,871 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:15,872 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:15,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 158 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:40:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-23 03:40:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-11-23 03:40:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 231 states have (on average 1.3722943722943723) internal successors, (317), 235 states have internal predecessors, (317), 61 states have call successors, (61), 30 states have call predecessors, (61), 30 states have return successors, (83), 58 states have call predecessors, (83), 61 states have call successors, (83) [2021-11-23 03:40:15,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 461 transitions. [2021-11-23 03:40:15,906 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 461 transitions. Word has length 50 [2021-11-23 03:40:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:15,907 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 461 transitions. [2021-11-23 03:40:15,907 INFO L471 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-23 03:40:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 461 transitions. [2021-11-23 03:40:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 03:40:15,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:15,910 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:15,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 03:40:15,911 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash 50429275, now seen corresponding path program 1 times [2021-11-23 03:40:15,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:15,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294640050] [2021-11-23 03:40:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:15,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 03:40:16,023 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:16,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294640050] [2021-11-23 03:40:16,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294640050] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:16,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:16,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:40:16,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171401615] [2021-11-23 03:40:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:16,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:40:16,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:40:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:40:16,027 INFO L87 Difference]: Start difference. First operand 323 states and 461 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) [2021-11-23 03:40:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:16,318 INFO L93 Difference]: Finished difference Result 846 states and 1232 transitions. [2021-11-23 03:40:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:40:16,319 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 [2021-11-23 03:40:16,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:16,324 INFO L225 Difference]: With dead ends: 846 [2021-11-23 03:40:16,325 INFO L226 Difference]: Without dead ends: 530 [2021-11-23 03:40:16,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:40:16,328 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 219 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:16,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 323 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:40:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-11-23 03:40:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 500. [2021-11-23 03:40:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 357 states have (on average 1.3529411764705883) internal successors, (483), 363 states have internal predecessors, (483), 94 states have call successors, (94), 48 states have call predecessors, (94), 48 states have return successors, (131), 89 states have call predecessors, (131), 94 states have call successors, (131) [2021-11-23 03:40:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 708 transitions. [2021-11-23 03:40:16,404 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 708 transitions. Word has length 66 [2021-11-23 03:40:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:16,405 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 708 transitions. [2021-11-23 03:40:16,405 INFO L471 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) [2021-11-23 03:40:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 708 transitions. [2021-11-23 03:40:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-23 03:40:16,408 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:16,408 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:16,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 03:40:16,409 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1020376246, now seen corresponding path program 1 times [2021-11-23 03:40:16,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:16,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129142776] [2021-11-23 03:40:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:16,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 03:40:16,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:16,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129142776] [2021-11-23 03:40:16,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129142776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:16,519 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:16,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 03:40:16,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423248153] [2021-11-23 03:40:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:16,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:40:16,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:40:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:40:16,521 INFO L87 Difference]: Start difference. First operand 500 states and 708 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) [2021-11-23 03:40:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:16,902 INFO L93 Difference]: Finished difference Result 1486 states and 2164 transitions. [2021-11-23 03:40:16,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-23 03:40:16,903 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 [2021-11-23 03:40:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:16,912 INFO L225 Difference]: With dead ends: 1486 [2021-11-23 03:40:16,913 INFO L226 Difference]: Without dead ends: 993 [2021-11-23 03:40:16,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-23 03:40:16,917 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 211 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:16,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 269 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:40:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-11-23 03:40:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 943. [2021-11-23 03:40:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 670 states have (on average 1.328358208955224) internal successors, (890), 681 states have internal predecessors, (890), 176 states have call successors, (176), 96 states have call predecessors, (176), 96 states have return successors, (243), 166 states have call predecessors, (243), 176 states have call successors, (243) [2021-11-23 03:40:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1309 transitions. [2021-11-23 03:40:17,057 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1309 transitions. Word has length 67 [2021-11-23 03:40:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:17,060 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1309 transitions. [2021-11-23 03:40:17,061 INFO L471 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) [2021-11-23 03:40:17,064 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1309 transitions. [2021-11-23 03:40:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-23 03:40:17,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:17,068 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:17,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 03:40:17,069 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash -182346185, now seen corresponding path program 1 times [2021-11-23 03:40:17,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:17,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634483299] [2021-11-23 03:40:17,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:17,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 03:40:17,138 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:17,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634483299] [2021-11-23 03:40:17,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634483299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:17,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:17,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:40:17,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124543901] [2021-11-23 03:40:17,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:17,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:17,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:40:17,141 INFO L87 Difference]: Start difference. First operand 943 states and 1309 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) [2021-11-23 03:40:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:17,285 INFO L93 Difference]: Finished difference Result 1958 states and 2750 transitions. [2021-11-23 03:40:17,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:17,286 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 [2021-11-23 03:40:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:17,297 INFO L225 Difference]: With dead ends: 1958 [2021-11-23 03:40:17,297 INFO L226 Difference]: Without dead ends: 1140 [2021-11-23 03:40:17,301 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:17,302 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 36 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 215 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 [2021-11-23 03:40:17,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 215 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:40:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2021-11-23 03:40:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1023. [2021-11-23 03:40:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 738 states have (on average 1.3414634146341464) internal successors, (990), 749 states have internal predecessors, (990), 182 states have call successors, (182), 102 states have call predecessors, (182), 102 states have return successors, (249), 172 states have call predecessors, (249), 182 states have call successors, (249) [2021-11-23 03:40:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1421 transitions. [2021-11-23 03:40:17,435 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1421 transitions. Word has length 68 [2021-11-23 03:40:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:17,435 INFO L470 AbstractCegarLoop]: Abstraction has 1023 states and 1421 transitions. [2021-11-23 03:40:17,435 INFO L471 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) [2021-11-23 03:40:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1421 transitions. [2021-11-23 03:40:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-23 03:40:17,443 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:17,443 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-23 03:40:17,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 03:40:17,444 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:17,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944015, now seen corresponding path program 1 times [2021-11-23 03:40:17,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:17,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485431249] [2021-11-23 03:40:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:17,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 03:40:17,538 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:17,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485431249] [2021-11-23 03:40:17,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485431249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:17,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:40:17,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 03:40:17,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555512685] [2021-11-23 03:40:17,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:17,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:17,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:17,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 03:40:17,541 INFO L87 Difference]: Start difference. First operand 1023 states and 1421 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-23 03:40:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:17,715 INFO L93 Difference]: Finished difference Result 2544 states and 3583 transitions. [2021-11-23 03:40:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:17,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 87 [2021-11-23 03:40:17,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:17,730 INFO L225 Difference]: With dead ends: 2544 [2021-11-23 03:40:17,730 INFO L226 Difference]: Without dead ends: 1527 [2021-11-23 03:40:17,735 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:17,737 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:17,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 179 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:40:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2021-11-23 03:40:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1514. [2021-11-23 03:40:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1093 states have (on average 1.3211344922232389) internal successors, (1444), 1109 states have internal predecessors, (1444), 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) [2021-11-23 03:40:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2075 transitions. [2021-11-23 03:40:17,901 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2075 transitions. Word has length 87 [2021-11-23 03:40:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:17,901 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2075 transitions. [2021-11-23 03:40:17,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-11-23 03:40:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2075 transitions. [2021-11-23 03:40:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:40:17,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:17,910 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:17,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 03:40:17,910 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:17,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1507846843, now seen corresponding path program 1 times [2021-11-23 03:40:17,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:17,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066620360] [2021-11-23 03:40:17,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:17,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-23 03:40:17,978 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:17,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066620360] [2021-11-23 03:40:17,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066620360] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:40:17,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007311052] [2021-11-23 03:40:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:17,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:17,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:17,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:40:18,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 03:40:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:18,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 03:40:18,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:40:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:40:18,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:40:18,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007311052] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:18,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:40:18,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 03:40:18,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889067372] [2021-11-23 03:40:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:18,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:18,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:40:18,487 INFO L87 Difference]: Start difference. First operand 1514 states and 2075 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) [2021-11-23 03:40:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:18,687 INFO L93 Difference]: Finished difference Result 2970 states and 4109 transitions. [2021-11-23 03:40:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:18,688 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 [2021-11-23 03:40:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:18,704 INFO L225 Difference]: With dead ends: 2970 [2021-11-23 03:40:18,704 INFO L226 Difference]: Without dead ends: 1855 [2021-11-23 03:40:18,709 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:18,710 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 22 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 [2021-11-23 03:40:18,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:40:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2021-11-23 03:40:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1799. [2021-11-23 03:40:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1340 states have (on average 1.3074626865671641) internal successors, (1752), 1353 states have internal predecessors, (1752), 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) [2021-11-23 03:40:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2394 transitions. [2021-11-23 03:40:18,900 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2394 transitions. Word has length 101 [2021-11-23 03:40:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:18,901 INFO L470 AbstractCegarLoop]: Abstraction has 1799 states and 2394 transitions. [2021-11-23 03:40:18,901 INFO L471 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) [2021-11-23 03:40:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2394 transitions. [2021-11-23 03:40:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:40:18,910 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:18,910 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:40:18,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 03:40:19,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-23 03:40:19,136 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:19,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash -727865914, now seen corresponding path program 1 times [2021-11-23 03:40:19,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:19,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682623646] [2021-11-23 03:40:19,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:19,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 03:40:19,207 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:19,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682623646] [2021-11-23 03:40:19,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682623646] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:40:19,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904559597] [2021-11-23 03:40:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:19,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:19,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:19,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:40:19,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 03:40:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:19,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 03:40:19,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:40:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 03:40:19,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:40:19,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904559597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:19,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:40:19,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 03:40:19,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090889499] [2021-11-23 03:40:19,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:19,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:19,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:19,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:40:19,619 INFO L87 Difference]: Start difference. First operand 1799 states and 2394 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) [2021-11-23 03:40:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:19,868 INFO L93 Difference]: Finished difference Result 3439 states and 4640 transitions. [2021-11-23 03:40:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:19,869 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 [2021-11-23 03:40:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:19,894 INFO L225 Difference]: With dead ends: 3439 [2021-11-23 03:40:19,894 INFO L226 Difference]: Without dead ends: 2223 [2021-11-23 03:40:19,898 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:19,899 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 103 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 [2021-11-23 03:40:19,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:40:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2021-11-23 03:40:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1928. [2021-11-23 03:40:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1460 states have internal predecessors, (1908), 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) [2021-11-23 03:40:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2572 transitions. [2021-11-23 03:40:20,085 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2572 transitions. Word has length 101 [2021-11-23 03:40:20,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:20,086 INFO L470 AbstractCegarLoop]: Abstraction has 1928 states and 2572 transitions. [2021-11-23 03:40:20,086 INFO L471 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) [2021-11-23 03:40:20,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2572 transitions. [2021-11-23 03:40:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:40:20,095 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:20,095 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:20,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 03:40:20,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:20,316 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:20,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1699267653, now seen corresponding path program 2 times [2021-11-23 03:40:20,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:20,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133633593] [2021-11-23 03:40:20,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:20,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-23 03:40:20,432 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:20,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133633593] [2021-11-23 03:40:20,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133633593] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:40:20,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27353368] [2021-11-23 03:40:20,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 03:40:20,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:20,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:40:20,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 03:40:20,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 03:40:20,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:40:20,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:40:20,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:40:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:40:20,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:40:20,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27353368] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:20,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:40:20,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-11-23 03:40:20,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389236129] [2021-11-23 03:40:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:20,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:40:20,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:40:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 03:40:20,838 INFO L87 Difference]: Start difference. First operand 1928 states and 2572 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) [2021-11-23 03:40:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:21,062 INFO L93 Difference]: Finished difference Result 3494 states and 4658 transitions. [2021-11-23 03:40:21,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:40:21,064 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 [2021-11-23 03:40:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:21,078 INFO L225 Difference]: With dead ends: 3494 [2021-11-23 03:40:21,078 INFO L226 Difference]: Without dead ends: 2082 [2021-11-23 03:40:21,084 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:21,084 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:21,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:40:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2021-11-23 03:40:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2013. [2021-11-23 03:40:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2013 states, 1507 states have (on average 1.3125414731254148) internal successors, (1978), 1526 states have internal predecessors, (1978), 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) [2021-11-23 03:40:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 2676 transitions. [2021-11-23 03:40:21,291 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 2676 transitions. Word has length 101 [2021-11-23 03:40:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:21,291 INFO L470 AbstractCegarLoop]: Abstraction has 2013 states and 2676 transitions. [2021-11-23 03:40:21,292 INFO L471 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) [2021-11-23 03:40:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 2676 transitions. [2021-11-23 03:40:21,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:40:21,299 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:21,300 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:40:21,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 03:40:21,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:21,527 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 825789958, now seen corresponding path program 2 times [2021-11-23 03:40:21,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:21,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712793148] [2021-11-23 03:40:21,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:21,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 03:40:21,637 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:21,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712793148] [2021-11-23 03:40:21,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712793148] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:40:21,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78959011] [2021-11-23 03:40:21,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 03:40:21,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:21,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:21,639 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:40:21,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 03:40:21,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 03:40:21,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 03:40:21,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 03:40:21,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:40:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 03:40:21,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:40:21,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78959011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:21,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:40:21,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 03:40:21,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915618315] [2021-11-23 03:40:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:21,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:21,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:21,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:21,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:40:21,977 INFO L87 Difference]: Start difference. First operand 2013 states and 2676 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-23 03:40:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:22,217 INFO L93 Difference]: Finished difference Result 3400 states and 4713 transitions. [2021-11-23 03:40:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:22,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2021-11-23 03:40:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:22,233 INFO L225 Difference]: With dead ends: 3400 [2021-11-23 03:40:22,234 INFO L226 Difference]: Without dead ends: 2023 [2021-11-23 03:40:22,240 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:22,242 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 82 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:22,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:40:22,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2021-11-23 03:40:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2007. [2021-11-23 03:40:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1501 states have (on average 1.2764823451032645) internal successors, (1916), 1520 states have internal predecessors, (1916), 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) [2021-11-23 03:40:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2614 transitions. [2021-11-23 03:40:22,450 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2614 transitions. Word has length 101 [2021-11-23 03:40:22,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:22,451 INFO L470 AbstractCegarLoop]: Abstraction has 2007 states and 2614 transitions. [2021-11-23 03:40:22,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-23 03:40:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2614 transitions. [2021-11-23 03:40:22,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:40:22,459 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:22,459 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:22,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 03:40:22,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-23 03:40:22,687 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1974996728, now seen corresponding path program 1 times [2021-11-23 03:40:22,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:22,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855620566] [2021-11-23 03:40:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:22,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 03:40:22,776 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:22,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855620566] [2021-11-23 03:40:22,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855620566] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:40:22,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621734379] [2021-11-23 03:40:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:22,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:22,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:22,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:40:22,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 03:40:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:22,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 03:40:22,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:40:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:40:23,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:40:23,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621734379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:23,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:40:23,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 03:40:23,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007516015] [2021-11-23 03:40:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:23,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:23,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:23,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:40:23,130 INFO L87 Difference]: Start difference. First operand 2007 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-23 03:40:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:23,360 INFO L93 Difference]: Finished difference Result 3862 states and 5182 transitions. [2021-11-23 03:40:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:23,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 [2021-11-23 03:40:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:23,378 INFO L225 Difference]: With dead ends: 3862 [2021-11-23 03:40:23,379 INFO L226 Difference]: Without dead ends: 2408 [2021-11-23 03:40:23,385 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:23,386 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 76 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 234 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:40:23,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 234 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:40:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2021-11-23 03:40:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2346. [2021-11-23 03:40:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 1766 states have (on average 1.2621744054360136) internal successors, (2229), 1788 states have internal predecessors, (2229), 335 states have call successors, (335), 232 states have call predecessors, (335), 244 states have return successors, (484), 326 states have call predecessors, (484), 335 states have call successors, (484) [2021-11-23 03:40:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 3048 transitions. [2021-11-23 03:40:23,623 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 3048 transitions. Word has length 101 [2021-11-23 03:40:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:23,624 INFO L470 AbstractCegarLoop]: Abstraction has 2346 states and 3048 transitions. [2021-11-23 03:40:23,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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) [2021-11-23 03:40:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 3048 transitions. [2021-11-23 03:40:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 03:40:23,632 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:23,632 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:23,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 03:40:23,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 03:40:23,847 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash 151407579, now seen corresponding path program 1 times [2021-11-23 03:40:23,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:23,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586767981] [2021-11-23 03:40:23,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:23,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 03:40:23,932 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586767981] [2021-11-23 03:40:23,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586767981] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:40:23,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686909669] [2021-11-23 03:40:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:23,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:23,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:23,934 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:40:23,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 03:40:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:24,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 03:40:24,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:40:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 03:40:24,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:40:24,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686909669] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:40:24,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:40:24,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 03:40:24,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632679203] [2021-11-23 03:40:24,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:40:24,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:40:24,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:40:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:40:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:40:24,209 INFO L87 Difference]: Start difference. First operand 2346 states and 3048 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, (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) [2021-11-23 03:40:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:40:24,485 INFO L93 Difference]: Finished difference Result 5495 states and 7182 transitions. [2021-11-23 03:40:24,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:40:24,486 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, (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 100 [2021-11-23 03:40:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:40:24,509 INFO L225 Difference]: With dead ends: 5495 [2021-11-23 03:40:24,510 INFO L226 Difference]: Without dead ends: 3195 [2021-11-23 03:40:24,521 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:40:24,523 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 40 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 187 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 [2021-11-23 03:40:24,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 187 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 03:40:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2021-11-23 03:40:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2586. [2021-11-23 03:40:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 1964 states have (on average 1.269857433808554) internal successors, (2494), 1987 states have internal predecessors, (2494), 356 states have call successors, (356), 253 states have call predecessors, (356), 265 states have return successors, (505), 346 states have call predecessors, (505), 356 states have call successors, (505) [2021-11-23 03:40:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3355 transitions. [2021-11-23 03:40:24,796 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3355 transitions. Word has length 100 [2021-11-23 03:40:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:40:24,797 INFO L470 AbstractCegarLoop]: Abstraction has 2586 states and 3355 transitions. [2021-11-23 03:40:24,798 INFO L471 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, (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) [2021-11-23 03:40:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3355 transitions. [2021-11-23 03:40:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:40:24,806 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:40:24,806 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:40:24,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 03:40:25,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:25,019 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:40:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:40:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash 2664700, now seen corresponding path program 1 times [2021-11-23 03:40:25,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:40:25,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926380252] [2021-11-23 03:40:25,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:25,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:40:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-23 03:40:25,250 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:40:25,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926380252] [2021-11-23 03:40:25,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926380252] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:40:25,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084319330] [2021-11-23 03:40:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:40:25,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:40:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:40:25,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:40:25,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 03:40:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:40:25,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-23 03:40:25,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:40:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 43 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 03:40:25,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:40:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-23 03:40:26,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084319330] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:40:26,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1297564332] [2021-11-23 03:40:26,119 INFO L159 IcfgInterpreter]: Started Sifa with 56 locations of interest [2021-11-23 03:40:26,119 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:40:26,126 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:40:26,132 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:40:26,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:40:36,298 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 122 for LOIs [2021-11-23 03:40:36,351 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-11-23 03:40:36,362 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-11-23 03:40:37,972 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 122 for LOIs [2021-11-23 03:40:38,005 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 110 for LOIs [2021-11-23 03:40:38,014 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 134 for LOIs [2021-11-23 03:40:38,744 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 134 for LOIs [2021-11-23 03:40:39,469 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 122 for LOIs [2021-11-23 03:40:39,505 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:41:02,872 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '79165#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 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) (<= |#NULL.offset| 0) (<= ~q_req_up~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (<= 0 ~q_ev~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= 0 ~q_req_up~0) (<= ~q_ev~0 0) (= ~a_t~0 0) (<= 0 |#NULL.offset|) (<= 0 ~fast_clk_edge~0) (<= ~fast_clk_edge~0 0) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2021-11-23 03:41:02,872 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:41:02,872 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:41:02,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 4] total 17 [2021-11-23 03:41:02,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013198328] [2021-11-23 03:41:02,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:41:02,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-23 03:41:02,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:41:02,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-23 03:41:02,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=3539, Unknown=0, NotChecked=0, Total=3906 [2021-11-23 03:41:02,876 INFO L87 Difference]: Start difference. First operand 2586 states and 3355 transitions. Second operand has 17 states, 12 states have (on average 9.75) internal successors, (117), 13 states have internal predecessors, (117), 8 states have call successors, (23), 8 states have call predecessors, (23), 10 states have return successors, (24), 9 states have call predecessors, (24), 8 states have call successors, (24) [2021-11-23 03:41:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:41:04,682 INFO L93 Difference]: Finished difference Result 8183 states and 10935 transitions. [2021-11-23 03:41:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-23 03:41:04,683 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 9.75) internal successors, (117), 13 states have internal predecessors, (117), 8 states have call successors, (23), 8 states have call predecessors, (23), 10 states have return successors, (24), 9 states have call predecessors, (24), 8 states have call successors, (24) Word has length 101 [2021-11-23 03:41:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:41:04,743 INFO L225 Difference]: With dead ends: 8183 [2021-11-23 03:41:04,743 INFO L226 Difference]: Without dead ends: 6412 [2021-11-23 03:41:04,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 255 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=541, Invalid=5009, Unknown=0, NotChecked=0, Total=5550 [2021-11-23 03:41:04,758 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 884 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-23 03:41:04,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [900 Valid, 610 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-23 03:41:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2021-11-23 03:41:05,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 6339. [2021-11-23 03:41:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 4870 states have (on average 1.2439425051334703) internal successors, (6058), 4926 states have internal predecessors, (6058), 811 states have call successors, (811), 621 states have call predecessors, (811), 657 states have return successors, (1124), 792 states have call predecessors, (1124), 811 states have call successors, (1124) [2021-11-23 03:41:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 7993 transitions. [2021-11-23 03:41:05,386 INFO L78 Accepts]: Start accepts. Automaton has 6339 states and 7993 transitions. Word has length 101 [2021-11-23 03:41:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:41:05,386 INFO L470 AbstractCegarLoop]: Abstraction has 6339 states and 7993 transitions. [2021-11-23 03:41:05,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 9.75) internal successors, (117), 13 states have internal predecessors, (117), 8 states have call successors, (23), 8 states have call predecessors, (23), 10 states have return successors, (24), 9 states have call predecessors, (24), 8 states have call successors, (24) [2021-11-23 03:41:05,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6339 states and 7993 transitions. [2021-11-23 03:41:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 03:41:05,396 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:41:05,396 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:41:05,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 03:41:05,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-23 03:41:05,612 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:41:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:41:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1547328139, now seen corresponding path program 1 times [2021-11-23 03:41:05,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:41:05,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539884858] [2021-11-23 03:41:05,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:05,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:41:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 03:41:05,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:41:05,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539884858] [2021-11-23 03:41:05,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539884858] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:41:05,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380378588] [2021-11-23 03:41:05,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:05,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:41:05,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:41:05,672 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:41:05,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 03:41:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:05,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 03:41:05,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:41:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 03:41:05,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:41:05,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380378588] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:41:05,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:41:05,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 03:41:05,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895845058] [2021-11-23 03:41:05,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:41:05,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 03:41:05,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:41:05,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 03:41:05,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:41:05,908 INFO L87 Difference]: Start difference. First operand 6339 states and 7993 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) [2021-11-23 03:41:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:41:06,471 INFO L93 Difference]: Finished difference Result 9797 states and 12403 transitions. [2021-11-23 03:41:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 03:41:06,471 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 [2021-11-23 03:41:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:41:06,521 INFO L225 Difference]: With dead ends: 9797 [2021-11-23 03:41:06,521 INFO L226 Difference]: Without dead ends: 7471 [2021-11-23 03:41:06,532 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:41:06,533 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 42 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 217 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:41:06,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 217 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:41:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2021-11-23 03:41:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 6843. [2021-11-23 03:41:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6843 states, 5278 states have (on average 1.2500947328533536) internal successors, (6598), 5334 states have internal predecessors, (6598), 859 states have call successors, (859), 669 states have call predecessors, (859), 705 states have return successors, (1172), 840 states have call predecessors, (1172), 859 states have call successors, (1172) [2021-11-23 03:41:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6843 states to 6843 states and 8629 transitions. [2021-11-23 03:41:07,225 INFO L78 Accepts]: Start accepts. Automaton has 6843 states and 8629 transitions. Word has length 101 [2021-11-23 03:41:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:41:07,226 INFO L470 AbstractCegarLoop]: Abstraction has 6843 states and 8629 transitions. [2021-11-23 03:41:07,226 INFO L471 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) [2021-11-23 03:41:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6843 states and 8629 transitions. [2021-11-23 03:41:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-23 03:41:07,235 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:41:07,236 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:41:07,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-23 03:41:07,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 03:41:07,456 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:41:07,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:41:07,456 INFO L85 PathProgramCache]: Analyzing trace with hash 644121779, now seen corresponding path program 1 times [2021-11-23 03:41:07,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:41:07,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771834810] [2021-11-23 03:41:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:07,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:41:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 03:41:07,579 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:41:07,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771834810] [2021-11-23 03:41:07,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771834810] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:41:07,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552729887] [2021-11-23 03:41:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:07,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:41:07,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:41:07,581 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:41:07,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 03:41:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:07,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 03:41:07,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:41:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 03:41:07,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:41:07,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552729887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:41:07,872 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:41:07,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-11-23 03:41:07,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580786940] [2021-11-23 03:41:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:41:07,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:41:07,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:41:07,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:41:07,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:41:07,874 INFO L87 Difference]: Start difference. First operand 6843 states and 8629 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) [2021-11-23 03:41:08,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:41:08,486 INFO L93 Difference]: Finished difference Result 14436 states and 18210 transitions. [2021-11-23 03:41:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 03:41:08,487 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 [2021-11-23 03:41:08,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:41:08,525 INFO L225 Difference]: With dead ends: 14436 [2021-11-23 03:41:08,525 INFO L226 Difference]: Without dead ends: 8721 [2021-11-23 03:41:08,545 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:41:08,546 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:41:08,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 241 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:41:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2021-11-23 03:41:09,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 7363. [2021-11-23 03:41:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7363 states, 5754 states have (on average 1.22957942301008) internal successors, (7075), 5813 states have internal predecessors, (7075), 858 states have call successors, (858), 708 states have call predecessors, (858), 750 states have return successors, (1209), 842 states have call predecessors, (1209), 858 states have call successors, (1209) [2021-11-23 03:41:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 9142 transitions. [2021-11-23 03:41:09,361 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 9142 transitions. Word has length 102 [2021-11-23 03:41:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:41:09,362 INFO L470 AbstractCegarLoop]: Abstraction has 7363 states and 9142 transitions. [2021-11-23 03:41:09,362 INFO L471 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) [2021-11-23 03:41:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 9142 transitions. [2021-11-23 03:41:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 03:41:09,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:41:09,373 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:41:09,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 03:41:09,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 03:41:09,599 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:41:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:41:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1683201521, now seen corresponding path program 1 times [2021-11-23 03:41:09,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:41:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969839159] [2021-11-23 03:41:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:09,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:41:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 03:41:09,677 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:41:09,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969839159] [2021-11-23 03:41:09,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969839159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:41:09,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:41:09,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:41:09,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395128976] [2021-11-23 03:41:09,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:41:09,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:41:09,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:41:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:41:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:41:09,685 INFO L87 Difference]: Start difference. First operand 7363 states and 9142 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) [2021-11-23 03:41:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:41:10,533 INFO L93 Difference]: Finished difference Result 18861 states and 23360 transitions. [2021-11-23 03:41:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 03:41:10,534 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 [2021-11-23 03:41:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:41:10,571 INFO L225 Difference]: With dead ends: 18861 [2021-11-23 03:41:10,571 INFO L226 Difference]: Without dead ends: 9803 [2021-11-23 03:41:10,595 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:41:10,596 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 82 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:41:10,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 270 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:41:10,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9803 states. [2021-11-23 03:41:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9803 to 9564. [2021-11-23 03:41:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9564 states, 7392 states have (on average 1.2098214285714286) internal successors, (8943), 7486 states have internal predecessors, (8943), 1164 states have call successors, (1164), 948 states have call predecessors, (1164), 1007 states have return successors, (1640), 1130 states have call predecessors, (1640), 1164 states have call successors, (1640) [2021-11-23 03:41:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9564 states to 9564 states and 11747 transitions. [2021-11-23 03:41:11,401 INFO L78 Accepts]: Start accepts. Automaton has 9564 states and 11747 transitions. Word has length 103 [2021-11-23 03:41:11,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:41:11,402 INFO L470 AbstractCegarLoop]: Abstraction has 9564 states and 11747 transitions. [2021-11-23 03:41:11,402 INFO L471 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) [2021-11-23 03:41:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 9564 states and 11747 transitions. [2021-11-23 03:41:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 03:41:11,412 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:41:11,412 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:41:11,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-23 03:41:11,413 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:41:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:41:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1834855246, now seen corresponding path program 1 times [2021-11-23 03:41:11,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:41:11,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621011836] [2021-11-23 03:41:11,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:11,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:41:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 03:41:11,480 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:41:11,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621011836] [2021-11-23 03:41:11,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621011836] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:41:11,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479308630] [2021-11-23 03:41:11,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:11,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:41:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:41:11,482 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:41:11,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 03:41:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:11,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 03:41:11,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:41:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 03:41:11,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:41:11,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479308630] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:41:11,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:41:11,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2021-11-23 03:41:11,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146123142] [2021-11-23 03:41:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:41:11,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:41:11,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:41:11,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:41:11,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:41:11,786 INFO L87 Difference]: Start difference. First operand 9564 states and 11747 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) [2021-11-23 03:41:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:41:12,499 INFO L93 Difference]: Finished difference Result 14176 states and 17405 transitions. [2021-11-23 03:41:12,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:41:12,500 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 [2021-11-23 03:41:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:41:12,529 INFO L225 Difference]: With dead ends: 14176 [2021-11-23 03:41:12,530 INFO L226 Difference]: Without dead ends: 7502 [2021-11-23 03:41:12,547 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:41:12,548 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 159 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-23 03:41:12,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 293 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 03:41:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2021-11-23 03:41:13,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 6998. [2021-11-23 03:41:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6998 states, 5398 states have (on average 1.1963690255650241) internal successors, (6458), 5465 states have internal predecessors, (6458), 865 states have call successors, (865), 702 states have call predecessors, (865), 734 states have return successors, (1163), 831 states have call predecessors, (1163), 865 states have call successors, (1163) [2021-11-23 03:41:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6998 states to 6998 states and 8486 transitions. [2021-11-23 03:41:13,164 INFO L78 Accepts]: Start accepts. Automaton has 6998 states and 8486 transitions. Word has length 103 [2021-11-23 03:41:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:41:13,164 INFO L470 AbstractCegarLoop]: Abstraction has 6998 states and 8486 transitions. [2021-11-23 03:41:13,164 INFO L471 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) [2021-11-23 03:41:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6998 states and 8486 transitions. [2021-11-23 03:41:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 03:41:13,172 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:41:13,172 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:41:13,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 03:41:13,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:41:13,387 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:41:13,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:41:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1829084049, now seen corresponding path program 1 times [2021-11-23 03:41:13,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:41:13,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886535339] [2021-11-23 03:41:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:13,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:41:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 03:41:13,574 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:41:13,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886535339] [2021-11-23 03:41:13,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886535339] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:41:13,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422034701] [2021-11-23 03:41:13,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:41:13,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:41:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:41:13,576 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:41:13,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 03:41:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:41:13,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 03:41:13,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:41:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 03:41:14,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:41:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-23 03:41:14,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422034701] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:41:14,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [156788692] [2021-11-23 03:41:14,469 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2021-11-23 03:41:14,469 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:41:14,470 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:41:14,470 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:41:14,470 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:41:26,601 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 189 for LOIs [2021-11-23 03:41:37,232 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 61 for LOIs [2021-11-23 03:41:37,241 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 195 for LOIs [2021-11-23 03:41:37,306 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 135 for LOIs [2021-11-23 03:41:37,490 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 61 for LOIs [2021-11-23 03:41:37,967 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 219 for LOIs [2021-11-23 03:41:38,948 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:42:06,079 WARN L227 SmtUtils]: Spent 15.76s on a formula simplification. DAG size of input: 591 DAG size of output: 368 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 03:42:20,376 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '225185#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (= ~slow_clk_edge~0 0) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 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) (<= ~t1_pc~0 0) (<= |#NULL.offset| 0) (<= ~q_req_up~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (<= 0 ~q_ev~0) (= 0 ~t2_pc~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= ~m_st~0 1) (<= 0 ~q_req_up~0) (<= ~q_ev~0 0) (= ~a_t~0 0) (<= 0 |#NULL.offset|) (<= 0 ~fast_clk_edge~0) (<= ~fast_clk_edge~0 0) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2021-11-23 03:42:20,377 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:42:20,377 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:42:20,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2021-11-23 03:42:20,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823902740] [2021-11-23 03:42:20,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:42:20,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-23 03:42:20,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:42:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-23 03:42:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2021-11-23 03:42:20,380 INFO L87 Difference]: Start difference. First operand 6998 states and 8486 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) [2021-11-23 03:42:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:42:24,288 INFO L93 Difference]: Finished difference Result 14330 states and 17474 transitions. [2021-11-23 03:42:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-11-23 03:42:24,304 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 [2021-11-23 03:42:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:42:24,330 INFO L225 Difference]: With dead ends: 14330 [2021-11-23 03:42:24,331 INFO L226 Difference]: Without dead ends: 7327 [2021-11-23 03:42:24,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 308 SyntacticMatches, 17 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10622 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=1729, Invalid=22141, Unknown=0, NotChecked=0, Total=23870 [2021-11-23 03:42:24,355 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 1285 mSDsluCounter, 2511 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2373 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-23 03:42:24,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1291 Valid, 2373 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 2570 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-11-23 03:42:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7327 states. [2021-11-23 03:42:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7327 to 3762. [2021-11-23 03:42:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3762 states, 2926 states have (on average 1.16473000683527) internal successors, (3408), 2972 states have internal predecessors, (3408), 425 states have call successors, (425), 373 states have call predecessors, (425), 410 states have return successors, (535), 416 states have call predecessors, (535), 425 states have call successors, (535) [2021-11-23 03:42:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3762 states to 3762 states and 4368 transitions. [2021-11-23 03:42:24,765 INFO L78 Accepts]: Start accepts. Automaton has 3762 states and 4368 transitions. Word has length 109 [2021-11-23 03:42:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:42:24,767 INFO L470 AbstractCegarLoop]: Abstraction has 3762 states and 4368 transitions. [2021-11-23 03:42:24,767 INFO L471 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) [2021-11-23 03:42:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3762 states and 4368 transitions. [2021-11-23 03:42:24,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 03:42:24,772 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:42:24,772 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:42:24,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 03:42:24,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:42:24,987 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:42:24,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:42:24,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1694649747, now seen corresponding path program 1 times [2021-11-23 03:42:24,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:42:24,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965964665] [2021-11-23 03:42:24,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:42:24,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:42:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:42:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 03:42:25,135 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:42:25,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965964665] [2021-11-23 03:42:25,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965964665] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:42:25,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776554603] [2021-11-23 03:42:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:42:25,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:42:25,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:42:25,137 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:42:25,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 03:42:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:42:25,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 03:42:25,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:42:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 03:42:25,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:42:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-23 03:42:25,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776554603] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:42:25,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [452454592] [2021-11-23 03:42:25,989 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2021-11-23 03:42:25,989 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:42:25,990 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:42:25,990 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:42:25,990 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:42:33,289 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 199 for LOIs [2021-11-23 03:42:45,562 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 73 for LOIs [2021-11-23 03:42:45,574 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 205 for LOIs [2021-11-23 03:42:45,646 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 82 for LOIs [2021-11-23 03:42:45,741 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 73 for LOIs [2021-11-23 03:42:46,183 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 229 for LOIs [2021-11-23 03:42:47,414 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:43:21,052 WARN L227 SmtUtils]: Spent 21.07s on a formula simplification. DAG size of input: 601 DAG size of output: 380 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 03:43:35,285 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '251464#(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) (= ~slow_clk_edge~0 0) (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) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 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|) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2021-11-23 03:43:35,285 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:43:35,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:43:35,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2021-11-23 03:43:35,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870565989] [2021-11-23 03:43:35,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:43:35,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-23 03:43:35,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:43:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-23 03:43:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=4692, Unknown=0, NotChecked=0, Total=5112 [2021-11-23 03:43:35,290 INFO L87 Difference]: Start difference. First operand 3762 states and 4368 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) [2021-11-23 03:43:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:43:40,428 INFO L93 Difference]: Finished difference Result 6872 states and 8078 transitions. [2021-11-23 03:43:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-11-23 03:43:40,430 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 [2021-11-23 03:43:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:43:40,443 INFO L225 Difference]: With dead ends: 6872 [2021-11-23 03:43:40,443 INFO L226 Difference]: Without dead ends: 3341 [2021-11-23 03:43:40,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 316 SyntacticMatches, 15 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15789 ImplicationChecksByTransitivity, 50.8s TimeCoverageRelationStatistics Valid=2075, Invalid=33081, Unknown=0, NotChecked=0, Total=35156 [2021-11-23 03:43:40,463 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 1344 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 743 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-23 03:43:40,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1350 Valid, 1920 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [743 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-23 03:43:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2021-11-23 03:43:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 2511. [2021-11-23 03:43:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 1962 states have (on average 1.155453618756371) internal successors, (2267), 1994 states have internal predecessors, (2267), 274 states have call successors, (274), 246 states have call predecessors, (274), 274 states have return successors, (351), 270 states have call predecessors, (351), 274 states have call successors, (351) [2021-11-23 03:43:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 2892 transitions. [2021-11-23 03:43:40,781 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 2892 transitions. Word has length 112 [2021-11-23 03:43:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:43:40,784 INFO L470 AbstractCegarLoop]: Abstraction has 2511 states and 2892 transitions. [2021-11-23 03:43:40,785 INFO L471 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) [2021-11-23 03:43:40,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 2892 transitions. [2021-11-23 03:43:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-11-23 03:43:40,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:43:40,789 INFO L514 BasicCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 03:43:40,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 03:43:41,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:43:41,002 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:43:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:43:41,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1815227635, now seen corresponding path program 1 times [2021-11-23 03:43:41,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:43:41,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738985864] [2021-11-23 03:43:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:43:41,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:43:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:43:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 03:43:41,323 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:43:41,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738985864] [2021-11-23 03:43:41,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738985864] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:43:41,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599575199] [2021-11-23 03:43:41,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:43:41,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:43:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:43:41,325 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:43:41,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 03:43:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:43:41,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 03:43:41,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:43:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 03:43:41,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 03:43:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-11-23 03:43:42,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599575199] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 03:43:42,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1941064747] [2021-11-23 03:43:42,761 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2021-11-23 03:43:42,761 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 03:43:42,764 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 03:43:42,764 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 03:43:42,764 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 03:44:01,631 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 130 for LOIs [2021-11-23 03:44:01,679 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 130 for LOIs [2021-11-23 03:44:01,730 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 151 for LOIs [2021-11-23 03:44:01,809 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 140 for LOIs [2021-11-23 03:44:02,111 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 132 for LOIs [2021-11-23 03:44:02,646 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 151 for LOIs [2021-11-23 03:44:02,699 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 03:44:26,867 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '265514#(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) (= ~slow_clk_edge~0 0) (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) (= ~q_req_up~0 0) (= ~fast_clk_edge~0 0) (= ~q_ev~0 0) (= ~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) (= ~t~0 0) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 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 [2021-11-23 03:44:26,868 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 03:44:26,868 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 03:44:26,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2021-11-23 03:44:26,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968820034] [2021-11-23 03:44:26,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 03:44:26,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-11-23 03:44:26,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:44:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-11-23 03:44:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=6242, Unknown=0, NotChecked=0, Total=6806 [2021-11-23 03:44:26,870 INFO L87 Difference]: Start difference. First operand 2511 states and 2892 transitions. Second operand has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2021-11-23 03:44:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:44:33,009 INFO L93 Difference]: Finished difference Result 6144 states and 7310 transitions. [2021-11-23 03:44:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2021-11-23 03:44:33,010 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 115 [2021-11-23 03:44:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:44:33,024 INFO L225 Difference]: With dead ends: 6144 [2021-11-23 03:44:33,024 INFO L226 Difference]: Without dead ends: 4334 [2021-11-23 03:44:33,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 280 SyntacticMatches, 22 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11047 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=2707, Invalid=22099, Unknown=0, NotChecked=0, Total=24806 [2021-11-23 03:44:33,036 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 2955 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 3571 mSolverCounterSat, 2024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2963 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 5595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2024 IncrementalHoareTripleChecker+Valid, 3571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-23 03:44:33,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2963 Valid, 1185 Invalid, 5595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2024 Valid, 3571 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-23 03:44:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4334 states. [2021-11-23 03:44:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4334 to 1922. [2021-11-23 03:44:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1503 states have (on average 1.1516966067864272) internal successors, (1731), 1513 states have internal predecessors, (1731), 222 states have call successors, (222), 202 states have call predecessors, (222), 196 states have return successors, (242), 206 states have call predecessors, (242), 222 states have call successors, (242) [2021-11-23 03:44:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2195 transitions. [2021-11-23 03:44:33,355 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2195 transitions. Word has length 115 [2021-11-23 03:44:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:44:33,356 INFO L470 AbstractCegarLoop]: Abstraction has 1922 states and 2195 transitions. [2021-11-23 03:44:33,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 8.1) internal successors, (162), 25 states have internal predecessors, (162), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2021-11-23 03:44:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2195 transitions. [2021-11-23 03:44:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-23 03:44:33,360 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:44:33,361 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:44:33,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 03:44:33,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-23 03:44:33,575 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:44:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:44:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash 600715879, now seen corresponding path program 1 times [2021-11-23 03:44:33,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:44:33,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114511598] [2021-11-23 03:44:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:44:33,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:44:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:44:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-23 03:44:33,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:44:33,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114511598] [2021-11-23 03:44:33,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114511598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:44:33,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 03:44:33,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 03:44:33,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011640250] [2021-11-23 03:44:33,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:44:33,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 03:44:33,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:44:33,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 03:44:33,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:44:33,731 INFO L87 Difference]: Start difference. First operand 1922 states and 2195 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) [2021-11-23 03:44:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:44:34,594 INFO L93 Difference]: Finished difference Result 4870 states and 5617 transitions. [2021-11-23 03:44:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:44:34,595 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 [2021-11-23 03:44:34,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:44:34,604 INFO L225 Difference]: With dead ends: 4870 [2021-11-23 03:44:34,604 INFO L226 Difference]: Without dead ends: 3750 [2021-11-23 03:44:34,609 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:44:34,610 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 227 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 546 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.3s IncrementalHoareTripleChecker+Time [2021-11-23 03:44:34,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 546 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 03:44:34,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3750 states. [2021-11-23 03:44:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3750 to 2642. [2021-11-23 03:44:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2057 states have (on average 1.1584832280019446) internal successors, (2383), 2068 states have internal predecessors, (2383), 312 states have call successors, (312), 278 states have call predecessors, (312), 272 states have return successors, (338), 295 states have call predecessors, (338), 312 states have call successors, (338) [2021-11-23 03:44:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 3033 transitions. [2021-11-23 03:44:35,023 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 3033 transitions. Word has length 127 [2021-11-23 03:44:35,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:44:35,024 INFO L470 AbstractCegarLoop]: Abstraction has 2642 states and 3033 transitions. [2021-11-23 03:44:35,024 INFO L471 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) [2021-11-23 03:44:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 3033 transitions. [2021-11-23 03:44:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 03:44:35,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:44:35,029 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:44:35,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 03:44:35,030 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:44:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:44:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1766197489, now seen corresponding path program 1 times [2021-11-23 03:44:35,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:44:35,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640298082] [2021-11-23 03:44:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:44:35,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:44:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:44:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-23 03:44:35,096 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:44:35,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640298082] [2021-11-23 03:44:35,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640298082] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:44:35,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815732800] [2021-11-23 03:44:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:44:35,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:44:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:44:35,103 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:44:35,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 03:44:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:44:35,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:44:35,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:44:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2021-11-23 03:44:35,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:44:35,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815732800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:44:35,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:44:35,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-23 03:44:35,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006805469] [2021-11-23 03:44:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:44:35,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:44:35,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:44:35,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:44:35,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:44:35,527 INFO L87 Difference]: Start difference. First operand 2642 states and 3033 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2021-11-23 03:44:35,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:44:35,820 INFO L93 Difference]: Finished difference Result 3758 states and 4291 transitions. [2021-11-23 03:44:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:44:35,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 158 [2021-11-23 03:44:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:44:35,826 INFO L225 Difference]: With dead ends: 3758 [2021-11-23 03:44:35,826 INFO L226 Difference]: Without dead ends: 1576 [2021-11-23 03:44:35,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 03:44:35,831 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 327 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:44:35,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 327 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:44:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2021-11-23 03:44:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1503. [2021-11-23 03:44:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1172 states have (on average 1.121160409556314) internal successors, (1314), 1182 states have internal predecessors, (1314), 175 states have call successors, (175), 157 states have call predecessors, (175), 155 states have return successors, (191), 163 states have call predecessors, (191), 175 states have call successors, (191) [2021-11-23 03:44:36,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1680 transitions. [2021-11-23 03:44:36,063 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1680 transitions. Word has length 158 [2021-11-23 03:44:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:44:36,064 INFO L470 AbstractCegarLoop]: Abstraction has 1503 states and 1680 transitions. [2021-11-23 03:44:36,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2021-11-23 03:44:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1680 transitions. [2021-11-23 03:44:36,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 03:44:36,069 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:44:36,069 INFO L514 BasicCegarLoop]: 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, 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] [2021-11-23 03:44:36,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 03:44:36,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-23 03:44:36,284 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:44:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:44:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1463275868, now seen corresponding path program 1 times [2021-11-23 03:44:36,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:44:36,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353516343] [2021-11-23 03:44:36,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:44:36,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:44:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:44:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-23 03:44:36,348 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:44:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353516343] [2021-11-23 03:44:36,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353516343] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:44:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18453642] [2021-11-23 03:44:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:44:36,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:44:36,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:44:36,350 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:44:36,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 03:44:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:44:36,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 03:44:36,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:44:36,743 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-23 03:44:36,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:44:36,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18453642] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:44:36,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:44:36,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-23 03:44:36,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007083962] [2021-11-23 03:44:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:44:36,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 03:44:36,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:44:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 03:44:36,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 03:44:36,745 INFO L87 Difference]: Start difference. First operand 1503 states and 1680 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2021-11-23 03:44:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:44:36,957 INFO L93 Difference]: Finished difference Result 2589 states and 2894 transitions. [2021-11-23 03:44:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 03:44:36,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 159 [2021-11-23 03:44:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:44:36,961 INFO L225 Difference]: With dead ends: 2589 [2021-11-23 03:44:36,961 INFO L226 Difference]: Without dead ends: 1535 [2021-11-23 03:44:36,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:44:36,964 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 376 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:44:36,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 376 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:44:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2021-11-23 03:44:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1492. [2021-11-23 03:44:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1161 states have (on average 1.0973298880275624) internal successors, (1274), 1172 states have internal predecessors, (1274), 176 states have call successors, (176), 156 states have call predecessors, (176), 154 states have return successors, (192), 163 states have call predecessors, (192), 176 states have call successors, (192) [2021-11-23 03:44:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1642 transitions. [2021-11-23 03:44:37,157 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1642 transitions. Word has length 159 [2021-11-23 03:44:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:44:37,157 INFO L470 AbstractCegarLoop]: Abstraction has 1492 states and 1642 transitions. [2021-11-23 03:44:37,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2021-11-23 03:44:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1642 transitions. [2021-11-23 03:44:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 03:44:37,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 03:44:37,162 INFO L514 BasicCegarLoop]: 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] [2021-11-23 03:44:37,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-23 03:44:37,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 03:44:37,376 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 03:44:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 03:44:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2072401531, now seen corresponding path program 1 times [2021-11-23 03:44:37,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 03:44:37,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847978785] [2021-11-23 03:44:37,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:44:37,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 03:44:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:44:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-23 03:44:37,464 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 03:44:37,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847978785] [2021-11-23 03:44:37,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847978785] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 03:44:37,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274397998] [2021-11-23 03:44:37,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 03:44:37,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 03:44:37,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 03:44:37,466 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 03:44:37,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 03:44:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 03:44:37,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 03:44:37,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 03:44:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-23 03:44:37,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 03:44:37,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274397998] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 03:44:37,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 03:44:37,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2021-11-23 03:44:37,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879552877] [2021-11-23 03:44:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 03:44:37,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 03:44:37,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 03:44:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 03:44:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 03:44:37,922 INFO L87 Difference]: Start difference. First operand 1492 states and 1642 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) [2021-11-23 03:44:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 03:44:38,246 INFO L93 Difference]: Finished difference Result 1864 states and 2052 transitions. [2021-11-23 03:44:38,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 03:44:38,247 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 [2021-11-23 03:44:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 03:44:38,251 INFO L225 Difference]: With dead ends: 1864 [2021-11-23 03:44:38,251 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 03:44:38,254 INFO L932 BasicCegarLoop]: 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 [2021-11-23 03:44:38,255 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 143 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 03:44:38,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 209 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 03:44:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 03:44:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 03:44:38,275 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) [2021-11-23 03:44:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 03:44:38,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2021-11-23 03:44:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 03:44:38,276 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 03:44:38,277 INFO L471 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) [2021-11-23 03:44:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 03:44:38,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 03:44:38,280 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-23 03:44:38,281 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-23 03:44:38,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 03:44:38,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-23 03:44:38,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 03:45:11,500 WARN L227 SmtUtils]: Spent 15.74s on a formula simplification. DAG size of input: 654 DAG size of output: 562 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 03:45:39,424 WARN L227 SmtUtils]: Spent 16.10s on a formula simplification. DAG size of input: 654 DAG size of output: 562 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 03:45:55,278 WARN L227 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 283 DAG size of output: 270 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 03:46:01,086 WARN L227 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 283 DAG size of output: 270 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 03:46:09,774 WARN L227 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 283 DAG size of output: 270 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 03:46:19,544 WARN L227 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 185 DAG size of output: 173 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 03:46:39,275 WARN L227 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 873 DAG size of output: 176 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 03:46:45,573 WARN L227 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 959 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 03:47:01,370 WARN L227 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 807 DAG size of output: 206 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 03:47:08,986 WARN L227 SmtUtils]: Spent 7.00s on a formula simplification. DAG size of input: 826 DAG size of output: 195 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 03:47:36,465 WARN L227 SmtUtils]: Spent 7.88s on a formula simplification. DAG size of input: 912 DAG size of output: 184 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 03:47:36,469 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 1029 1039) no Hoare annotation was computed. [2021-11-23 03:47:36,470 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 1029 1039) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse21 (= ~m_pc~0 1)) (.cse36 (= ~t1_st~0 0)) (.cse45 (= ~t1_pc~0 1)) (.cse44 (<= 2 ~E_1~0)) (.cse38 (= ~t1_i~0 1)) (.cse39 (= |old(~t1_st~0)| ~t1_st~0)) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse40 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse41 (= |old(~t2_st~0)| ~t2_st~0)) (.cse46 (= ~t2_pc~0 1)) (.cse42 (= ~t2_i~0 1)) (.cse43 (= ~c_dr_pc~0 0))) (let ((.cse26 (and .cse45 .cse44 .cse38 .cse39 .cse35 .cse40 .cse41 .cse46 .cse42 .cse43)) (.cse20 (and .cse35 .cse41 .cse36)) (.cse28 (and .cse45 .cse44 .cse38 .cse39 (not .cse21) .cse35 .cse40 .cse41 .cse46 .cse42 .cse43)) (.cse18 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse8 (not (= ~m_pc~0 0))) (.cse10 (not (= ~T1_E~0 2))) (.cse33 (not (= ~t1_pc~0 0))) (.cse17 (not (= ~E_2~0 ~M_E~0))) (.cse2 (and .cse39 .cse35 .cse41)) (.cse29 (not (= ~E_1~0 2))) (.cse31 (not (<= .cse25 ~token~0))) (.cse32 (not (<= ~token~0 .cse25))) (.cse19 (not (= ~E_2~0 2))) (.cse3 (not (= ~E_M~0 2))) (.cse4 (= |old(~m_st~0)| 0)) (.cse5 (not (<= ~token~0 ~local~0))) (.cse12 (not (<= ~local~0 ~token~0))) (.cse14 (not (= ~E_1~0 1))) (.cse15 (not (= |old(~t1_st~0)| 2))) (.cse23 (not .cse46)) (.cse34 (not (= 2 |old(~t2_st~0)|))) (.cse0 (not .cse42)) (.cse6 (not (= |old(~t2_st~0)| 0))) (.cse7 (not .cse45)) (.cse9 (not .cse38)) (.cse30 (not (= ~E_2~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse37 (= 0 ~t2_st~0)) (.cse13 (not .cse40)) (.cse16 (not (= 0 ~t2_pc~0))) (.cse22 (not (= 2 |old(~m_st~0)|))) (.cse24 (not .cse44)) (.cse27 (= ~E_M~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse19 .cse0 .cse20 .cse9 .cse10 .cse11 .cse21 .cse13 .cse22 .cse23 .cse24) (or (not (< .cse25 ~token~0)) .cse19 .cse0 .cse7 .cse26 .cse9 .cse11 .cse13 .cse15 .cse22 .cse23 .cse24 (not (<= ~token~0 (+ 2 ~local~0))) (not .cse27)) (or .cse19 .cse0 .cse7 .cse9 .cse11 .cse21 .cse13 .cse28 .cse22 .cse23 .cse24) (or .cse0 .cse3 .cse7 .cse26 .cse29 .cse9 .cse30 .cse11 .cse31 .cse13 .cse22 .cse23 .cse24 .cse32) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse20 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse17 .cse23 .cse34) (or .cse0 .cse7 .cse9 .cse30 .cse11 .cse21 .cse13 .cse28 .cse22 .cse23 .cse24 .cse27) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (and .cse35 .cse36 .cse37) .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse6 .cse7 .cse29 .cse9 .cse30 .cse11 .cse31 .cse13 .cse16 .cse22 .cse32) (or .cse19 .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse11 (and .cse38 .cse39 .cse35 .cse40 .cse41 .cse42 .cse43) .cse12 .cse13 .cse14 .cse15 .cse23 .cse34) (or .cse0 .cse6 .cse7 .cse9 .cse30 .cse11 .cse21 (and .cse39 .cse35 .cse37) .cse13 .cse16 .cse22 .cse24 .cse27)))) [2021-11-23 03:47:36,471 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 1029 1039) no Hoare annotation was computed. [2021-11-23 03:47:36,471 INFO L858 garLoopResultBuilder]: For program point update_channels1EXIT(lines 262 276) no Hoare annotation was computed. [2021-11-23 03:47:36,471 INFO L861 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 262 276) the Hoare annotation is: true [2021-11-23 03:47:36,472 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 995 1028) the Hoare annotation is: (let ((.cse19 (= ~m_pc~0 1))) (let ((.cse51 (= 0 ~t2_pc~0)) (.cse4 (= |old(~m_st~0)| 0)) (.cse53 (+ ~local~0 1)) (.cse52 (= 0 ~t2_st~0)) (.cse35 (= ~t1_pc~0 1)) (.cse36 (<= 2 ~E_1~0)) (.cse37 (= ~t1_i~0 1)) (.cse38 (= |old(~t1_st~0)| ~t1_st~0)) (.cse48 (not .cse19)) (.cse40 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse42 (= ~t2_pc~0 1)) (.cse50 (= ~E_2~0 2)) (.cse43 (= ~t2_i~0 1)) (.cse44 (= ~c_dr_pc~0 0)) (.cse39 (= ~m_st~0 |old(~m_st~0)|)) (.cse41 (= |old(~t2_st~0)| ~t2_st~0)) (.cse54 (= ~t1_st~0 0))) (let ((.cse25 (and .cse39 .cse41 .cse54)) (.cse20 (and .cse35 .cse36 .cse37 .cse38 .cse48 .cse39 .cse40 .cse41 .cse42 .cse50 .cse43 .cse44)) (.cse24 (not (= |old(~t1_st~0)| 0))) (.cse1 (not (= ~M_E~0 2))) (.cse31 (and .cse39 .cse54 .cse52)) (.cse8 (not (= ~m_pc~0 0))) (.cse10 (not (= ~T1_E~0 2))) (.cse33 (not (= ~t1_pc~0 0))) (.cse17 (not (= ~E_2~0 ~M_E~0))) (.cse2 (and .cse38 .cse39 .cse41)) (.cse46 (not (<= .cse53 ~token~0))) (.cse47 (not (<= ~token~0 .cse53))) (.cse27 (not (< .cse53 ~token~0))) (.cse34 (not .cse4)) (.cse29 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse14 (not (= ~E_1~0 1))) (.cse45 (not (= ~E_2~0 1))) (.cse30 (= ~E_M~0 1)) (.cse6 (not (= |old(~t2_st~0)| 0))) (.cse49 (and .cse35 .cse36 .cse37 .cse38 .cse48 .cse39 .cse40 .cse41 .cse43 .cse44 .cse51 .cse52)) (.cse16 (not .cse51)) (.cse18 (not .cse50)) (.cse0 (not .cse43)) (.cse3 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse7 (not .cse35)) (.cse32 (not (= ~E_1~0 2))) (.cse9 (not .cse37)) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (<= ~local~0 ~token~0))) (.cse28 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse50 .cse43 .cse44)) (.cse13 (not .cse40)) (.cse15 (not (= |old(~t1_st~0)| 2))) (.cse26 (not (= 2 |old(~m_st~0)|))) (.cse21 (not .cse42)) (.cse22 (not (= 2 |old(~t2_st~0)|))) (.cse23 (not .cse36))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse3 .cse7 .cse8 .cse9 .cse11 .cse19 .cse20 .cse13 .cse15 .cse21 .cse22 .cse23) (or .cse24 .cse18 .cse0 .cse25 .cse9 .cse10 .cse11 .cse19 .cse13 .cse26 .cse21 .cse23) (or .cse27 .cse18 .cse0 .cse7 .cse9 .cse11 .cse28 .cse13 .cse15 .cse26 .cse21 .cse23 .cse29 (not .cse30)) (or .cse24 .cse0 .cse1 .cse3 .cse5 .cse6 .cse31 .cse8 .cse32 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse34 .cse16 .cse17) (or .cse0 .cse3 .cse7 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse32 .cse9 .cse45 .cse11 .cse46 .cse13 .cse26 .cse21 .cse23 .cse47) (or .cse24 .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse25 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse17 .cse21 .cse22) (or .cse24 .cse18 .cse0 .cse6 .cse31 .cse9 .cse10 .cse11 .cse19 .cse13 .cse16 .cse26 .cse23) (or .cse0 .cse7 .cse9 .cse45 .cse11 .cse19 .cse13 (and .cse35 .cse36 .cse37 .cse38 .cse48 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44) .cse26 .cse21 .cse23 .cse30) (or .cse18 .cse0 .cse3 .cse7 .cse32 .cse9 .cse11 .cse46 .cse28 .cse13 .cse15 .cse26 .cse21 .cse22 .cse23 .cse47) (or .cse18 .cse0 .cse7 .cse9 .cse11 .cse19 .cse20 .cse13 .cse26 .cse21 .cse23) (or .cse24 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse31 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse0 .cse2 .cse3 .cse6 .cse7 .cse32 .cse9 .cse45 .cse11 .cse46 .cse13 .cse16 .cse26 .cse47) (or .cse27 .cse18 .cse0 .cse3 .cse7 .cse9 .cse11 .cse28 .cse13 .cse34 .cse15 .cse21 .cse22 .cse23 .cse29) (or .cse18 .cse0 .cse3 .cse4 .cse5 .cse7 .cse9 .cse11 (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse43 .cse44) .cse12 .cse13 .cse14 .cse15 .cse21 .cse22) (or .cse0 .cse6 .cse7 .cse9 .cse45 .cse11 .cse19 .cse49 .cse13 .cse16 .cse26 .cse23 .cse30) (or .cse18 .cse0 .cse6 .cse7 .cse9 .cse11 .cse19 .cse49 .cse13 .cse16 .cse26 .cse23) (or .cse18 .cse0 .cse3 .cse5 .cse7 .cse32 .cse9 .cse11 .cse12 .cse28 .cse13 .cse15 .cse26 .cse21 .cse22 .cse23))))) [2021-11-23 03:47:36,472 INFO L858 garLoopResultBuilder]: For program point L783(lines 783 792) no Hoare annotation was computed. [2021-11-23 03:47:36,472 INFO L858 garLoopResultBuilder]: For program point L783-2(lines 783 792) no Hoare annotation was computed. [2021-11-23 03:47:36,472 INFO L858 garLoopResultBuilder]: For program point L746(lines 746 751) no Hoare annotation was computed. [2021-11-23 03:47:36,473 INFO L854 garLoopResultBuilder]: At program point L775(lines 763 777) the Hoare annotation is: (let ((.cse9 (= ~m_pc~0 1)) (.cse39 (= ~E_M~0 1))) (let ((.cse48 (= ~t2_pc~0 1)) (.cse49 (= ~E_2~0 2)) (.cse16 (= |old(~m_st~0)| 0)) (.cse62 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse61 (= ~m_st~0 2)) (.cse63 (= ~E_2~0 1)) (.cse60 (= 0 ~t2_pc~0)) (.cse54 (not .cse39)) (.cse58 (= ~t1_st~0 0)) (.cse32 (= 0 ~t2_st~0)) (.cse26 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse50 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse34 (<= 2 ~E_1~0)) (.cse24 (not (= ~m_pc~0 ~t1_pc~0))) (.cse25 (= ~t1_i~0 1)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse59 (= ~T1_E~0 2)) (.cse28 (not .cse9)) (.cse30 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse35 (= |old(~t2_st~0)| ~t2_st~0)) (.cse36 (= ~t2_i~0 1)) (.cse31 (= ~c_dr_pc~0 0))) (let ((.cse23 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse42 (and .cse34 .cse24 .cse25 .cse27 .cse59 .cse28 .cse30 .cse35 .cse36 .cse31)) (.cse43 (and .cse26 .cse27 .cse29 .cse35 .cse50)) (.cse4 (and .cse26 .cse29 .cse58 .cse32 .cse50)) (.cse55 (and .cse0 .cse34 .cse24 .cse61 .cse25 .cse26 .cse27 .cse63 .cse28 .cse29 .cse30 .cse35 .cse36 .cse31 .cse60 .cse32 .cse54)) (.cse40 (not (= ~E_1~0 2))) (.cse37 (not .cse63)) (.cse41 (not (<= .cse62 ~token~0))) (.cse45 (not (<= ~token~0 .cse62))) (.cse51 (not (< .cse62 ~token~0))) (.cse47 (not .cse16)) (.cse22 (not (= |old(~t1_st~0)| 2))) (.cse56 (and .cse34 .cse25 .cse26 .cse27 .cse29 .cse30 .cse35 .cse31 .cse50)) (.cse53 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse52 (and .cse0 .cse34 .cse24 .cse61 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse35 .cse48 .cse49 .cse36 .cse31)) (.cse5 (not (= |old(~t2_st~0)| 0))) (.cse18 (not .cse0)) (.cse11 (not .cse60)) (.cse2 (not .cse49)) (.cse12 (not (= 2 |old(~m_st~0)|))) (.cse13 (not .cse34)) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse3 (not .cse36)) (.cse14 (not (= ~M_E~0 2))) (.cse15 (not (= ~E_M~0 2))) (.cse17 (not (<= ~token~0 ~local~0))) (.cse19 (not (= ~m_pc~0 0))) (.cse6 (not .cse25)) (.cse7 (not .cse59)) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse46 (not (= ~t1_pc~0 0))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse10 (not .cse30)) (.cse21 (not (= ~E_1~0 1))) (.cse57 (and .cse26 .cse29 .cse35 .cse58 .cse50)) (.cse33 (not (= ~E_2~0 ~M_E~0))) (.cse38 (not .cse48)) (.cse44 (not (= 2 |old(~t2_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse3 .cse14 .cse15 .cse16 .cse17 .cse5 .cse18 .cse19 .cse6 .cse7 .cse8 .cse20 .cse10 .cse21 .cse22 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse11 .cse33) (or .cse3 (and .cse34 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse35 .cse36 .cse31) .cse18 .cse6 .cse37 .cse8 .cse9 .cse10 .cse12 .cse38 .cse13 .cse39) (or .cse2 .cse3 .cse15 .cse18 .cse40 .cse6 .cse8 .cse41 .cse10 .cse42 .cse22 .cse12 .cse38 .cse43 .cse44 .cse13 .cse45) (or .cse2 .cse3 .cse15 .cse16 .cse17 .cse18 .cse6 .cse8 .cse20 .cse10 .cse21 .cse22 .cse38 .cse44 (and .cse23 .cse25 .cse26 .cse27 .cse29 .cse30 .cse35 .cse31)) (or .cse2 .cse3 .cse15 .cse17 .cse18 .cse40 .cse6 .cse8 .cse20 .cse10 .cse42 .cse22 .cse12 .cse38 .cse43 .cse44 .cse13) (or .cse1 .cse3 .cse14 .cse4 .cse15 .cse17 .cse5 .cse19 .cse40 .cse6 .cse7 .cse8 .cse46 .cse20 .cse10 .cse47 .cse11 .cse33) (or .cse2 .cse3 (and .cse0 .cse34 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse35 .cse48 .cse49 .cse36 .cse31 .cse50) .cse15 .cse18 .cse19 .cse6 .cse8 .cse9 .cse10 .cse22 .cse38 .cse44 .cse13) (or .cse1 .cse3 .cse14 .cse4 .cse15 .cse16 .cse17 .cse5 .cse19 .cse6 .cse7 .cse8 .cse46 .cse20 .cse10 .cse21 .cse11 .cse33) (or .cse51 .cse52 .cse2 .cse3 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) (= ~m_st~0 0) (= 2 ~t1_st~0) .cse35 .cse50) .cse18 .cse6 .cse8 .cse10 .cse22 .cse12 .cse38 .cse13 .cse53 .cse54) (or .cse3 .cse55 .cse5 .cse18 .cse6 .cse37 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse39) (or .cse3 .cse15 .cse18 .cse40 .cse6 .cse37 .cse8 .cse41 .cse10 .cse12 (and .cse24 .cse25 .cse27 .cse28 .cse30 .cse31 .cse32) .cse38 .cse56 .cse13 .cse45) (or .cse3 .cse55 .cse15 .cse5 .cse18 .cse40 .cse6 .cse37 .cse8 .cse41 .cse10 .cse11 .cse12 .cse45 (and .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse50)) (or .cse51 .cse2 .cse3 .cse15 .cse18 .cse6 .cse8 .cse10 .cse47 .cse22 .cse38 .cse56 .cse44 .cse13 .cse53) (or .cse52 .cse2 .cse3 .cse18 .cse6 .cse8 .cse9 .cse10 .cse12 .cse38 .cse13) (or .cse2 .cse3 .cse5 .cse18 .cse6 .cse8 .cse9 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse57 .cse12 .cse38 .cse13) (or .cse1 .cse3 .cse14 .cse15 .cse16 .cse17 .cse19 .cse6 .cse7 .cse8 .cse46 .cse20 .cse10 .cse21 .cse57 .cse33 .cse38 .cse44))))) [2021-11-23 03:47:36,473 INFO L858 garLoopResultBuilder]: For program point L784(lines 784 789) no Hoare annotation was computed. [2021-11-23 03:47:36,473 INFO L858 garLoopResultBuilder]: For program point L764(lines 764 773) no Hoare annotation was computed. [2021-11-23 03:47:36,473 INFO L858 garLoopResultBuilder]: For program point L764-2(lines 764 773) no Hoare annotation was computed. [2021-11-23 03:47:36,473 INFO L854 garLoopResultBuilder]: At program point L756(lines 744 758) the Hoare annotation is: (let ((.cse20 (= ~m_pc~0 1))) (let ((.cse36 (= |old(~m_st~0)| 0)) (.cse16 (= ~t2_pc~0 1)) (.cse17 (= ~E_2~0 2)) (.cse54 (+ ~local~0 1)) (.cse55 (= ~t1_st~0 0)) (.cse7 (= ~t1_pc~0 1)) (.cse8 (<= 2 ~E_1~0)) (.cse12 (not .cse20)) (.cse18 (= ~t2_i~0 1)) (.cse56 (= 0 ~t2_pc~0)) (.cse48 (= 0 ~t2_st~0)) (.cse9 (= ~t1_i~0 1)) (.cse10 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse11 (= |old(~t1_st~0)| ~t1_st~0)) (.cse13 (= ~m_st~0 |old(~m_st~0)|)) (.cse14 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= |old(~t2_st~0)| ~t2_st~0)) (.cse19 (= ~c_dr_pc~0 0))) (let ((.cse43 (and .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse19)) (.cse45 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse56 .cse48)) (.cse35 (not (= ~M_E~0 2))) (.cse27 (not (<= ~token~0 ~local~0))) (.cse42 (not (= |old(~t2_st~0)| 0))) (.cse49 (and .cse10 .cse13 .cse55 .cse48)) (.cse4 (not (= ~m_pc~0 0))) (.cse38 (not (= ~t1_pc~0 0))) (.cse29 (not (<= ~local~0 ~token~0))) (.cse40 (not (= ~E_1~0 1))) (.cse44 (not .cse56)) (.cse41 (not (= ~E_2~0 ~M_E~0))) (.cse28 (not (= ~E_1~0 2))) (.cse32 (not (<= .cse54 ~token~0))) (.cse33 (not (<= ~token~0 .cse54))) (.cse47 (= 2 ~t1_st~0)) (.cse51 (and .cse7 .cse8 (= ~m_st~0 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (.cse34 (not (= |old(~t1_st~0)| 0))) (.cse37 (not (= ~T1_E~0 2))) (.cse39 (and .cse10 .cse13 .cse15 .cse55)) (.cse31 (not (= ~E_2~0 1))) (.cse30 (not (= 2 |old(~m_st~0)|))) (.cse46 (= ~E_M~0 1)) (.cse52 (not (< .cse54 ~token~0))) (.cse0 (not .cse17)) (.cse1 (not .cse18)) (.cse26 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19)) (.cse2 (not (= ~E_M~0 2))) (.cse3 (not .cse7)) (.cse5 (not .cse9)) (.cse6 (not (= ~p_dw_pc~0 0))) (.cse21 (not .cse14)) (.cse50 (not .cse36)) (.cse22 (not (= |old(~t1_st~0)| 2))) (.cse23 (not .cse16)) (.cse24 (not (= 2 |old(~t2_st~0)|))) (.cse25 (not .cse8)) (.cse53 (not (<= ~token~0 (+ 2 ~local~0))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse0 .cse1 .cse26 .cse2 .cse27 .cse3 .cse28 .cse5 .cse6 .cse29 .cse21 .cse22 .cse30 .cse23 .cse24 .cse25) (or .cse1 .cse2 .cse3 .cse28 .cse5 .cse31 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse19) .cse32 .cse21 .cse30 .cse23 .cse25 .cse33) (or .cse34 .cse1 .cse35 .cse2 .cse36 .cse27 .cse4 .cse5 .cse37 .cse6 .cse38 .cse29 .cse39 .cse21 .cse40 .cse41 .cse23 .cse24) (or .cse1 .cse2 .cse42 .cse3 .cse28 .cse5 .cse31 .cse6 .cse32 .cse21 .cse43 .cse44 .cse30 .cse33) (or .cse1 .cse42 .cse3 .cse5 .cse31 .cse6 .cse20 .cse45 .cse21 .cse44 .cse30 .cse25 .cse46) (or .cse0 .cse1 .cse2 .cse36 .cse27 .cse3 .cse5 .cse6 .cse29 .cse21 .cse40 .cse22 .cse43 .cse23 .cse24) (or .cse1 .cse35 .cse2 .cse36 .cse27 .cse42 .cse3 .cse4 .cse5 .cse37 .cse6 .cse29 (and .cse10 .cse13 .cse47 .cse48) .cse21 .cse40 .cse22 .cse44 .cse41) (or .cse34 .cse1 .cse35 .cse2 .cse27 .cse42 .cse49 .cse4 .cse28 .cse5 .cse37 .cse6 .cse38 .cse29 .cse21 .cse50 .cse44 .cse41) (or .cse0 .cse1 .cse42 .cse3 .cse5 .cse6 .cse20 .cse45 .cse21 .cse44 .cse30 .cse25) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse20 .cse21 .cse30 .cse51 .cse23 .cse25) (or .cse34 .cse0 .cse1 .cse42 .cse5 .cse37 .cse6 .cse20 .cse21 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse48) .cse44 .cse30 .cse25) (or .cse34 .cse1 .cse35 .cse2 .cse36 .cse27 .cse42 .cse49 .cse4 .cse5 .cse37 .cse6 .cse38 .cse29 .cse21 .cse40 .cse44 .cse41) (or .cse0 .cse1 .cse26 .cse2 .cse3 .cse28 .cse5 .cse6 .cse32 .cse21 .cse22 .cse30 .cse23 .cse24 .cse25 .cse33) (or .cse52 .cse0 .cse1 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse13 .cse47 .cse15) .cse3 .cse5 .cse6 .cse21 .cse22 .cse30 .cse51 .cse23 .cse25 .cse53 (not .cse46)) (or .cse34 .cse0 .cse1 .cse5 .cse37 .cse6 .cse20 .cse39 .cse21 .cse30 .cse23 .cse25) (or .cse1 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19) .cse3 .cse5 .cse31 .cse6 .cse20 .cse21 .cse30 .cse23 .cse25 .cse46) (or .cse52 .cse0 .cse1 .cse26 .cse2 .cse3 .cse5 .cse6 .cse21 .cse50 .cse22 .cse23 .cse24 .cse25 .cse53))))) [2021-11-23 03:47:36,474 INFO L858 garLoopResultBuilder]: For program point L765(lines 765 770) no Hoare annotation was computed. [2021-11-23 03:47:36,474 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 995 1028) no Hoare annotation was computed. [2021-11-23 03:47:36,474 INFO L854 garLoopResultBuilder]: At program point L794(lines 782 796) the Hoare annotation is: (let ((.cse13 (= ~m_pc~0 1)) (.cse54 (= ~E_M~0 1))) (let ((.cse57 (= ~T1_E~0 2)) (.cse45 (= |old(~t1_st~0)| ~t1_st~0)) (.cse60 (= ~E_2~0 1)) (.cse61 (= 0 ~t2_pc~0)) (.cse26 (not .cse54)) (.cse0 (= ~t1_pc~0 1)) (.cse44 (<= 2 ~E_1~0)) (.cse38 (not (= ~m_pc~0 ~t1_pc~0))) (.cse62 (= ~m_st~0 2)) (.cse39 (= ~t1_i~0 1)) (.cse40 (not .cse13)) (.cse41 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (= |old(~t2_st~0)| ~t2_st~0)) (.cse56 (= ~t2_pc~0 1)) (.cse58 (= ~E_2~0 2)) (.cse42 (= ~t2_i~0 1)) (.cse43 (= ~c_dr_pc~0 0)) (.cse4 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse19 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|)) (.cse6 (= ~t1_st~0 0)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse29 (= |old(~m_st~0)| 0)) (.cse59 (+ ~local~0 1))) (let ((.cse18 (not (< .cse59 ~token~0))) (.cse25 (not (<= ~token~0 (+ 2 ~local~0)))) (.cse48 (not .cse29)) (.cse36 (and .cse4 .cse19 .cse5 .cse6 .cse7 .cse8)) (.cse22 (and .cse0 .cse44 .cse38 .cse62 .cse39 .cse4 .cse40 .cse5 .cse41 .cse20 .cse56 .cse58 .cse42 .cse43)) (.cse37 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse50 (and .cse0 .cse44 .cse38 .cse62 .cse39 .cse4 .cse60 .cse40 .cse5 .cse41 .cse20 .cse42 .cse43 .cse61 .cse7 .cse26)) (.cse9 (not (= |old(~t2_st~0)| 0))) (.cse15 (not .cse61)) (.cse47 (and .cse4 .cse45 .cse19 .cse5 .cse20 .cse8)) (.cse55 (and .cse44 .cse38 .cse39 .cse57 .cse40 .cse5 .cse41 .cse20 .cse42 .cse43)) (.cse23 (not (= |old(~t1_st~0)| 2))) (.cse27 (not (= ~M_E~0 2))) (.cse30 (not (<= ~token~0 ~local~0))) (.cse31 (not (= ~m_pc~0 0))) (.cse32 (not (= ~t1_pc~0 0))) (.cse33 (not (<= ~local~0 ~token~0))) (.cse34 (not (= ~E_1~0 1))) (.cse35 (not (= ~E_2~0 ~M_E~0))) (.cse46 (not (= 2 |old(~t2_st~0)|))) (.cse28 (not (= ~E_M~0 2))) (.cse21 (not .cse0)) (.cse49 (not (= ~E_1~0 2))) (.cse51 (not .cse60)) (.cse52 (not (<= .cse59 ~token~0))) (.cse53 (not (<= ~token~0 .cse59))) (.cse1 (not (= |old(~t1_st~0)| 0))) (.cse2 (not .cse58)) (.cse3 (not .cse42)) (.cse10 (not .cse39)) (.cse11 (not .cse57)) (.cse12 (not (= ~p_dw_pc~0 0))) (.cse14 (not .cse41)) (.cse16 (not (= 2 |old(~m_st~0)|))) (.cse24 (not .cse56)) (.cse17 (not .cse44))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse19 (= ~m_st~0 0) (= 2 ~t1_st~0) .cse20 .cse8) .cse2 .cse3 .cse21 .cse10 .cse12 .cse22 .cse14 .cse23 .cse16 .cse24 .cse17 .cse25 .cse26) (or .cse1 .cse2 .cse3 .cse21 .cse10 .cse6 .cse12 .cse13 .cse14 .cse16 .cse24 .cse17) (or .cse1 .cse3 .cse27 .cse28 .cse29 .cse30 .cse9 .cse31 .cse10 .cse11 .cse12 .cse32 .cse33 .cse14 .cse34 .cse15 .cse35 .cse36) (or .cse3 .cse27 .cse28 .cse29 .cse30 .cse9 .cse21 .cse31 .cse10 .cse11 .cse12 .cse33 .cse14 .cse34 .cse23 (and .cse37 .cse38 .cse39 .cse4 .cse19 .cse40 .cse5 .cse41 .cse20 .cse6 .cse42 .cse43 .cse7) .cse15 .cse35) (or .cse2 .cse3 .cse28 .cse21 .cse31 .cse10 .cse12 .cse13 .cse14 .cse23 (and .cse44 .cse38 .cse39 .cse4 .cse45 .cse19 .cse40 .cse5 .cse41 .cse20 .cse42 .cse43 .cse8) .cse24 .cse46 .cse17) (or .cse18 .cse2 .cse3 .cse28 .cse47 .cse21 .cse10 .cse12 .cse14 .cse48 .cse23 .cse24 .cse46 .cse17 .cse25) (or .cse1 .cse3 .cse27 .cse28 .cse30 .cse9 (and .cse48 (not (= ~E_M~0 |old(~m_st~0)|))) .cse31 .cse49 .cse10 .cse11 .cse12 .cse32 .cse33 .cse14 .cse15 .cse35 .cse36) (or .cse2 .cse3 .cse21 .cse10 .cse12 .cse13 .cse22 .cse14 .cse16 .cse24 .cse17) (or .cse2 .cse3 (and .cse37 .cse4 .cse19 .cse5 .cse20 .cse6) .cse28 .cse29 .cse30 .cse21 .cse10 .cse12 .cse33 .cse14 .cse34 .cse23 .cse24 .cse46) (or .cse3 .cse28 .cse9 .cse50 .cse21 .cse49 .cse10 .cse51 .cse12 .cse52 .cse14 .cse15 .cse16 .cse53 (and .cse4 .cse45 .cse19 .cse5 .cse7 .cse8)) (or .cse2 .cse3 .cse9 (and .cse38 .cse39 .cse4 .cse40 .cse5 .cse41 .cse20 .cse42 .cse43 .cse7) .cse21 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse3 .cse9 .cse50 .cse21 .cse10 .cse51 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse54) (or .cse2 .cse3 .cse28 .cse47 .cse55 .cse21 .cse49 .cse10 .cse12 .cse52 .cse14 .cse23 .cse16 .cse24 .cse46 .cse17 .cse53) (or .cse3 (and .cse44 .cse38 .cse39 .cse4 .cse40 .cse5 .cse41 .cse20 .cse42 .cse43) .cse21 .cse10 .cse51 .cse12 .cse13 .cse14 .cse16 .cse24 .cse17 .cse54) (or .cse1 .cse2 .cse3 .cse9 .cse21 .cse10 .cse6 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse2 .cse3 .cse28 .cse47 .cse55 .cse30 .cse21 .cse49 .cse10 .cse12 .cse33 .cse14 .cse23 .cse16 .cse24 .cse46 .cse17) (or .cse1 .cse3 .cse27 .cse28 .cse29 .cse30 .cse31 .cse10 .cse11 .cse12 .cse32 .cse33 (and .cse4 .cse19 .cse5 .cse20 .cse6 .cse8) .cse14 .cse34 .cse35 .cse24 .cse46) (or (and .cse4 .cse45 .cse5 .cse20 (<= 1 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse8) .cse3 .cse28 .cse21 .cse49 .cse10 .cse51 .cse12 (and .cse38 .cse39 .cse40 .cse41 .cse20 .cse42 .cse43 .cse7) .cse52 .cse14 .cse16 .cse24 .cse17 .cse53) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse4 .cse5 .cse20 .cse6 .cse8) .cse16 .cse24 .cse17))))) [2021-11-23 03:47:36,475 INFO L858 garLoopResultBuilder]: For program point L745(lines 745 754) no Hoare annotation was computed. [2021-11-23 03:47:36,475 INFO L858 garLoopResultBuilder]: For program point L745-2(lines 745 754) no Hoare annotation was computed. [2021-11-23 03:47:36,475 INFO L861 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 387 411) the Hoare annotation is: true [2021-11-23 03:47:36,475 INFO L858 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 387 411) no Hoare annotation was computed. [2021-11-23 03:47:36,475 INFO L858 garLoopResultBuilder]: For program point L401(line 401) no Hoare annotation was computed. [2021-11-23 03:47:36,475 INFO L861 garLoopResultBuilder]: At program point L393(line 393) the Hoare annotation is: true [2021-11-23 03:47:36,476 INFO L861 garLoopResultBuilder]: At program point L395-2(lines 395 399) the Hoare annotation is: true [2021-11-23 03:47:36,476 INFO L858 garLoopResultBuilder]: For program point L393-1(line 393) no Hoare annotation was computed. [2021-11-23 03:47:36,476 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 798 805) no Hoare annotation was computed. [2021-11-23 03:47:36,476 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 798 805) the Hoare annotation is: true [2021-11-23 03:47:36,476 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 919 956) the Hoare annotation is: (let ((.cse11 (= ~t1_pc~0 1)) (.cse43 (= ~m_st~0 2)) (.cse14 (= ~t1_i~0 1)) (.cse15 (= |old(~T1_E~0)| ~T1_E~0)) (.cse44 (= 2 ~t2_st~0)) (.cse16 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (= ~t2_pc~0 1)) (.cse18 (= ~E_2~0 2)) (.cse20 (= ~c_dr_pc~0 0)) (.cse22 (= ~E_M~0 2)) (.cse40 (= ~E_1~0 2)) (.cse19 (= ~t2_i~0 1)) (.cse28 (= ~m_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse13 (= ~M_E~0 |old(~M_E~0)|)) (.cse39 (= ~T1_E~0 2)) (.cse23 (= ~E_2~0 |old(~E_2~0)|)) (.cse34 (not (= ~E_M~0 1)))) (let ((.cse21 (= ~E_1~0 |old(~E_1~0)|)) (.cse30 (and .cse12 .cse13 .cse39 .cse23 .cse34)) (.cse36 (not .cse28)) (.cse0 (+ ~local~0 1)) (.cse27 (not (= |old(~T1_E~0)| 2))) (.cse35 (not (= ~m_pc~0 0))) (.cse31 (not (= 0 ~t2_st~0))) (.cse32 (not (= 0 ~t2_pc~0))) (.cse25 (not (= ~m_st~0 0))) (.cse33 (not (= ~t1_st~0 0))) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse2 (not .cse19)) (.cse41 (not (<= ~token~0 ~local~0))) (.cse37 (and .cse11 .cse12 .cse13 .cse43 .cse14 .cse15 .cse44 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse40)) (.cse3 (not .cse11)) (.cse38 (not (= 2 |old(~E_1~0)|))) (.cse4 (not .cse44)) (.cse5 (not (= 2 |old(~E_M~0)|))) (.cse6 (not .cse14)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not (= 2 ~t1_st~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (= |old(~E_M~0)| 1)) (.cse29 (not .cse43)) (.cse42 (not (<= ~local~0 ~token~0))) (.cse24 (not .cse16)) (.cse26 (not .cse17))) (and (or (not (< .cse0 ~token~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse1 .cse2 .cse27 .cse6 .cse7 .cse9 .cse28 .cse10 .cse29 .cse30 .cse31 .cse24 .cse32 .cse33) (or .cse1 .cse2 (and .cse12 .cse13 .cse15 .cse23 .cse34) .cse3 .cse6 .cse7 .cse9 .cse28 .cse10 .cse29 .cse31 .cse24 .cse32) (or .cse1 .cse2 .cse3 .cse35 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse28 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse34) .cse24 .cse26) (or .cse1 .cse2 .cse27 .cse6 .cse7 .cse9 .cse28 .cse10 .cse29 .cse30 .cse24 .cse33 .cse26) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse9 .cse28 .cse10 .cse29 .cse24 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse34) .cse26) (or .cse1 .cse2 .cse37 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 (not (<= .cse0 ~token~0)) .cse24 .cse26 (not (<= ~token~0 .cse0))) (or (and .cse39 .cse22 .cse23 .cse40 (= ~M_E~0 2)) (not (= ~m_pc~0 ~t1_pc~0)) .cse2 (not (= |old(~E_2~0)| |old(~M_E~0)|)) .cse41 .cse27 .cse38 .cse35 .cse5 .cse6 .cse7 .cse42 .cse31 .cse24 .cse32 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse25) .cse33 (not (= 2 |old(~M_E~0)|))) (or .cse1 .cse2 .cse41 .cse37 .cse3 .cse38 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse29 .cse42 .cse24 .cse26)))) [2021-11-23 03:47:36,477 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 919 956) no Hoare annotation was computed. [2021-11-23 03:47:36,477 INFO L861 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 315 332) the Hoare annotation is: true [2021-11-23 03:47:36,477 INFO L858 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 315 332) no Hoare annotation was computed. [2021-11-23 03:47:36,477 INFO L861 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 99 127) the Hoare annotation is: true [2021-11-23 03:47:36,477 INFO L861 garLoopResultBuilder]: At program point L124(lines 102 126) the Hoare annotation is: true [2021-11-23 03:47:36,477 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 119) no Hoare annotation was computed. [2021-11-23 03:47:36,478 INFO L858 garLoopResultBuilder]: For program point L113-1(lines 113 122) no Hoare annotation was computed. [2021-11-23 03:47:36,478 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 109) no Hoare annotation was computed. [2021-11-23 03:47:36,478 INFO L858 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 99 127) no Hoare annotation was computed. [2021-11-23 03:47:36,478 INFO L858 garLoopResultBuilder]: For program point L103(lines 103 112) no Hoare annotation was computed. [2021-11-23 03:47:36,478 INFO L858 garLoopResultBuilder]: For program point L103-2(lines 102 126) no Hoare annotation was computed. [2021-11-23 03:47:36,479 INFO L854 garLoopResultBuilder]: At program point L861(line 861) the Hoare annotation is: (let ((.cse31 (+ ~local~0 1)) (.cse29 (= ~t1_st~0 0)) (.cse28 (= ~m_st~0 ~E_M~0)) (.cse30 (= ~m_st~0 0))) (let ((.cse27 (= ~t1_pc~0 0)) (.cse32 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse23 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse33 (= ~m_pc~0 ~t1_pc~0)) (.cse34 (or .cse28 .cse30)) (.cse10 (= ~m_pc~0 0)) (.cse25 (= ~E_2~0 ~M_E~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= ~local~0 ~token~0)) (.cse26 (= ~M_E~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (or (= |exists_runnable_thread2_#res| 1) (not .cse29))) (.cse3 (= 2 ~t2_st~0)) (.cse21 (<= ~token~0 .cse31)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse22 (<= .cse31 ~token~0)) (.cse11 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse12 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse24 (= ~T1_E~0 2)) (.cse13 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16) (and .cse0 .cse12 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse18 .cse19 .cse20) (and .cse0 .cse12 .cse2 .cse21 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse14 .cse11 .cse15 .cse20 .cse23) (and .cse0 .cse12 .cse2 .cse24 .cse4 .cse5 .cse8 .cse9 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse27 .cse2 .cse28 .cse24 .cse5 .cse29 .cse8 .cse9 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse31 ~token~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse30 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse32) (and .cse0 .cse12 .cse2 .cse21 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse15 .cse20 .cse32) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse2 .cse33 .cse24 .cse3 .cse30 .cse5 .cse29 .cse6 .cse8 .cse9 .cse10 .cse25 .cse11 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse0 .cse12 .cse2 .cse5 .cse29 .cse7 .cse8 .cse9 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse23) (and .cse12 .cse27 .cse2 .cse24 .cse3 .cse5 .cse29 .cse6 .cse8 .cse9 .cse25 .cse11 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse0 .cse2 .cse3 .cse5 .cse34 .cse29 .cse6 .cse7 (not .cse30) .cse8 .cse9 .cse11 .cse18 .cse19 .cse20 .cse32) (and .cse0 .cse2 .cse24 .cse30 .cse4 .cse5 .cse8 .cse9 .cse10 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse2 .cse33 .cse24 .cse5 .cse34 .cse29 .cse8 .cse9 .cse10 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26) (and .cse1 .cse12 .cse2 .cse24 .cse13 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse0 .cse12 .cse17 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse20) (and .cse1 .cse12 .cse2 .cse24 .cse13 .cse5 .cse29 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16)))) [2021-11-23 03:47:36,479 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2021-11-23 03:47:36,479 INFO L858 garLoopResultBuilder]: For program point L432(lines 432 439) no Hoare annotation was computed. [2021-11-23 03:47:36,479 INFO L854 garLoopResultBuilder]: At program point L730(line 730) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t1_st~0) .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ ~local~0 1) ~token~0) (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)) (= ~E_M~0 1)) (and .cse1 .cse2 .cse3 (= ~T1_E~0 2) .cse4 .cse5 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9))) [2021-11-23 03:47:36,479 INFO L858 garLoopResultBuilder]: For program point L730-1(line 730) no Hoare annotation was computed. [2021-11-23 03:47:36,480 INFO L854 garLoopResultBuilder]: At program point L499-1(lines 496 536) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,480 INFO L854 garLoopResultBuilder]: At program point L1127(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2021-11-23 03:47:36,480 INFO L854 garLoopResultBuilder]: At program point L1127-1(line 1127) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2021-11-23 03:47:36,480 INFO L858 garLoopResultBuilder]: For program point L863(line 863) no Hoare annotation was computed. [2021-11-23 03:47:36,480 INFO L858 garLoopResultBuilder]: For program point L632(lines 632 636) no Hoare annotation was computed. [2021-11-23 03:47:36,480 INFO L854 garLoopResultBuilder]: At program point L599(line 599) the Hoare annotation is: false [2021-11-23 03:47:36,481 INFO L854 garLoopResultBuilder]: At program point L1128(line 1128) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~t1_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2021-11-23 03:47:36,481 INFO L854 garLoopResultBuilder]: At program point L633(lines 628 667) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~t1_i~0 1) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t2_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) [2021-11-23 03:47:36,481 INFO L854 garLoopResultBuilder]: At program point L898(lines 860 912) the Hoare annotation is: (let ((.cse31 (+ ~local~0 1)) (.cse29 (= ~t1_st~0 0)) (.cse28 (= ~m_st~0 ~E_M~0)) (.cse30 (= ~m_st~0 0))) (let ((.cse27 (= ~t1_pc~0 0)) (.cse32 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse23 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse33 (= ~m_pc~0 ~t1_pc~0)) (.cse34 (or .cse28 .cse30)) (.cse10 (= ~m_pc~0 0)) (.cse25 (= ~E_2~0 ~M_E~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= ~local~0 ~token~0)) (.cse26 (= ~M_E~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (or (= |exists_runnable_thread2_#res| 1) (not .cse29))) (.cse3 (= 2 ~t2_st~0)) (.cse21 (<= ~token~0 .cse31)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse22 (<= .cse31 ~token~0)) (.cse11 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse12 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse24 (= ~T1_E~0 2)) (.cse13 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16) (and .cse0 .cse12 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse18 .cse19 .cse20) (and .cse0 .cse12 .cse2 .cse21 .cse4 .cse5 .cse22 .cse7 .cse8 .cse9 .cse14 .cse11 .cse15 .cse20 .cse23) (and .cse0 .cse12 .cse2 .cse24 .cse4 .cse5 .cse8 .cse9 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse27 .cse2 .cse28 .cse24 .cse5 .cse29 .cse8 .cse9 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse30 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse31 ~token~0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse30 .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse32) (and .cse0 .cse12 .cse2 .cse21 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse15 .cse20 .cse32) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse2 .cse33 .cse24 .cse3 .cse30 .cse5 .cse29 .cse6 .cse8 .cse9 .cse10 .cse25 .cse11 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse0 .cse12 .cse2 .cse5 .cse29 .cse7 .cse8 .cse9 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse23) (and .cse12 .cse27 .cse2 .cse24 .cse3 .cse5 .cse29 .cse6 .cse8 .cse9 .cse25 .cse11 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse0 .cse2 .cse3 .cse5 .cse34 .cse29 .cse6 .cse7 (not .cse30) .cse8 .cse9 .cse11 .cse18 .cse19 .cse20 .cse32) (and .cse0 .cse2 .cse24 .cse30 .cse4 .cse5 .cse8 .cse9 .cse10 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26 .cse23) (and .cse2 .cse33 .cse24 .cse5 .cse34 .cse29 .cse8 .cse9 .cse10 .cse25 .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 .cse26) (and .cse1 .cse12 .cse2 .cse24 .cse13 .cse5 .cse29 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse0 .cse12 .cse17 .cse2 .cse3 .cse21 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse11 .cse20) (and .cse1 .cse12 .cse2 .cse24 .cse13 .cse5 .cse29 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16)))) [2021-11-23 03:47:36,482 INFO L858 garLoopResultBuilder]: For program point L865(lines 865 869) no Hoare annotation was computed. [2021-11-23 03:47:36,482 INFO L858 garLoopResultBuilder]: For program point L865-1(lines 860 912) no Hoare annotation was computed. [2021-11-23 03:47:36,482 INFO L854 garLoopResultBuilder]: At program point L172-1(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,482 INFO L858 garLoopResultBuilder]: For program point L1164(lines 1164 1168) no Hoare annotation was computed. [2021-11-23 03:47:36,482 INFO L854 garLoopResultBuilder]: At program point L537(lines 484 542) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2021-11-23 03:47:36,482 INFO L854 garLoopResultBuilder]: At program point L471(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,483 INFO L854 garLoopResultBuilder]: At program point L471-1(line 471) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,483 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 215) no Hoare annotation was computed. [2021-11-23 03:47:36,483 INFO L854 garLoopResultBuilder]: At program point L1132-1(lines 1129 1169) the Hoare annotation is: (let ((.cse24 (= ~t1_st~0 0))) (let ((.cse21 (= ~m_st~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= ~local~0 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse17 (or (= |exists_runnable_thread2_#res| 1) (not .cse24))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse22 (+ ~local~0 1)) (.cse11 (= ~E_M~0 2)) (.cse20 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse12 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse23 (= ~T1_E~0 2)) (.cse13 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16) (and .cse0 .cse12 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 .cse21 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse22 ~token~0) .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse2 (= ~m_pc~0 ~t1_pc~0) .cse23 .cse21 .cse5 .cse24 .cse8 .cse9 .cse10 (= ~E_2~0 ~M_E~0) .cse14 .cse11 .cse15 .cse18 .cse19 .cse20 (= ~M_E~0 2)) (and .cse1 .cse12 .cse2 .cse23 .cse13 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse16) (and .cse0 .cse12 .cse17 .cse2 .cse3 (<= ~token~0 .cse22) .cse4 .cse5 .cse6 (<= .cse22 ~token~0) .cse7 .cse8 .cse9 .cse11 .cse20) (and .cse1 .cse12 .cse2 .cse23 .cse13 .cse5 .cse24 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16)))) [2021-11-23 03:47:36,483 INFO L858 garLoopResultBuilder]: For program point L901(lines 901 908) no Hoare annotation was computed. [2021-11-23 03:47:36,483 INFO L858 garLoopResultBuilder]: For program point L242(lines 242 254) no Hoare annotation was computed. [2021-11-23 03:47:36,483 INFO L858 garLoopResultBuilder]: For program point L870(lines 860 912) no Hoare annotation was computed. [2021-11-23 03:47:36,484 INFO L854 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,484 INFO L858 garLoopResultBuilder]: For program point L507-1(line 507) no Hoare annotation was computed. [2021-11-23 03:47:36,484 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 249) no Hoare annotation was computed. [2021-11-23 03:47:36,484 INFO L854 garLoopResultBuilder]: At program point L210(lines 210 214) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 ~p_dw_pc~0) (not (= 2 ~p_dw_pc~0))))) [2021-11-23 03:47:36,484 INFO L858 garLoopResultBuilder]: For program point L673(lines 673 681) no Hoare annotation was computed. [2021-11-23 03:47:36,484 INFO L854 garLoopResultBuilder]: At program point L443(lines 418 458) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,485 INFO L854 garLoopResultBuilder]: At program point L179(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,485 INFO L861 garLoopResultBuilder]: At program point L1170(lines 1117 1175) the Hoare annotation is: true [2021-11-23 03:47:36,485 INFO L854 garLoopResultBuilder]: At program point L1104(line 1104) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse18 (+ ~local~0 1)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse18 ~token~0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 (<= ~token~0 .cse18) .cse4 .cse5 .cse6 (<= .cse18 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15)))) [2021-11-23 03:47:36,485 INFO L854 garLoopResultBuilder]: At program point L1104-1(line 1104) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse18 (+ ~local~0 1)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse18 ~token~0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 (<= ~token~0 .cse18) .cse4 .cse5 .cse6 (<= .cse18 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15)))) [2021-11-23 03:47:36,486 INFO L858 garLoopResultBuilder]: For program point L873(lines 873 880) no Hoare annotation was computed. [2021-11-23 03:47:36,486 INFO L858 garLoopResultBuilder]: For program point L709(lines 709 717) no Hoare annotation was computed. [2021-11-23 03:47:36,486 INFO L854 garLoopResultBuilder]: At program point L676(lines 676 680) the Hoare annotation is: (let ((.cse15 (= |exists_runnable_thread2_#res| 1))) (let ((.cse9 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse1 (<= 2 ~E_1~0)) (.cse12 (= ~T1_E~0 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse11 (not (= ~E_M~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~m_st~0 2)) (.cse13 (or .cse15 (not (= ~t1_st~0 0)))) (.cse3 (= ~t1_i~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (= ~t2_pc~0 1)) (.cse6 (= ~E_2~0 2)) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse16 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2)) (.cse20 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 (or .cse15 (not .cse10)) .cse16 .cse17 .cse18 .cse19 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse3 .cse5 .cse14 .cse6 .cse7 .cse8 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2021-11-23 03:47:36,486 INFO L854 garLoopResultBuilder]: At program point L511(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,486 INFO L854 garLoopResultBuilder]: At program point L511-1(line 511) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,486 INFO L854 garLoopResultBuilder]: At program point L247(line 247) the Hoare annotation is: false [2021-11-23 03:47:36,487 INFO L854 garLoopResultBuilder]: At program point L512(line 512) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,487 INFO L854 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse17 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= 2 ~t1_st~0)) (.cse16 (+ ~local~0 1)) (.cse11 (= ~E_M~0 2)) (.cse18 (= ~E_1~0 2)) (.cse7 (= ~t2_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse16 ~token~0) .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse13 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse13 .cse17 .cse2 .cse3 (<= ~token~0 .cse16) .cse5 .cse6 .cse7 (<= .cse16 ~token~0) .cse8 .cse9 .cse10 .cse11 .cse18) (and .cse1 .cse13 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse1 .cse13 .cse2 .cse19 .cse4 .cse6 .cse20 .cse8 .cse9 .cse10 .cse14 .cse15 .cse12)))) [2021-11-23 03:47:36,487 INFO L858 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2021-11-23 03:47:36,487 INFO L854 garLoopResultBuilder]: At program point L513(line 513) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,487 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 454) no Hoare annotation was computed. [2021-11-23 03:47:36,488 INFO L854 garLoopResultBuilder]: At program point L712(lines 712 716) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse4 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (let ((.cse11 (+ ~local~0 1))) (and .cse0 .cse2 .cse3 (<= ~token~0 .cse11) (= 2 ~t1_st~0) .cse5 .cse6 (<= .cse11 ~token~0) .cse7 .cse8 .cse9 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) (= ~E_M~0 2) (= ~E_1~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (and .cse1 .cse2 .cse3 (= ~T1_E~0 2) .cse4 .cse5 (= ~t1_st~0 0) .cse6 .cse7 .cse8 .cse9 .cse10))) [2021-11-23 03:47:36,488 INFO L854 garLoopResultBuilder]: At program point L646(line 646) the Hoare annotation is: (let ((.cse11 (= 0 ~t2_pc~0)) (.cse13 (= 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (= 2 ~t1_st~0)) (.cse1 (= ~t1_i~0 1)) (.cse18 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse20 (= 2 ~t2_st~0)) (.cse3 (= ~E_1~0 1)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse19 (= ~t1_st~0 0)) (.cse21 (= ~t2_pc~0 1)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~t2_i~0 1)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~m_pc~0 0)) (.cse10 (= ~E_2~0 ~M_E~0)) (.cse12 (= ~E_M~0 2)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse16 (= ~M_E~0 2)) (.cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse18 .cse2 .cse3 .cse5 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse20 .cse3 .cse4 .cse5 .cse21 (= ~E_2~0 2) .cse6 .cse7 .cse8 .cse12 .cse14 .cse15 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse1 .cse18 .cse2 .cse20 .cse3 .cse5 .cse19 .cse21 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17))) [2021-11-23 03:47:36,488 INFO L858 garLoopResultBuilder]: For program point L646-1(line 646) no Hoare annotation was computed. [2021-11-23 03:47:36,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 03:47:36,488 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2021-11-23 03:47:36,489 INFO L854 garLoopResultBuilder]: At program point L252(line 252) the Hoare annotation is: false [2021-11-23 03:47:36,489 INFO L854 garLoopResultBuilder]: At program point L252-1(lines 206 260) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2021-11-23 03:47:36,489 INFO L854 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse17 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= 2 ~t1_st~0)) (.cse16 (+ ~local~0 1)) (.cse11 (= ~E_M~0 2)) (.cse18 (= ~E_1~0 2)) (.cse7 (= ~t2_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse16 ~token~0) .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse13 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse13 .cse17 .cse2 .cse3 (<= ~token~0 .cse16) .cse5 .cse6 .cse7 (<= .cse16 ~token~0) .cse8 .cse9 .cse10 .cse11 .cse18) (and .cse1 .cse13 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse1 .cse13 .cse2 .cse19 .cse4 .cse6 .cse20 .cse8 .cse9 .cse10 .cse14 .cse15 .cse12)))) [2021-11-23 03:47:36,489 INFO L854 garLoopResultBuilder]: At program point L1144-1(line 1144) the Hoare annotation is: (let ((.cse10 (= 0 ~t2_pc~0)) (.cse11 (= 0 ~t2_st~0)) (.cse17 (= ~T1_E~0 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse18 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse12 (= 2 ~t2_st~0)) (.cse13 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~t2_pc~0 1)) (.cse16 (+ ~local~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse14 (= ~E_M~0 2)) (.cse15 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse15) (and .cse0 .cse1 .cse3 (<= ~token~0 (+ 2 ~local~0)) .cse12 (= ~m_st~0 0) .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse16 ~token~0) .cse14) (and .cse0 .cse1 .cse3 .cse12 .cse4 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse14) (and .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse2 .cse3 .cse17 .cse4 .cse5 .cse18 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse12 (<= ~token~0 .cse16) .cse13 .cse5 .cse6 (<= .cse16 ~token~0) .cse7 .cse8 .cse9 .cse14 .cse15))) [2021-11-23 03:47:36,490 INFO L854 garLoopResultBuilder]: At program point L913(lines 854 918) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse17 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= 2 ~t1_st~0)) (.cse16 (+ ~local~0 1)) (.cse11 (= ~E_M~0 2)) (.cse18 (= ~E_1~0 2)) (.cse7 (= ~t2_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse4 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse14 (= 0 ~t2_pc~0)) (.cse15 (= 0 ~t2_st~0)) (.cse12 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~m_pc~0 0) .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse8 .cse9 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< .cse16 ~token~0) .cse11) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse0 .cse1 .cse13 .cse17 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18) (and .cse0 .cse1 .cse13 .cse17 .cse2 .cse3 (<= ~token~0 .cse16) .cse5 .cse6 .cse7 (<= .cse16 ~token~0) .cse8 .cse9 .cse10 .cse11 .cse18) (and .cse1 .cse13 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse12) (and .cse1 .cse13 .cse2 .cse19 .cse4 .cse6 .cse20 .cse8 .cse9 .cse10 .cse14 .cse15 .cse12)))) [2021-11-23 03:47:36,490 INFO L854 garLoopResultBuilder]: At program point L1145(line 1145) the Hoare annotation is: (let ((.cse17 (= ~t1_st~0 0))) (let ((.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse16 (= ~T1_E~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 2)) (.cse18 (or (= |exists_runnable_thread2_#res| 1) (not .cse17))) (.cse2 (= ~t1_i~0 1)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse6 (= ~t2_pc~0 1)) (.cse15 (+ ~local~0 1)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~E_M~0 2)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse7 .cse8 .cse9 .cse13 .cse14) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse15 ~token~0) .cse10) (and .cse1 .cse11 .cse2 .cse16 .cse12 .cse5 .cse17 .cse7 .cse8 .cse9 .cse13 .cse14) (and .cse0 .cse1 .cse11 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse19) (and .cse1 .cse11 .cse2 .cse16 .cse12 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse11 .cse18 .cse2 .cse3 (<= ~token~0 .cse15) .cse4 .cse5 .cse6 (<= .cse15 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse19)))) [2021-11-23 03:47:36,490 INFO L854 garLoopResultBuilder]: At program point L518(lines 518 527) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,490 INFO L858 garLoopResultBuilder]: For program point L518-2(lines 518 527) no Hoare annotation was computed. [2021-11-23 03:47:36,490 INFO L854 garLoopResultBuilder]: At program point L419(line 419) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,491 INFO L854 garLoopResultBuilder]: At program point L1146(line 1146) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse18 (+ ~local~0 1)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse18 ~token~0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 (<= ~token~0 .cse18) .cse4 .cse5 .cse6 (<= .cse18 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15)))) [2021-11-23 03:47:36,491 INFO L854 garLoopResultBuilder]: At program point L684-1(lines 672 703) the Hoare annotation is: (let ((.cse27 (+ ~local~0 1))) (let ((.cse23 (not (= ~E_M~0 1))) (.cse14 (= ~t1_pc~0 0)) (.cse15 (= ~T1_E~0 2)) (.cse26 (= 2 ~t2_st~0)) (.cse24 (= ~m_st~0 0)) (.cse22 (not (= ~m_pc~0 1))) (.cse6 (= ~t2_pc~0 1)) (.cse25 (= ~m_pc~0 0)) (.cse16 (= ~E_2~0 ~M_E~0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= ~local~0 ~token~0)) (.cse20 (= ~M_E~0 2)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse2 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse3 (= ~t1_i~0 1)) (.cse4 (<= ~token~0 .cse27)) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= .cse27 ~token~0)) (.cse8 (= ~E_2~0 2)) (.cse9 (= ~t2_i~0 1)) (.cse10 (= ~c_dr_pc~0 0)) (.cse17 (= 0 ~t2_pc~0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= 0 ~t2_st~0)) (.cse13 (= ~E_1~0 2)) (.cse21 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse2 .cse14 .cse3 (= ~m_st~0 ~E_M~0) .cse15 .cse5 .cse9 .cse10 .cse16 .cse17 .cse11 .cse12 .cse18 .cse19 .cse13 .cse20 .cse21) (and .cse0 .cse1 .cse3 .cse22 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23) (and .cse0 .cse1 .cse3 .cse22 .cse5 .cse8 .cse9 .cse10 .cse17 .cse12 .cse23) (and .cse0 .cse2 .cse14 .cse3 .cse15 .cse24 .cse22 .cse5 .cse9 .cse10 .cse25 .cse16 .cse17 .cse11 .cse12 .cse18 .cse19 .cse13 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse14 .cse3 .cse15 .cse26 .cse5 .cse6 .cse9 .cse10 .cse16 .cse11 .cse18 .cse19 .cse13 .cse20 .cse21) (and .cse0 .cse2 .cse14 .cse3 .cse15 .cse26 .cse24 .cse22 .cse5 .cse6 .cse9 .cse10 .cse25 .cse16 .cse11 .cse18 .cse19 .cse13 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse21)))) [2021-11-23 03:47:36,491 INFO L858 garLoopResultBuilder]: For program point L421(line 421) no Hoare annotation was computed. [2021-11-23 03:47:36,491 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 03:47:36,492 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 169) no Hoare annotation was computed. [2021-11-23 03:47:36,492 INFO L858 garLoopResultBuilder]: For program point L884(lines 860 912) no Hoare annotation was computed. [2021-11-23 03:47:36,492 INFO L858 garLoopResultBuilder]: For program point L1149(line 1149) no Hoare annotation was computed. [2021-11-23 03:47:36,492 INFO L854 garLoopResultBuilder]: At program point L720-1(lines 708 739) the Hoare annotation is: (let ((.cse12 (= ~m_st~0 0)) (.cse28 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse2 (not .cse28)) (.cse5 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_M~0 1))) (.cse26 (not .cse12)) (.cse3 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= 2 ~t1_st~0)) (.cse7 (= ~E_2~0 2)) (.cse25 (+ ~local~0 1)) (.cse27 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse4 (= ~t1_i~0 1)) (.cse11 (= ~T1_E~0 2)) (.cse14 (not (= 2 ~t2_st~0))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse24 (= ~t1_st~0 0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse16 (= ~E_2~0 ~M_E~0)) (.cse17 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse18 (= ~E_M~0 2)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= ~E_1~0 2)) (.cse22 (= ~M_E~0 2)) (.cse23 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse11 .cse12 .cse5 .cse13 .cse14 .cse6 .cse8 .cse9 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse1 .cse3 .cse4 .cse11 .cse5 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse4 (= ~m_st~0 ~E_M~0) (<= ~token~0 .cse25) .cse13 .cse6 (<= .cse25 ~token~0) .cse7 .cse26 .cse8 .cse9 .cse17 .cse18 .cse21 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse13 .cse14 .cse6 .cse26 .cse8 .cse9 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse3 (= ~t1_pc~0 0) .cse4 .cse11 .cse14 .cse6 .cse24 .cse8 .cse9 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse3 .cse4 .cse6 .cse24 .cse7 .cse8 .cse9 .cse17 .cse18 .cse19 .cse20 .cse21 .cse27) (and .cse0 .cse1 .cse4 (<= ~token~0 (+ 2 ~local~0)) .cse12 .cse13 .cse6 .cse7 .cse8 .cse9 (< .cse25 ~token~0) .cse17 .cse18 .cse27) (and .cse4 .cse28 .cse11 .cse12 .cse14 .cse6 .cse24 .cse8 .cse9 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2021-11-23 03:47:36,492 INFO L854 garLoopResultBuilder]: At program point L654-1(lines 628 667) the Hoare annotation is: (let ((.cse10 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~T1_E~0 2)) (.cse4 (= ~t1_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_2~0 ~M_E~0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2)) (.cse16 (= ~M_E~0 2)) (.cse17 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse18 (= ~t1_pc~0 1)) (.cse19 (<= 2 ~E_1~0)) (.cse0 (= ~t1_i~0 1)) (.cse20 (= 2 ~t2_st~0)) (.cse21 (= 2 ~t1_st~0)) (.cse3 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse22 (= ~t2_pc~0 1)) (.cse23 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~t2_i~0 1)) (.cse7 (= ~c_dr_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse24 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 .cse20 (not (= ~m_pc~0 1)) .cse21 .cse3 .cse22 .cse23 .cse5 .cse6 .cse7 .cse11 .cse24) (and .cse18 .cse0 .cse2 .cse21 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse19 .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse20 .cse21 .cse3 .cse22 .cse23 .cse5 .cse6 .cse7 (< (+ ~local~0 1) ~token~0) .cse11 .cse24))) [2021-11-23 03:47:36,493 INFO L854 garLoopResultBuilder]: At program point L522(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,493 INFO L854 garLoopResultBuilder]: At program point L522-1(line 522) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,493 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-11-23 03:47:36,493 INFO L858 garLoopResultBuilder]: For program point L423-1(lines 418 458) no Hoare annotation was computed. [2021-11-23 03:47:36,493 INFO L858 garLoopResultBuilder]: For program point L160(lines 160 168) no Hoare annotation was computed. [2021-11-23 03:47:36,494 INFO L854 garLoopResultBuilder]: At program point L1151(lines 1151 1160) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse18 (+ ~local~0 1)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse18 ~token~0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 (<= ~token~0 .cse18) .cse4 .cse5 .cse6 (<= .cse18 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15)))) [2021-11-23 03:47:36,494 INFO L858 garLoopResultBuilder]: For program point L1151-2(lines 1151 1160) no Hoare annotation was computed. [2021-11-23 03:47:36,494 INFO L858 garLoopResultBuilder]: For program point L887(lines 887 894) no Hoare annotation was computed. [2021-11-23 03:47:36,494 INFO L854 garLoopResultBuilder]: At program point L161(lines 156 200) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1))) (.cse2 (= ~p_dw_pc~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0)) (and .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2))) [2021-11-23 03:47:36,494 INFO L854 garLoopResultBuilder]: At program point L492(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2021-11-23 03:47:36,494 INFO L854 garLoopResultBuilder]: At program point L492-1(line 492) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2021-11-23 03:47:36,495 INFO L854 garLoopResultBuilder]: At program point L459(lines 412 464) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,495 INFO L854 garLoopResultBuilder]: At program point L196(lines 153 201) the Hoare annotation is: (let ((.cse0 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (not (= ~m_pc~0 1)))) (or (and .cse0 .cse1 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 (= ~c_dr_pc~0 0)))) [2021-11-23 03:47:36,495 INFO L858 garLoopResultBuilder]: For program point L163(lines 163 167) no Hoare annotation was computed. [2021-11-23 03:47:36,495 INFO L854 garLoopResultBuilder]: At program point L494(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2021-11-23 03:47:36,495 INFO L854 garLoopResultBuilder]: At program point L494-1(line 494) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2021-11-23 03:47:36,495 INFO L858 garLoopResultBuilder]: For program point L428(lines 418 458) no Hoare annotation was computed. [2021-11-23 03:47:36,496 INFO L858 garLoopResultBuilder]: For program point L1188(lines 1188 1194) no Hoare annotation was computed. [2021-11-23 03:47:36,496 INFO L854 garLoopResultBuilder]: At program point L1155(line 1155) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse18 (+ ~local~0 1)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse18 ~token~0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 (<= ~token~0 .cse18) .cse4 .cse5 .cse6 (<= .cse18 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15)))) [2021-11-23 03:47:36,496 INFO L854 garLoopResultBuilder]: At program point L1155-1(line 1155) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse16 (or (= |exists_runnable_thread2_#res| 1) (not .cse20))) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse18 (+ ~local~0 1)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~E_1~0 2)) (.cse1 (<= 2 ~E_1~0)) (.cse11 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse19 (= ~T1_E~0 2)) (.cse12 (not (= ~m_pc~0 1))) (.cse5 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse13 (= 0 ~t2_pc~0)) (.cse14 (= 0 ~t2_st~0)) (.cse15 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~m_pc~0 0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17) (and .cse0 .cse1 .cse2 (<= ~token~0 (+ 2 ~local~0)) .cse3 (= ~m_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< .cse18 ~token~0) .cse10) (and .cse0 .cse1 .cse11 .cse2 .cse12 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse15) (and .cse0 .cse11 .cse16 .cse2 .cse3 (<= ~token~0 .cse18) .cse4 .cse5 .cse6 (<= .cse18 ~token~0) .cse7 .cse8 .cse9 .cse10 .cse17) (and .cse1 .cse11 .cse2 .cse19 .cse12 .cse5 .cse20 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15)))) [2021-11-23 03:47:36,496 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 599) no Hoare annotation was computed. [2021-11-23 03:47:36,497 INFO L854 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~c_dr_pc~0 0)) [2021-11-23 03:47:36,497 INFO L854 garLoopResultBuilder]: At program point L694(line 694) the Hoare annotation is: (let ((.cse20 (+ ~local~0 1)) (.cse19 (= |exists_runnable_thread2_#res| 1))) (let ((.cse2 (or .cse19 (not (= ~t1_st~0 0)))) (.cse5 (<= ~token~0 .cse20)) (.cse17 (= ~t2_pc~0 1)) (.cse7 (<= .cse20 ~token~0)) (.cse11 (= ~E_M~0 2)) (.cse13 (= ~E_1~0 2)) (.cse14 (= |ULTIMATE.start_eval2_~tmp~5#1| 1)) (.cse0 (= ~t1_pc~0 1)) (.cse15 (<= 2 ~E_1~0)) (.cse1 (= ~m_st~0 2)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~E_2~0 1)) (.cse16 (not (= ~m_pc~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= 0 ~t2_pc~0)) (.cse12 (= 0 ~t2_st~0)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse15 .cse1 .cse3 .cse4 .cse16 .cse6 .cse17 .cse8 .cse9 .cse18) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse9 (or .cse19 (not .cse12)) .cse11 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14)) .cse8) (and .cse0 .cse15 .cse1 .cse3 .cse4 .cse16 .cse6 .cse8 .cse9 .cse10 .cse12 .cse18)))) [2021-11-23 03:47:36,497 INFO L858 garLoopResultBuilder]: For program point L694-1(line 694) no Hoare annotation was computed. [2021-11-23 03:47:36,497 INFO L854 garLoopResultBuilder]: At program point L1190(lines 1190 1193) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2021-11-23 03:47:36,498 INFO L854 garLoopResultBuilder]: At program point L662(lines 625 668) the Hoare annotation is: (let ((.cse14 (not (= ~m_pc~0 ~t1_pc~0))) (.cse15 (= ~t1_pc~0 0)) (.cse16 (= ~m_st~0 ~E_M~0)) (.cse17 (= ~T1_E~0 2)) (.cse3 (= 2 ~t2_st~0)) (.cse6 (= ~t2_pc~0 1)) (.cse18 (= ~E_2~0 ~M_E~0)) (.cse21 (= ~M_E~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~m_st~0 2)) (.cse2 (= ~t1_i~0 1)) (.cse4 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse5 (= ~t1_st~0 0)) (.cse7 (= ~E_2~0 2)) (.cse8 (= ~t2_i~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse19 (= 0 ~t2_pc~0)) (.cse10 (= ~E_M~0 2)) (.cse20 (= 0 ~t2_st~0)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse22 (= |ULTIMATE.start_eval2_~tmp~5#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (and .cse14 .cse15 .cse2 .cse16 .cse17 .cse4 .cse5 .cse8 .cse9 .cse18 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse21 .cse22) (and .cse14 .cse15 .cse2 .cse16 .cse17 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse19 .cse10 .cse20 .cse11 .cse12 .cse13 .cse22))) [2021-11-23 03:47:36,498 INFO L858 garLoopResultBuilder]: For program point L629(lines 629 637) no Hoare annotation was computed. [2021-11-23 03:47:36,498 INFO L854 garLoopResultBuilder]: At program point L1125(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2021-11-23 03:47:36,498 INFO L854 garLoopResultBuilder]: At program point L1125-1(line 1125) the Hoare annotation is: (and (= ~t1_i~0 1) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~t1_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~E_2~0 ~M_E~0) (= 0 ~t2_pc~0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ~M_E~0 2)) [2021-11-23 03:47:36,498 INFO L861 garLoopResultBuilder]: At program point L95(lines 73 97) the Hoare annotation is: true [2021-11-23 03:47:36,499 INFO L858 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2021-11-23 03:47:36,499 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 84 93) no Hoare annotation was computed. [2021-11-23 03:47:36,499 INFO L858 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 70 98) no Hoare annotation was computed. [2021-11-23 03:47:36,499 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 80) no Hoare annotation was computed. [2021-11-23 03:47:36,499 INFO L858 garLoopResultBuilder]: For program point L74(lines 74 83) no Hoare annotation was computed. [2021-11-23 03:47:36,499 INFO L858 garLoopResultBuilder]: For program point L74-2(lines 73 97) no Hoare annotation was computed. [2021-11-23 03:47:36,499 INFO L861 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 70 98) the Hoare annotation is: true [2021-11-23 03:47:36,500 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 295 314) the Hoare annotation is: true [2021-11-23 03:47:36,500 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 295 314) no Hoare annotation was computed. [2021-11-23 03:47:36,500 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-11-23 03:47:36,500 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-11-23 03:47:36,500 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-11-23 03:47:36,500 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 829 853) the Hoare annotation is: true [2021-11-23 03:47:36,500 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 829 853) no Hoare annotation was computed. [2021-11-23 03:47:36,501 INFO L861 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 333 350) the Hoare annotation is: true [2021-11-23 03:47:36,501 INFO L858 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 333 350) no Hoare annotation was computed. [2021-11-23 03:47:36,501 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 957 994) the Hoare annotation is: (let ((.cse19 (= ~t1_pc~0 1)) (.cse40 (= ~m_st~0 2)) (.cse22 (= ~t1_i~0 1)) (.cse23 (= |old(~T1_E~0)| ~T1_E~0)) (.cse41 (= 2 ~t2_st~0)) (.cse24 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~t2_pc~0 1)) (.cse26 (= ~E_2~0 2)) (.cse27 (= ~c_dr_pc~0 0)) (.cse29 (= ~E_M~0 2)) (.cse39 (= ~E_1~0 2)) (.cse20 (<= 2 ~E_1~0)) (.cse21 (= ~M_E~0 |old(~M_E~0)|)) (.cse38 (= ~T1_E~0 2)) (.cse30 (= ~E_2~0 |old(~E_2~0)|))) (let ((.cse11 (+ ~local~0 1)) (.cse15 (and .cse20 .cse21 .cse38 .cse30)) (.cse14 (and .cse19 .cse20 .cse21 .cse40 .cse22 .cse23 .cse41 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse39)) (.cse4 (not .cse41)) (.cse8 (not (= 2 ~t1_st~0))) (.cse28 (= ~E_1~0 |old(~E_1~0)|)) (.cse34 (not (<= ~token~0 ~local~0))) (.cse16 (not (= |old(~T1_E~0)| 2))) (.cse3 (not (= 2 |old(~E_1~0)|))) (.cse36 (not (= ~m_pc~0 0))) (.cse5 (not (= 2 |old(~E_M~0)|))) (.cse35 (not (<= ~local~0 ~token~0))) (.cse32 (not (= 0 ~t2_st~0))) (.cse33 (not (= 0 ~t2_pc~0))) (.cse31 (not (= ~m_st~0 0))) (.cse18 (not (= ~t1_st~0 0))) (.cse37 (and .cse20 .cse21 .cse23 .cse30)) (.cse0 (not (= 2 |old(~E_2~0)|))) (.cse1 (not (= ~t2_i~0 1))) (.cse2 (not .cse19)) (.cse6 (not .cse22)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse17 (= ~m_pc~0 1)) (.cse10 (not .cse40)) (.cse12 (not .cse24)) (.cse13 (not .cse25))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (<= .cse11 ~token~0)) .cse12 .cse13 .cse14 (not (<= ~token~0 .cse11))) (or .cse15 .cse0 .cse1 .cse16 .cse6 .cse7 .cse9 .cse17 .cse10 .cse12 .cse18 .cse13) (or (not (< .cse11 ~token~0)) .cse0 .cse1 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse31 .cse13 (not (<= ~token~0 (+ 2 ~local~0)))) (or .cse15 .cse0 .cse1 .cse16 .cse6 .cse7 .cse9 .cse17 .cse10 .cse32 .cse12 .cse33 .cse18) (or .cse0 .cse1 .cse34 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse35 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse36 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse21 .cse23 .cse28 .cse29 .cse30) .cse12 .cse13) (or .cse37 .cse0 .cse1 .cse2 .cse6 .cse7 .cse9 .cse17 .cse10 .cse32 .cse12 .cse33) (or (and .cse38 .cse29 .cse30 .cse39 (= ~M_E~0 2)) .cse1 (not (= |old(~E_2~0)| |old(~M_E~0)|)) .cse34 .cse16 .cse3 .cse36 .cse5 .cse6 .cse7 (not (= ~t1_pc~0 0)) .cse35 .cse32 .cse12 .cse33 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse31) .cse18 (not (= 2 |old(~M_E~0)|))) (or .cse37 .cse0 .cse1 .cse2 .cse6 .cse7 .cse9 .cse17 .cse10 .cse12 .cse13)))) [2021-11-23 03:47:36,501 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 957 994) no Hoare annotation was computed. [2021-11-23 03:47:36,505 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2021-11-23 03:47:36,507 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 03:47:36,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:47:36 BoogieIcfgContainer [2021-11-23 03:47:36,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 03:47:36,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 03:47:36,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 03:47:36,610 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 03:47:36,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:40:11" (3/4) ... [2021-11-23 03:47:36,614 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 03:47:36,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-23 03:47:36,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2021-11-23 03:47:36,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-23 03:47:36,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2021-11-23 03:47:36,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-23 03:47:36,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-23 03:47:36,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2021-11-23 03:47:36,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2021-11-23 03:47:36,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2021-11-23 03:47:36,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-23 03:47:36,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-23 03:47:36,621 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-23 03:47:36,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2021-11-23 03:47:36,622 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-23 03:47:36,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 93 nodes and edges [2021-11-23 03:47:36,639 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-23 03:47:36,641 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-23 03:47:36,643 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 03:47:36,673 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) [2021-11-23 03:47:36,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) [2021-11-23 03:47:36,674 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && c_dr_pc == 0)) || !(E_M == 2)) || !(token <= local)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(E_2 == M_E)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && ((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((((((!(t2_i == 1) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 <= E_1))) && ((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && c_dr_pc == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || (((1 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && c_dr_pc == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local)) [2021-11-23 03:47:36,675 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) [2021-11-23 03:47:36,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) [2021-11-23 03:47:36,676 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(E_M == 1)) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) [2021-11-23 03:47:36,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || ((((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && T1_E == 2) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && T1_E == 2) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && T1_E == 2) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && t1_i == 1) && T1_E == 2) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) [2021-11-23 03:47:36,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((2 <= E_1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0)) || (((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && T1_E == 2) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && T1_E == 2) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((((2 <= E_1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && T1_E == 2) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((2 <= E_1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1) [2021-11-23 03:47:36,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) [2021-11-23 03:47:36,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) && (((((((((((((((((!(t2_i == 1) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((!(t2_i == 1) || ((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(\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))) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(\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))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(E_2 == M_E))) && ((((((((((((((!(local + 1 < token) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((!(t2_i == 1) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || ((((((!(m_pc == t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(t2_pc == 1)) || ((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(t2_i == 1) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(E_M == 2)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0))) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || ((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(E_2 == M_E)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) [2021-11-23 03:47:36,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && T1_E == 2) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || ((((((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && T1_E == 2) && 2 == t1_st) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && T1_E == 2) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1) [2021-11-23 03:47:36,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) [2021-11-23 03:47:36,682 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || t1_st == 0) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(E_2 == M_E)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0))) && (((((((((((((((((!(t2_i == 1) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(E_2 == M_E)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && ((((((((((((((!(E_2 == 2) || !(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)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(\old(t2_st) == 0)) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || t1_st == 0) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(token <= local)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(E_2 == M_E)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || (((((((!(m_pc == t1_pc) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) [2021-11-23 03:47:36,746 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 03:47:36,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 03:47:36,747 INFO L158 Benchmark]: Toolchain (without parser) took 447488.42ms. Allocated memory was 109.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 73.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 623.2MB. Max. memory is 16.1GB. [2021-11-23 03:47:36,747 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 73.4MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 03:47:36,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.28ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 79.8MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 03:47:36,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.61ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 76.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 03:47:36,748 INFO L158 Benchmark]: Boogie Preprocessor took 52.26ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 03:47:36,749 INFO L158 Benchmark]: RCFGBuilder took 1303.33ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 73.5MB in the end (delta: 475.8kB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2021-11-23 03:47:36,749 INFO L158 Benchmark]: TraceAbstraction took 445324.71ms. Allocated memory was 109.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 73.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2021-11-23 03:47:36,749 INFO L158 Benchmark]: Witness Printer took 136.41ms. Allocated memory is still 2.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-23 03:47:36,751 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.34ms. Allocated memory is still 73.4MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 28.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.28ms. Allocated memory is still 109.1MB. Free memory was 73.5MB in the beginning and 79.8MB in the end (delta: -6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.61ms. Allocated memory is still 109.1MB. Free memory was 79.8MB in the beginning and 76.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.26ms. Allocated memory is still 109.1MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1303.33ms. Allocated memory is still 109.1MB. Free memory was 74.0MB in the beginning and 73.5MB in the end (delta: 475.8kB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * TraceAbstraction took 445324.71ms. Allocated memory was 109.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 73.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 136.41ms. Allocated memory is still 2.1GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. 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: 599]: 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 15 procedures, 157 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 445.1s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 178.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10627 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10524 mSDsluCounter, 13585 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10988 mSDsCounter, 4928 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13278 IncrementalHoareTripleChecker+Invalid, 18206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4928 mSolverCounterUnsat, 4396 mSDtfsCounter, 13278 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3367 GetRequests, 2625 SyntacticMatches, 58 SemanticMatches, 684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39818 ImplicationChecksByTransitivity, 145.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9564occurred in iteration=19, InterpolantAutomatonStates: 436, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 27 MinimizatonAttempts, 12282 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 12873 PreInvPairs, 14694 NumberOfFragments, 18178 HoareAnnotationTreeSize, 12873 FomulaSimplifications, 735336 FormulaSimplificationTreeSizeReduction, 112.7s HoareSimplificationTime, 81 FomulaSimplificationsInter, 2184622 FormulaSimplificationTreeSizeReductionInter, 64.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 4390 NumberOfCodeBlocks, 4306 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 4780 ConstructedInterpolants, 0 QuantifiedInterpolants, 9170 SizeOfPredicates, 34 NumberOfNonLiveVariables, 8389 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 47 InterpolantComputations, 23 PerfectInterpolantSequences, 3135/3421 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: 1190]: Loop Invariant Derived loop invariant: (((((((((((((m_pc == t1_pc && T1_E == 2) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 471]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 518]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && c_dr_pc == p_dw_pc) && t1_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && t1_i == 1) && T1_E == 2) && 2 == t1_st) && c_dr_pc == p_dw_pc) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && !(2 == p_dw_pc)) - InvariantResult [Line: 1104]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0 - InvariantResult [Line: 708]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && T1_E == 2) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && m_st == E_M) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && tmp == 1)) || ((((((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && T1_E == 2) && 2 == t1_st) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && T1_E == 2) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && !(2 == t2_st)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1) && c_dr_pc == 0) || (((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) && p_dw_pc == 1) - InvariantResult [Line: 1129]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) - InvariantResult [Line: 625]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) || (((((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && T1_E == 2) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((((!(m_pc == t1_pc) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && T1_E == 2) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 829]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 522]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 484]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 854]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) && !(E_M == 1)) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1)) || ((((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && T1_E == 2) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((((t1_pc == 0 && t1_i == 1) && m_st == E_M) && T1_E == 2) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && !(tmp == 0))) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && 2 == t2_st) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((((((((m_st == 2 && t1_pc == 0) && t1_i == 1) && T1_E == 2) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((t1_pc == 1 && t1_i == 1) && 2 == t2_st) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((t1_pc == 1 && t1_i == 1) && T1_E == 2) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) - InvariantResult [Line: 782]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) && ((((((((((((((!(local + 1 < token) || (((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || t1_st == 0) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(E_2 == M_E)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0))) && (((((((((((((((((!(t2_i == 1) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || ((((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && __retres1 == 0) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(E_2 == M_E)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0))) && ((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || (((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && ((((((((((((((!(E_2 == 2) || !(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)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(\old(t2_st) == 0)) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || (((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((!(t2_i == 1) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || t1_st == 0) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(token <= local)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(E_2 == M_E)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 1 <= __retres1) && __retres1 == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || (((((((!(m_pc == t1_pc) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 763]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) && (((((((((((((((((!(t2_i == 1) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || (((((((((1 <= __retres1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((!(t2_i == 1) || ((((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(\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))) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((((((1 <= __retres1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0))) && ((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(token <= local)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || (((((((((2 <= E_1 && !(m_pc == t1_pc)) && t1_i == 1) && \old(t1_st) == t1_st) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0)) || !(\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))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && __retres1 == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(E_2 == M_E))) && ((((((((((((((!(local + 1 < token) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && ((((((((((((!(t2_i == 1) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || ((((((!(m_pc == t1_pc) && t1_i == 1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(t2_pc == 1)) || ((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0) && __retres1 == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(t2_i == 1) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && E_2 == 1) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || !(E_M == 2)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1)) || (((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st) && __retres1 == 0))) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || ((((((((2 <= E_1 && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local))) && ((((((((((((((((((((((((t1_pc == 1 && 2 <= E_1) && !(m_pc == t1_pc)) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((!(m_pc == t1_pc) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(E_2 == M_E)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) - InvariantResult [Line: 628]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2) && !(tmp == 0) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 418]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 1117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 1) || ((m_pc == t1_pc && !(m_pc == 1)) && c_dr_pc == 0) - InvariantResult [Line: 712]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) || ((((((((((((((t1_pc == 1 && m_st == 2) && t1_i == 1) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && E_1 == 2) && !(tmp == 0))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1)) - InvariantResult [Line: 744]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && c_dr_pc == 0)) || !(E_M == 2)) || !(token <= local)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || (((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && c_dr_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(E_2 == M_E)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((!(t2_i == 1) || !(E_M == 2)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(token <= local + 1))) && ((((((((((((!(t2_i == 1) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || ((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st)))) && (((((((((((((((((!(t2_i == 1) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(\old(t1_st) == 2)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || ((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st)) || !(c_dr_pc == p_dw_pc)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && ((((((((((!(E_2 == 2) || !(t2_i == 1)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 <= E_1))) && ((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(\old(t2_st) == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || (((((((((t1_i == 1 && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_st)) || !(0 == t2_pc)) || !(2 == \old(m_st))) || !(2 <= E_1))) && (((((((((((((((((!(\old(t1_st) == 0) || !(t2_i == 1)) || !(M_E == 2)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(t1_pc == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(0 == t2_pc)) || !(E_2 == M_E))) && (((((((((((((((!(E_2 == 2) || !(t2_i == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && c_dr_pc == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || (((1 <= __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || (((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0)) || !(t2_pc == 1)) || !(2 <= E_1)) || !(token <= 2 + local)) || !(E_M == 1))) && (((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(t2_i == 1)) || !(t1_i == 1)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || m_pc == 1) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1))) && (((((((((((!(t2_i == 1) || (((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || m_pc == 1) || !(c_dr_pc == p_dw_pc)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 <= E_1)) || E_M == 1)) && ((((((((((((((!(local + 1 < token) || !(E_2 == 2)) || !(t2_i == 1)) || ((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && \old(t2_st) == t2_st) && t2_pc == 1) && E_2 == 2) && c_dr_pc == 0)) || !(E_M == 2)) || !(t1_pc == 1)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(2 <= E_1)) || !(token <= 2 + local)) - InvariantResult [Line: 676]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && tmp == 1)) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && tmp == 1) - InvariantResult [Line: 1125]: Loop Invariant Derived loop invariant: (((((((((((((((t1_i == 1 && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2 - InvariantResult [Line: 1151]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_M == 2) || (((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((t1_pc == 1 && 2 <= E_1) && t1_i == 1) && token <= 2 + local) && 2 == t2_st) && m_st == 0) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && local + 1 < token) && E_M == 2)) || ((((((((((t1_pc == 1 && 2 <= E_1) && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || (((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((((((t1_pc == 1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && T1_E == 2) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t1_st == 0) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1)) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 672]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 <= E_1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && E_M == 2) && 0 == t2_st) && E_1 == 2) && !(tmp == 0)) || (((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && T1_E == 2) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && !(E_M == 1))) || ((((((((((2 <= E_1 && m_st == 2) && t1_i == 1) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && 0 == t2_st) && !(E_M == 1))) || (((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && T1_E == 2) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((((2 <= E_1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && T1_E == 2) && 2 == t2_st) && c_dr_pc == p_dw_pc) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || (((((((((((((((((((2 <= E_1 && (\result == 1 || !(t1_st == 0))) && t1_pc == 0) && t1_i == 1) && T1_E == 2) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && c_dr_pc == p_dw_pc) && t2_pc == 1) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && E_2 == M_E) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && M_E == 2) && tmp == 1)) || ((((((((((((((2 <= E_1 && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && token <= local + 1) && c_dr_pc == p_dw_pc) && local + 1 <= token) && E_2 == 2) && t2_i == 1) && c_dr_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && E_1 == 2) && tmp == 1) RESULT: Ultimate proved your program to be correct! [2021-11-23 03:47:36,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29ec6e07-9560-4b08-89bd-f9105fdb47dd/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE