./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8 --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 6752fd2bdc3c2f1062040263247aacca41c7fdba ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:39:49,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:39:49,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:39:49,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:39:49,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:39:49,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:39:49,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:39:49,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:39:49,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:39:49,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:39:49,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:39:49,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:39:49,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:39:49,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:39:49,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:39:49,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:39:49,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:39:49,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:39:49,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:39:49,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:39:49,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:39:49,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:39:49,848 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:39:49,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:39:49,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:39:49,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:39:49,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:39:49,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:39:49,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:39:49,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:39:49,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:39:49,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:39:49,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:39:49,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:39:49,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:39:49,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:39:49,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:39:49,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:39:49,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:39:49,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:39:49,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:39:49,868 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:39:49,895 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:39:49,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:39:49,896 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:39:49,896 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:39:49,896 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:39:49,897 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:39:49,897 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:39:49,897 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:39:49,897 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:39:49,898 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:39:49,898 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:39:49,898 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:39:49,899 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:39:49,899 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:39:49,899 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:39:49,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:39:49,900 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:39:49,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:39:49,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:39:49,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:39:49,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:39:49,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:39:49,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:39:49,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:39:49,902 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:39:49,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:39:49,903 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:39:49,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:39:49,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:39:49,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:39:49,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:39:49,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:39:49,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:39:49,904 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:39:49,905 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:39:49,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:39:49,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:39:49,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:39:49,906 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:39:49,906 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_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/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_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8 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 -> 6752fd2bdc3c2f1062040263247aacca41c7fdba [2021-10-13 07:39:50,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:39:50,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:39:50,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:39:50,247 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:39:50,248 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:39:50,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-10-13 07:39:50,339 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/data/bdcaded75/9b622aa139dc4cb880243c382052eb39/FLAG0161e2f22 [2021-10-13 07:39:50,885 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:39:50,886 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/sv-benchmarks/c/systemc/token_ring.03.cil-2.c [2021-10-13 07:39:50,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/data/bdcaded75/9b622aa139dc4cb880243c382052eb39/FLAG0161e2f22 [2021-10-13 07:39:51,226 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/data/bdcaded75/9b622aa139dc4cb880243c382052eb39 [2021-10-13 07:39:51,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:39:51,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:39:51,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:39:51,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:39:51,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:39:51,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51164b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51, skipping insertion in model container [2021-10-13 07:39:51,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:39:51,300 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:39:51,488 WARN L228 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_bba3a167-58a8-4dcf-be26-d668f48d5def/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[366,379] [2021-10-13 07:39:51,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:39:51,581 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:39:51,605 WARN L228 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_bba3a167-58a8-4dcf-be26-d668f48d5def/sv-benchmarks/c/systemc/token_ring.03.cil-2.c[366,379] [2021-10-13 07:39:51,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:39:51,664 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:39:51,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51 WrapperNode [2021-10-13 07:39:51,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:39:51,666 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:39:51,666 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:39:51,666 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:39:51,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:39:51,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:39:51,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:39:51,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:39:51,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:39:51,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:39:51,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:39:51,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:39:51,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (1/1) ... [2021-10-13 07:39:51,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:39:51,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:39:51,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:39:51,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:39:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:39:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:39:51,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:39:51,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:39:54,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:39:54,147 INFO L299 CfgBuilder]: Removed 130 assume(true) statements. [2021-10-13 07:39:54,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:39:54 BoogieIcfgContainer [2021-10-13 07:39:54,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:39:54,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:39:54,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:39:54,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:39:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:39:51" (1/3) ... [2021-10-13 07:39:54,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a89959e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:39:54, skipping insertion in model container [2021-10-13 07:39:54,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:39:51" (2/3) ... [2021-10-13 07:39:54,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a89959e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:39:54, skipping insertion in model container [2021-10-13 07:39:54,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:39:54" (3/3) ... [2021-10-13 07:39:54,164 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2021-10-13 07:39:54,179 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:39:54,179 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 07:39:54,262 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:39:54,274 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, mConcurrency=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-10-13 07:39:54,274 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 07:39:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 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-10-13 07:39:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 07:39:54,312 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:54,313 INFO L512 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] [2021-10-13 07:39:54,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:54,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:54,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1914888244, now seen corresponding path program 1 times [2021-10-13 07:39:54,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:54,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120795032] [2021-10-13 07:39:54,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:54,348 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:39:54,536 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:54,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120795032] [2021-10-13 07:39:54,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120795032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:54,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:54,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:39:54,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67349193] [2021-10-13 07:39:54,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:39:54,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:54,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:39:54,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:39:54,566 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.5594405594405594) internal successors, (223), 144 states have internal predecessors, (223), 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) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-10-13 07:39:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:54,713 INFO L93 Difference]: Finished difference Result 405 states and 621 transitions. [2021-10-13 07:39:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:39:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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) Word has length 22 [2021-10-13 07:39:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:54,730 INFO L225 Difference]: With dead ends: 405 [2021-10-13 07:39:54,730 INFO L226 Difference]: Without dead ends: 258 [2021-10-13 07:39:54,734 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:39:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-13 07:39:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 244. [2021-10-13 07:39:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 1.4897119341563787) internal successors, (362), 243 states have internal predecessors, (362), 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-10-13 07:39:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2021-10-13 07:39:54,792 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 22 [2021-10-13 07:39:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:54,793 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2021-10-13 07:39:54,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-10-13 07:39:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2021-10-13 07:39:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:39:54,797 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:54,797 INFO L512 BasicCegarLoop]: trace histogram [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-10-13 07:39:54,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:39:54,798 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1462365306, now seen corresponding path program 1 times [2021-10-13 07:39:54,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:54,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779381537] [2021-10-13 07:39:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:54,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:39:54,867 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:54,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779381537] [2021-10-13 07:39:54,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779381537] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:54,868 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:54,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:54,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289592837] [2021-10-13 07:39:54,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:39:54,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:54,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:39:54,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:54,871 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 07:39:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:55,001 INFO L93 Difference]: Finished difference Result 774 states and 1140 transitions. [2021-10-13 07:39:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:39:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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) Word has length 43 [2021-10-13 07:39:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:55,006 INFO L225 Difference]: With dead ends: 774 [2021-10-13 07:39:55,007 INFO L226 Difference]: Without dead ends: 539 [2021-10-13 07:39:55,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:39:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2021-10-13 07:39:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 427. [2021-10-13 07:39:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 1.460093896713615) internal successors, (622), 426 states have internal predecessors, (622), 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-10-13 07:39:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 622 transitions. [2021-10-13 07:39:55,042 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 622 transitions. Word has length 43 [2021-10-13 07:39:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:55,042 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 622 transitions. [2021-10-13 07:39:55,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 07:39:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 622 transitions. [2021-10-13 07:39:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:39:55,046 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:55,047 INFO L512 BasicCegarLoop]: trace histogram [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-10-13 07:39:55,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:39:55,047 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:55,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:55,053 INFO L82 PathProgramCache]: Analyzing trace with hash -302451303, now seen corresponding path program 1 times [2021-10-13 07:39:55,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:55,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880529996] [2021-10-13 07:39:55,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:55,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:39:55,142 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:55,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880529996] [2021-10-13 07:39:55,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880529996] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:55,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:55,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:55,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563235965] [2021-10-13 07:39:55,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:39:55,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:39:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:55,145 INFO L87 Difference]: Start difference. First operand 427 states and 622 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 07:39:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:55,292 INFO L93 Difference]: Finished difference Result 1358 states and 1963 transitions. [2021-10-13 07:39:55,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:39:55,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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) Word has length 43 [2021-10-13 07:39:55,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:55,300 INFO L225 Difference]: With dead ends: 1358 [2021-10-13 07:39:55,300 INFO L226 Difference]: Without dead ends: 943 [2021-10-13 07:39:55,305 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:39:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-10-13 07:39:55,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 756. [2021-10-13 07:39:55,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.4317880794701987) internal successors, (1081), 755 states have internal predecessors, (1081), 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-10-13 07:39:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1081 transitions. [2021-10-13 07:39:55,363 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1081 transitions. Word has length 43 [2021-10-13 07:39:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:55,363 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1081 transitions. [2021-10-13 07:39:55,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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-10-13 07:39:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1081 transitions. [2021-10-13 07:39:55,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:39:55,370 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:55,370 INFO L512 BasicCegarLoop]: trace histogram [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-10-13 07:39:55,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:39:55,371 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1411597113, now seen corresponding path program 1 times [2021-10-13 07:39:55,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:55,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458950346] [2021-10-13 07:39:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:55,373 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:39:55,481 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:55,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458950346] [2021-10-13 07:39:55,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458950346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:55,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:55,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:55,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184356853] [2021-10-13 07:39:55,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:39:55,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:39:55,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:55,484 INFO L87 Difference]: Start difference. First operand 756 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-13 07:39:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:55,683 INFO L93 Difference]: Finished difference Result 2486 states and 3517 transitions. [2021-10-13 07:39:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:39:55,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2021-10-13 07:39:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:55,695 INFO L225 Difference]: With dead ends: 2486 [2021-10-13 07:39:55,695 INFO L226 Difference]: Without dead ends: 1735 [2021-10-13 07:39:55,698 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:39:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2021-10-13 07:39:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1343. [2021-10-13 07:39:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1342 states have (on average 1.405365126676602) internal successors, (1886), 1342 states have internal predecessors, (1886), 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-10-13 07:39:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1886 transitions. [2021-10-13 07:39:55,782 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1886 transitions. Word has length 43 [2021-10-13 07:39:55,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:55,783 INFO L470 AbstractCegarLoop]: Abstraction has 1343 states and 1886 transitions. [2021-10-13 07:39:55,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-13 07:39:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1886 transitions. [2021-10-13 07:39:55,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-13 07:39:55,787 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:55,787 INFO L512 BasicCegarLoop]: trace histogram [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-10-13 07:39:55,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:39:55,788 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2072930904, now seen corresponding path program 1 times [2021-10-13 07:39:55,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:55,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784753183] [2021-10-13 07:39:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:55,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:39:55,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:55,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784753183] [2021-10-13 07:39:55,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784753183] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:55,945 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:55,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:55,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998487481] [2021-10-13 07:39:55,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:39:55,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:39:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:55,948 INFO L87 Difference]: Start difference. First operand 1343 states and 1886 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-13 07:39:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:56,169 INFO L93 Difference]: Finished difference Result 4577 states and 6469 transitions. [2021-10-13 07:39:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:39:56,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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) Word has length 43 [2021-10-13 07:39:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:56,190 INFO L225 Difference]: With dead ends: 4577 [2021-10-13 07:39:56,190 INFO L226 Difference]: Without dead ends: 3247 [2021-10-13 07:39:56,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-10-13 07:39:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2499. [2021-10-13 07:39:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2498 states have (on average 1.3971176941553243) internal successors, (3490), 2498 states have internal predecessors, (3490), 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-10-13 07:39:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 3490 transitions. [2021-10-13 07:39:56,362 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 3490 transitions. Word has length 43 [2021-10-13 07:39:56,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:56,365 INFO L470 AbstractCegarLoop]: Abstraction has 2499 states and 3490 transitions. [2021-10-13 07:39:56,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 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-10-13 07:39:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 3490 transitions. [2021-10-13 07:39:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-13 07:39:56,369 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:56,369 INFO L512 BasicCegarLoop]: trace histogram [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-10-13 07:39:56,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:39:56,370 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:56,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:56,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1241637347, now seen corresponding path program 1 times [2021-10-13 07:39:56,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:56,371 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564000193] [2021-10-13 07:39:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:56,371 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:39:56,463 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:56,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564000193] [2021-10-13 07:39:56,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564000193] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:56,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:56,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:56,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157267138] [2021-10-13 07:39:56,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:39:56,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:56,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:39:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:39:56,467 INFO L87 Difference]: Start difference. First operand 2499 states and 3490 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-13 07:39:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:56,632 INFO L93 Difference]: Finished difference Result 4321 states and 6167 transitions. [2021-10-13 07:39:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:39:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2021-10-13 07:39:56,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:56,651 INFO L225 Difference]: With dead ends: 4321 [2021-10-13 07:39:56,652 INFO L226 Difference]: Without dead ends: 2895 [2021-10-13 07:39:56,657 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:39:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2021-10-13 07:39:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2735. [2021-10-13 07:39:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 1.4198975859546452) internal successors, (3882), 2734 states have internal predecessors, (3882), 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-10-13 07:39:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3882 transitions. [2021-10-13 07:39:56,811 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3882 transitions. Word has length 44 [2021-10-13 07:39:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:56,812 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 3882 transitions. [2021-10-13 07:39:56,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-13 07:39:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3882 transitions. [2021-10-13 07:39:56,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 07:39:56,820 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:56,821 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:39:56,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:39:56,821 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:56,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:56,822 INFO L82 PathProgramCache]: Analyzing trace with hash -585502559, now seen corresponding path program 1 times [2021-10-13 07:39:56,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:56,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095017802] [2021-10-13 07:39:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:56,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:39:56,939 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:56,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095017802] [2021-10-13 07:39:56,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095017802] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:56,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:56,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:56,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92799088] [2021-10-13 07:39:56,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:39:56,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:56,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:39:56,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:39:56,941 INFO L87 Difference]: Start difference. First operand 2735 states and 3882 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-13 07:39:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:57,097 INFO L93 Difference]: Finished difference Result 4597 states and 6559 transitions. [2021-10-13 07:39:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:39:57,097 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), 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) Word has length 63 [2021-10-13 07:39:57,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:57,115 INFO L225 Difference]: With dead ends: 4597 [2021-10-13 07:39:57,115 INFO L226 Difference]: Without dead ends: 2935 [2021-10-13 07:39:57,119 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:39:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2021-10-13 07:39:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2735. [2021-10-13 07:39:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2735 states, 2734 states have (on average 1.3833211411850768) internal successors, (3782), 2734 states have internal predecessors, (3782), 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-10-13 07:39:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2735 states to 2735 states and 3782 transitions. [2021-10-13 07:39:57,272 INFO L78 Accepts]: Start accepts. Automaton has 2735 states and 3782 transitions. Word has length 63 [2021-10-13 07:39:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:57,273 INFO L470 AbstractCegarLoop]: Abstraction has 2735 states and 3782 transitions. [2021-10-13 07:39:57,273 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), 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-10-13 07:39:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2735 states and 3782 transitions. [2021-10-13 07:39:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 07:39:57,279 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:57,279 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:39:57,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:39:57,280 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:57,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1004892418, now seen corresponding path program 1 times [2021-10-13 07:39:57,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:57,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837635635] [2021-10-13 07:39:57,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:57,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:39:57,368 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:57,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837635635] [2021-10-13 07:39:57,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837635635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:57,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:57,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:57,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79963008] [2021-10-13 07:39:57,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:39:57,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:57,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:39:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:57,371 INFO L87 Difference]: Start difference. First operand 2735 states and 3782 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-10-13 07:39:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:57,763 INFO L93 Difference]: Finished difference Result 9605 states and 13297 transitions. [2021-10-13 07:39:57,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:39:57,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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) Word has length 63 [2021-10-13 07:39:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:57,808 INFO L225 Difference]: With dead ends: 9605 [2021-10-13 07:39:57,808 INFO L226 Difference]: Without dead ends: 6883 [2021-10-13 07:39:57,815 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6883 states. [2021-10-13 07:39:58,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6883 to 5055. [2021-10-13 07:39:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5055 states, 5054 states have (on average 1.367233874159082) internal successors, (6910), 5054 states have internal predecessors, (6910), 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-10-13 07:39:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5055 states to 5055 states and 6910 transitions. [2021-10-13 07:39:58,207 INFO L78 Accepts]: Start accepts. Automaton has 5055 states and 6910 transitions. Word has length 63 [2021-10-13 07:39:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:58,208 INFO L470 AbstractCegarLoop]: Abstraction has 5055 states and 6910 transitions. [2021-10-13 07:39:58,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-10-13 07:39:58,208 INFO L276 IsEmpty]: Start isEmpty. Operand 5055 states and 6910 transitions. [2021-10-13 07:39:58,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-13 07:39:58,219 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:58,219 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:39:58,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:39:58,220 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:58,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1174872423, now seen corresponding path program 1 times [2021-10-13 07:39:58,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:58,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273147589] [2021-10-13 07:39:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:58,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:39:58,336 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:58,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273147589] [2021-10-13 07:39:58,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273147589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:39:58,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:39:58,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:39:58,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463964186] [2021-10-13 07:39:58,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:39:58,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:39:58,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:39:58,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:58,349 INFO L87 Difference]: Start difference. First operand 5055 states and 6910 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-10-13 07:39:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:39:59,059 INFO L93 Difference]: Finished difference Result 17409 states and 23781 transitions. [2021-10-13 07:39:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:39:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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) Word has length 64 [2021-10-13 07:39:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:39:59,188 INFO L225 Difference]: With dead ends: 17409 [2021-10-13 07:39:59,188 INFO L226 Difference]: Without dead ends: 12367 [2021-10-13 07:39:59,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:39:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12367 states. [2021-10-13 07:39:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12367 to 9295. [2021-10-13 07:39:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9295 states, 9294 states have (on average 1.347751237357435) internal successors, (12526), 9294 states have internal predecessors, (12526), 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-10-13 07:39:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9295 states to 9295 states and 12526 transitions. [2021-10-13 07:39:59,759 INFO L78 Accepts]: Start accepts. Automaton has 9295 states and 12526 transitions. Word has length 64 [2021-10-13 07:39:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:39:59,759 INFO L470 AbstractCegarLoop]: Abstraction has 9295 states and 12526 transitions. [2021-10-13 07:39:59,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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-10-13 07:39:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9295 states and 12526 transitions. [2021-10-13 07:39:59,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-13 07:39:59,780 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:39:59,780 INFO L512 BasicCegarLoop]: trace histogram [3, 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-10-13 07:39:59,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:39:59,781 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:39:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:39:59,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1845858571, now seen corresponding path program 1 times [2021-10-13 07:39:59,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:39:59,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600494176] [2021-10-13 07:39:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:59,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:39:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:39:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-13 07:39:59,860 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:39:59,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600494176] [2021-10-13 07:39:59,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600494176] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:39:59,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294846485] [2021-10-13 07:39:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:39:59,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:39:59,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:39:59,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:39:59,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:39:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:00,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 07:40:00,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:00,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:00,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294846485] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:00,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:00,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [4] total 10 [2021-10-13 07:40:00,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551095452] [2021-10-13 07:40:00,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:40:00,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:00,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:40:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:40:00,615 INFO L87 Difference]: Start difference. First operand 9295 states and 12526 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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-10-13 07:40:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:02,037 INFO L93 Difference]: Finished difference Result 25737 states and 35448 transitions. [2021-10-13 07:40:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-13 07:40:02,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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) Word has length 65 [2021-10-13 07:40:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:02,088 INFO L225 Difference]: With dead ends: 25737 [2021-10-13 07:40:02,088 INFO L226 Difference]: Without dead ends: 16455 [2021-10-13 07:40:02,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 197.1ms TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2021-10-13 07:40:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16455 states. [2021-10-13 07:40:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16455 to 10124. [2021-10-13 07:40:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10124 states, 10123 states have (on average 1.3684678455003458) internal successors, (13853), 10123 states have internal predecessors, (13853), 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-10-13 07:40:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 13853 transitions. [2021-10-13 07:40:03,023 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 13853 transitions. Word has length 65 [2021-10-13 07:40:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:03,024 INFO L470 AbstractCegarLoop]: Abstraction has 10124 states and 13853 transitions. [2021-10-13 07:40:03,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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-10-13 07:40:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 13853 transitions. [2021-10-13 07:40:03,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-13 07:40:03,049 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:03,049 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:03,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:03,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-13 07:40:03,273 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:03,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1769743795, now seen corresponding path program 1 times [2021-10-13 07:40:03,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:03,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711127404] [2021-10-13 07:40:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:03,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:03,367 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:03,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711127404] [2021-10-13 07:40:03,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711127404] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:03,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:03,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:03,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191350349] [2021-10-13 07:40:03,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:03,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:03,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:03,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:03,370 INFO L87 Difference]: Start difference. First operand 10124 states and 13853 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-13 07:40:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:04,189 INFO L93 Difference]: Finished difference Result 20234 states and 27692 transitions. [2021-10-13 07:40:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:04,190 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), 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) Word has length 67 [2021-10-13 07:40:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:04,221 INFO L225 Difference]: With dead ends: 20234 [2021-10-13 07:40:04,222 INFO L226 Difference]: Without dead ends: 10124 [2021-10-13 07:40:04,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10124 states. [2021-10-13 07:40:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10124 to 10124. [2021-10-13 07:40:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10124 states, 10123 states have (on average 1.3512792650400078) internal successors, (13679), 10123 states have internal predecessors, (13679), 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-10-13 07:40:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10124 states to 10124 states and 13679 transitions. [2021-10-13 07:40:05,093 INFO L78 Accepts]: Start accepts. Automaton has 10124 states and 13679 transitions. Word has length 67 [2021-10-13 07:40:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:05,094 INFO L470 AbstractCegarLoop]: Abstraction has 10124 states and 13679 transitions. [2021-10-13 07:40:05,094 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), 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-10-13 07:40:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10124 states and 13679 transitions. [2021-10-13 07:40:05,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-13 07:40:05,116 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:05,116 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:05,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:40:05,117 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1551734542, now seen corresponding path program 1 times [2021-10-13 07:40:05,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:05,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897312404] [2021-10-13 07:40:05,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:05,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:05,164 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:05,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897312404] [2021-10-13 07:40:05,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897312404] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:05,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:05,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:05,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618461522] [2021-10-13 07:40:05,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:05,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:05,167 INFO L87 Difference]: Start difference. First operand 10124 states and 13679 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-10-13 07:40:05,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:05,622 INFO L93 Difference]: Finished difference Result 16851 states and 22836 transitions. [2021-10-13 07:40:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:05,623 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), 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) Word has length 67 [2021-10-13 07:40:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:05,645 INFO L225 Difference]: With dead ends: 16851 [2021-10-13 07:40:05,645 INFO L226 Difference]: Without dead ends: 6741 [2021-10-13 07:40:05,663 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6741 states. [2021-10-13 07:40:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6741 to 6670. [2021-10-13 07:40:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6670 states, 6669 states have (on average 1.314589893537262) internal successors, (8767), 6669 states have internal predecessors, (8767), 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-10-13 07:40:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 8767 transitions. [2021-10-13 07:40:06,164 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 8767 transitions. Word has length 67 [2021-10-13 07:40:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:06,165 INFO L470 AbstractCegarLoop]: Abstraction has 6670 states and 8767 transitions. [2021-10-13 07:40:06,165 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), 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-10-13 07:40:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 8767 transitions. [2021-10-13 07:40:06,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-13 07:40:06,187 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:06,187 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:40:06,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 07:40:06,188 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:06,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1699998803, now seen corresponding path program 1 times [2021-10-13 07:40:06,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:06,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4700244] [2021-10-13 07:40:06,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:06,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:06,269 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:06,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4700244] [2021-10-13 07:40:06,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4700244] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:06,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069317457] [2021-10-13 07:40:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:06,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:06,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:06,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:06,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 07:40:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:06,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:40:06,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:06,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:07,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069317457] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:07,049 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:07,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [4] total 12 [2021-10-13 07:40:07,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019061706] [2021-10-13 07:40:07,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 07:40:07,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:07,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 07:40:07,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-13 07:40:07,052 INFO L87 Difference]: Start difference. First operand 6670 states and 8767 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-10-13 07:40:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:08,441 INFO L93 Difference]: Finished difference Result 15807 states and 21033 transitions. [2021-10-13 07:40:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-13 07:40:08,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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) Word has length 68 [2021-10-13 07:40:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:08,471 INFO L225 Difference]: With dead ends: 15807 [2021-10-13 07:40:08,471 INFO L226 Difference]: Without dead ends: 10406 [2021-10-13 07:40:08,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 346.5ms TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2021-10-13 07:40:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10406 states. [2021-10-13 07:40:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10406 to 6053. [2021-10-13 07:40:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6053 states, 6052 states have (on average 1.3319563780568406) internal successors, (8061), 6052 states have internal predecessors, (8061), 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-10-13 07:40:08,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6053 states to 6053 states and 8061 transitions. [2021-10-13 07:40:08,863 INFO L78 Accepts]: Start accepts. Automaton has 6053 states and 8061 transitions. Word has length 68 [2021-10-13 07:40:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:08,864 INFO L470 AbstractCegarLoop]: Abstraction has 6053 states and 8061 transitions. [2021-10-13 07:40:08,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 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-10-13 07:40:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6053 states and 8061 transitions. [2021-10-13 07:40:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-13 07:40:08,877 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:08,878 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1] [2021-10-13 07:40:08,919 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:09,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-10-13 07:40:09,105 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1144230019, now seen corresponding path program 1 times [2021-10-13 07:40:09,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:09,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187626723] [2021-10-13 07:40:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:09,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:09,174 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:09,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187626723] [2021-10-13 07:40:09,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187626723] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:09,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209522298] [2021-10-13 07:40:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:09,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:09,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:09,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:09,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-13 07:40:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:09,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-13 07:40:09,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:09,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:09,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209522298] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:09,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:09,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 4] imperfect sequences [4] total 13 [2021-10-13 07:40:09,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660831130] [2021-10-13 07:40:09,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 07:40:09,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:09,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 07:40:09,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-13 07:40:09,832 INFO L87 Difference]: Start difference. First operand 6053 states and 8061 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10-13 07:40:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:11,352 INFO L93 Difference]: Finished difference Result 13608 states and 18150 transitions. [2021-10-13 07:40:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-10-13 07:40:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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) Word has length 70 [2021-10-13 07:40:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:11,376 INFO L225 Difference]: With dead ends: 13608 [2021-10-13 07:40:11,376 INFO L226 Difference]: Without dead ends: 9672 [2021-10-13 07:40:11,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 558.6ms TimeCoverageRelationStatistics Valid=349, Invalid=1373, Unknown=0, NotChecked=0, Total=1722 [2021-10-13 07:40:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9672 states. [2021-10-13 07:40:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9672 to 5812. [2021-10-13 07:40:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5812 states, 5811 states have (on average 1.336258819480296) internal successors, (7765), 5811 states have internal predecessors, (7765), 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-10-13 07:40:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5812 states to 5812 states and 7765 transitions. [2021-10-13 07:40:11,866 INFO L78 Accepts]: Start accepts. Automaton has 5812 states and 7765 transitions. Word has length 70 [2021-10-13 07:40:11,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:11,866 INFO L470 AbstractCegarLoop]: Abstraction has 5812 states and 7765 transitions. [2021-10-13 07:40:11,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-10-13 07:40:11,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5812 states and 7765 transitions. [2021-10-13 07:40:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 07:40:11,886 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:11,887 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:40:11,932 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-10-13 07:40:12,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-10-13 07:40:12,101 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:12,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1354715054, now seen corresponding path program 1 times [2021-10-13 07:40:12,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:12,101 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582723745] [2021-10-13 07:40:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:12,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:12,163 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:12,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582723745] [2021-10-13 07:40:12,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582723745] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:12,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198808901] [2021-10-13 07:40:12,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:12,165 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:12,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:12,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-13 07:40:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:12,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:40:12,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:12,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:12,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198808901] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:12,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:12,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:40:12,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629513901] [2021-10-13 07:40:12,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:12,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:12,853 INFO L87 Difference]: Start difference. First operand 5812 states and 7765 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-13 07:40:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:13,329 INFO L93 Difference]: Finished difference Result 12669 states and 16932 transitions. [2021-10-13 07:40:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) Word has length 72 [2021-10-13 07:40:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:13,344 INFO L225 Difference]: With dead ends: 12669 [2021-10-13 07:40:13,345 INFO L226 Difference]: Without dead ends: 6898 [2021-10-13 07:40:13,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:13,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2021-10-13 07:40:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 6155. [2021-10-13 07:40:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6155 states, 6154 states have (on average 1.3414039649008775) internal successors, (8255), 6154 states have internal predecessors, (8255), 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-10-13 07:40:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 8255 transitions. [2021-10-13 07:40:13,949 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 8255 transitions. Word has length 72 [2021-10-13 07:40:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:13,949 INFO L470 AbstractCegarLoop]: Abstraction has 6155 states and 8255 transitions. [2021-10-13 07:40:13,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-13 07:40:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 8255 transitions. [2021-10-13 07:40:13,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 07:40:13,961 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:13,962 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:40:14,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:14,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-13 07:40:14,177 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:14,177 INFO L82 PathProgramCache]: Analyzing trace with hash 178836382, now seen corresponding path program 1 times [2021-10-13 07:40:14,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:14,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155782950] [2021-10-13 07:40:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:14,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:14,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:14,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155782950] [2021-10-13 07:40:14,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155782950] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:14,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676616676] [2021-10-13 07:40:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:14,252 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:14,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:14,253 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:14,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-13 07:40:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:14,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:40:14,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:14,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:14,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676616676] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:14,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:14,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-13 07:40:14,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325615659] [2021-10-13 07:40:14,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:14,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:14,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:14,946 INFO L87 Difference]: Start difference. First operand 6155 states and 8255 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-13 07:40:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:15,375 INFO L93 Difference]: Finished difference Result 11832 states and 15909 transitions. [2021-10-13 07:40:15,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:15,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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) Word has length 72 [2021-10-13 07:40:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:15,388 INFO L225 Difference]: With dead ends: 11832 [2021-10-13 07:40:15,388 INFO L226 Difference]: Without dead ends: 6705 [2021-10-13 07:40:15,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:40:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2021-10-13 07:40:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6181. [2021-10-13 07:40:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6181 states, 6180 states have (on average 1.3435275080906148) internal successors, (8303), 6180 states have internal predecessors, (8303), 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-10-13 07:40:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6181 states to 6181 states and 8303 transitions. [2021-10-13 07:40:15,839 INFO L78 Accepts]: Start accepts. Automaton has 6181 states and 8303 transitions. Word has length 72 [2021-10-13 07:40:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:15,840 INFO L470 AbstractCegarLoop]: Abstraction has 6181 states and 8303 transitions. [2021-10-13 07:40:15,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-13 07:40:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 6181 states and 8303 transitions. [2021-10-13 07:40:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 07:40:15,852 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:15,853 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2021-10-13 07:40:15,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:16,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-13 07:40:16,077 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1711425730, now seen corresponding path program 1 times [2021-10-13 07:40:16,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:16,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730939424] [2021-10-13 07:40:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:16,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:16,149 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:16,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730939424] [2021-10-13 07:40:16,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730939424] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:16,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:16,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:16,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663553920] [2021-10-13 07:40:16,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:16,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:16,152 INFO L87 Difference]: Start difference. First operand 6181 states and 8303 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-10-13 07:40:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:16,559 INFO L93 Difference]: Finished difference Result 11127 states and 14982 transitions. [2021-10-13 07:40:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:16,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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) Word has length 72 [2021-10-13 07:40:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:16,567 INFO L225 Difference]: With dead ends: 11127 [2021-10-13 07:40:16,567 INFO L226 Difference]: Without dead ends: 5040 [2021-10-13 07:40:16,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5040 states. [2021-10-13 07:40:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 4956. [2021-10-13 07:40:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.3089808274470232) internal successors, (6486), 4955 states have internal predecessors, (6486), 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-10-13 07:40:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 6486 transitions. [2021-10-13 07:40:16,977 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 6486 transitions. Word has length 72 [2021-10-13 07:40:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:16,977 INFO L470 AbstractCegarLoop]: Abstraction has 4956 states and 6486 transitions. [2021-10-13 07:40:16,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-10-13 07:40:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 6486 transitions. [2021-10-13 07:40:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 07:40:16,986 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:16,987 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2021-10-13 07:40:16,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 07:40:16,987 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1513117887, now seen corresponding path program 1 times [2021-10-13 07:40:16,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:16,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076100743] [2021-10-13 07:40:16,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:16,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:17,068 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:17,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076100743] [2021-10-13 07:40:17,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076100743] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:17,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55262457] [2021-10-13 07:40:17,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:17,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:17,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:17,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:17,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-13 07:40:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:17,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 07:40:17,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:17,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:17,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:17,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55262457] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:17,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:17,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [4] total 8 [2021-10-13 07:40:17,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652506911] [2021-10-13 07:40:17,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:40:17,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:40:17,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:40:17,987 INFO L87 Difference]: Start difference. First operand 4956 states and 6486 transitions. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 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-10-13 07:40:18,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:18,418 INFO L93 Difference]: Finished difference Result 8519 states and 11132 transitions. [2021-10-13 07:40:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:40:18,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 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) Word has length 72 [2021-10-13 07:40:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:18,427 INFO L225 Difference]: With dead ends: 8519 [2021-10-13 07:40:18,428 INFO L226 Difference]: Without dead ends: 5199 [2021-10-13 07:40:18,433 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 29.8ms TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:40:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2021-10-13 07:40:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4956. [2021-10-13 07:40:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.2952573158425833) internal successors, (6418), 4955 states have internal predecessors, (6418), 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-10-13 07:40:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 6418 transitions. [2021-10-13 07:40:18,700 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 6418 transitions. Word has length 72 [2021-10-13 07:40:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:18,701 INFO L470 AbstractCegarLoop]: Abstraction has 4956 states and 6418 transitions. [2021-10-13 07:40:18,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 5 states have internal predecessors, (119), 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-10-13 07:40:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 6418 transitions. [2021-10-13 07:40:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 07:40:18,710 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:18,710 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:40:18,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:18,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-13 07:40:18,925 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash 607011608, now seen corresponding path program 1 times [2021-10-13 07:40:18,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:18,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956240920] [2021-10-13 07:40:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:18,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:40:18,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:18,967 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956240920] [2021-10-13 07:40:18,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956240920] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:18,967 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:18,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:18,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855142345] [2021-10-13 07:40:18,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:18,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:18,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:18,970 INFO L87 Difference]: Start difference. First operand 4956 states and 6418 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10-13 07:40:19,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:19,414 INFO L93 Difference]: Finished difference Result 11721 states and 15299 transitions. [2021-10-13 07:40:19,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:19,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) Word has length 72 [2021-10-13 07:40:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:19,426 INFO L225 Difference]: With dead ends: 11721 [2021-10-13 07:40:19,426 INFO L226 Difference]: Without dead ends: 6779 [2021-10-13 07:40:19,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6779 states. [2021-10-13 07:40:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6779 to 5914. [2021-10-13 07:40:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 5913 states have (on average 1.3006933874513784) internal successors, (7691), 5913 states have internal predecessors, (7691), 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-10-13 07:40:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 7691 transitions. [2021-10-13 07:40:19,857 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 7691 transitions. Word has length 72 [2021-10-13 07:40:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:19,857 INFO L470 AbstractCegarLoop]: Abstraction has 5914 states and 7691 transitions. [2021-10-13 07:40:19,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-10-13 07:40:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 7691 transitions. [2021-10-13 07:40:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-13 07:40:19,862 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:19,862 INFO L512 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2021-10-13 07:40:19,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 07:40:19,863 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash -859186428, now seen corresponding path program 1 times [2021-10-13 07:40:19,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:19,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857968335] [2021-10-13 07:40:19,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:19,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:19,936 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:19,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857968335] [2021-10-13 07:40:19,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857968335] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:19,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270354105] [2021-10-13 07:40:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:19,937 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:19,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:19,945 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:19,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-13 07:40:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:20,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-13 07:40:20,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:20,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:21,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270354105] provided 1 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:21,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-10-13 07:40:21,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 13 [2021-10-13 07:40:21,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437957216] [2021-10-13 07:40:21,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:40:21,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:40:21,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-13 07:40:21,120 INFO L87 Difference]: Start difference. First operand 5914 states and 7691 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10-13 07:40:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:21,856 INFO L93 Difference]: Finished difference Result 14232 states and 18336 transitions. [2021-10-13 07:40:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:40:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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) Word has length 73 [2021-10-13 07:40:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:21,868 INFO L225 Difference]: With dead ends: 14232 [2021-10-13 07:40:21,868 INFO L226 Difference]: Without dead ends: 6298 [2021-10-13 07:40:21,875 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 72.4ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-13 07:40:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2021-10-13 07:40:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 5324. [2021-10-13 07:40:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5324 states, 5323 states have (on average 1.25605861356378) internal successors, (6686), 5323 states have internal predecessors, (6686), 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-10-13 07:40:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6686 transitions. [2021-10-13 07:40:22,186 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6686 transitions. Word has length 73 [2021-10-13 07:40:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:22,186 INFO L470 AbstractCegarLoop]: Abstraction has 5324 states and 6686 transitions. [2021-10-13 07:40:22,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-10-13 07:40:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6686 transitions. [2021-10-13 07:40:22,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-10-13 07:40:22,193 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:22,194 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-10-13 07:40:22,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:22,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:22,417 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash -272720491, now seen corresponding path program 1 times [2021-10-13 07:40:22,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:22,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159859002] [2021-10-13 07:40:22,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:22,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:22,474 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:22,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159859002] [2021-10-13 07:40:22,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159859002] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:22,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:22,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:22,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29722413] [2021-10-13 07:40:22,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:22,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:22,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:22,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:22,477 INFO L87 Difference]: Start difference. First operand 5324 states and 6686 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-10-13 07:40:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:23,275 INFO L93 Difference]: Finished difference Result 10444 states and 13146 transitions. [2021-10-13 07:40:23,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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) Word has length 73 [2021-10-13 07:40:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:23,284 INFO L225 Difference]: With dead ends: 10444 [2021-10-13 07:40:23,284 INFO L226 Difference]: Without dead ends: 6247 [2021-10-13 07:40:23,289 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6247 states. [2021-10-13 07:40:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6247 to 5324. [2021-10-13 07:40:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5324 states, 5323 states have (on average 1.2344542551192936) internal successors, (6571), 5323 states have internal predecessors, (6571), 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-10-13 07:40:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6571 transitions. [2021-10-13 07:40:23,753 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6571 transitions. Word has length 73 [2021-10-13 07:40:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:23,754 INFO L470 AbstractCegarLoop]: Abstraction has 5324 states and 6571 transitions. [2021-10-13 07:40:23,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-10-13 07:40:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6571 transitions. [2021-10-13 07:40:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-10-13 07:40:23,760 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:23,760 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 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-10-13 07:40:23,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 07:40:23,760 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1172145059, now seen corresponding path program 1 times [2021-10-13 07:40:23,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:23,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406529951] [2021-10-13 07:40:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:23,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:23,817 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:23,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406529951] [2021-10-13 07:40:23,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406529951] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:23,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:23,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:40:23,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605583096] [2021-10-13 07:40:23,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:23,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:23,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:23,820 INFO L87 Difference]: Start difference. First operand 5324 states and 6571 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-10-13 07:40:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:24,439 INFO L93 Difference]: Finished difference Result 10865 states and 13384 transitions. [2021-10-13 07:40:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:24,445 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), 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) Word has length 75 [2021-10-13 07:40:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:24,455 INFO L225 Difference]: With dead ends: 10865 [2021-10-13 07:40:24,455 INFO L226 Difference]: Without dead ends: 6668 [2021-10-13 07:40:24,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2021-10-13 07:40:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 5579. [2021-10-13 07:40:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5579 states, 5578 states have (on average 1.2228397275008964) internal successors, (6821), 5578 states have internal predecessors, (6821), 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-10-13 07:40:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 6821 transitions. [2021-10-13 07:40:24,798 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 6821 transitions. Word has length 75 [2021-10-13 07:40:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:24,799 INFO L470 AbstractCegarLoop]: Abstraction has 5579 states and 6821 transitions. [2021-10-13 07:40:24,799 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), 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-10-13 07:40:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 6821 transitions. [2021-10-13 07:40:24,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 07:40:24,803 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:24,803 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:40:24,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 07:40:24,804 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:24,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1736974502, now seen corresponding path program 1 times [2021-10-13 07:40:24,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:24,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528255094] [2021-10-13 07:40:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:24,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:24,901 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:24,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528255094] [2021-10-13 07:40:24,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528255094] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:24,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811730921] [2021-10-13 07:40:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:24,902 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:24,909 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:24,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-13 07:40:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:25,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:40:25,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:25,570 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:25,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:25,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811730921] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:25,827 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:25,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [3] total 5 [2021-10-13 07:40:25,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349074194] [2021-10-13 07:40:25,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:25,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:25,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:25,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:25,828 INFO L87 Difference]: Start difference. First operand 5579 states and 6821 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-10-13 07:40:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:26,315 INFO L93 Difference]: Finished difference Result 10818 states and 13218 transitions. [2021-10-13 07:40:26,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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) Word has length 93 [2021-10-13 07:40:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:26,321 INFO L225 Difference]: With dead ends: 10818 [2021-10-13 07:40:26,321 INFO L226 Difference]: Without dead ends: 5685 [2021-10-13 07:40:26,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2021-10-13 07:40:26,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 5579. [2021-10-13 07:40:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5579 states, 5578 states have (on average 1.2065256364288275) internal successors, (6730), 5578 states have internal predecessors, (6730), 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-10-13 07:40:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5579 states to 5579 states and 6730 transitions. [2021-10-13 07:40:26,715 INFO L78 Accepts]: Start accepts. Automaton has 5579 states and 6730 transitions. Word has length 93 [2021-10-13 07:40:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:26,715 INFO L470 AbstractCegarLoop]: Abstraction has 5579 states and 6730 transitions. [2021-10-13 07:40:26,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-10-13 07:40:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5579 states and 6730 transitions. [2021-10-13 07:40:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-13 07:40:26,720 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:26,720 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:40:26,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:26,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:26,921 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:26,922 INFO L82 PathProgramCache]: Analyzing trace with hash -623003666, now seen corresponding path program 1 times [2021-10-13 07:40:26,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:26,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021120652] [2021-10-13 07:40:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:26,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:26,979 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:26,980 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021120652] [2021-10-13 07:40:26,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021120652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:26,980 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:26,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:26,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876512402] [2021-10-13 07:40:26,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:26,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:26,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:26,982 INFO L87 Difference]: Start difference. First operand 5579 states and 6730 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-13 07:40:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:27,273 INFO L93 Difference]: Finished difference Result 8628 states and 10459 transitions. [2021-10-13 07:40:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:27,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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) Word has length 94 [2021-10-13 07:40:27,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:27,278 INFO L225 Difference]: With dead ends: 8628 [2021-10-13 07:40:27,279 INFO L226 Difference]: Without dead ends: 3503 [2021-10-13 07:40:27,283 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2021-10-13 07:40:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3483. [2021-10-13 07:40:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3483 states, 3482 states have (on average 1.163699023549684) internal successors, (4052), 3482 states have internal predecessors, (4052), 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-10-13 07:40:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 4052 transitions. [2021-10-13 07:40:27,494 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 4052 transitions. Word has length 94 [2021-10-13 07:40:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:27,495 INFO L470 AbstractCegarLoop]: Abstraction has 3483 states and 4052 transitions. [2021-10-13 07:40:27,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-10-13 07:40:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 4052 transitions. [2021-10-13 07:40:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-10-13 07:40:27,497 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:27,498 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:40:27,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 07:40:27,498 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:27,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:27,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1036850775, now seen corresponding path program 1 times [2021-10-13 07:40:27,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:27,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316589739] [2021-10-13 07:40:27,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:27,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:40:27,556 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:27,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316589739] [2021-10-13 07:40:27,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316589739] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:27,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:27,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:40:27,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846831122] [2021-10-13 07:40:27,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:27,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:27,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:27,558 INFO L87 Difference]: Start difference. First operand 3483 states and 4052 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-13 07:40:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:28,013 INFO L93 Difference]: Finished difference Result 7376 states and 8513 transitions. [2021-10-13 07:40:28,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:40:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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) Word has length 96 [2021-10-13 07:40:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:28,020 INFO L225 Difference]: With dead ends: 7376 [2021-10-13 07:40:28,020 INFO L226 Difference]: Without dead ends: 4352 [2021-10-13 07:40:28,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2021-10-13 07:40:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 3731. [2021-10-13 07:40:28,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1361930294906166) internal successors, (4238), 3730 states have internal predecessors, (4238), 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-10-13 07:40:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4238 transitions. [2021-10-13 07:40:28,250 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4238 transitions. Word has length 96 [2021-10-13 07:40:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:28,250 INFO L470 AbstractCegarLoop]: Abstraction has 3731 states and 4238 transitions. [2021-10-13 07:40:28,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-10-13 07:40:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4238 transitions. [2021-10-13 07:40:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-13 07:40:28,254 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:28,254 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:40:28,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 07:40:28,255 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1490254128, now seen corresponding path program 1 times [2021-10-13 07:40:28,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:28,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688334455] [2021-10-13 07:40:28,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:28,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-13 07:40:28,326 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:28,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688334455] [2021-10-13 07:40:28,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688334455] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:28,326 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239442216] [2021-10-13 07:40:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:28,327 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:28,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:28,329 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:28,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-13 07:40:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:28,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-13 07:40:28,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:40:29,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-13 07:40:30,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239442216] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:30,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:30,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 5] imperfect sequences [4] total 8 [2021-10-13 07:40:30,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682577279] [2021-10-13 07:40:30,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 07:40:30,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 07:40:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-13 07:40:30,119 INFO L87 Difference]: Start difference. First operand 3731 states and 4238 transitions. Second operand has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 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-10-13 07:40:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:30,740 INFO L93 Difference]: Finished difference Result 7406 states and 8389 transitions. [2021-10-13 07:40:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:40:30,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 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) Word has length 99 [2021-10-13 07:40:30,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:30,745 INFO L225 Difference]: With dead ends: 7406 [2021-10-13 07:40:30,746 INFO L226 Difference]: Without dead ends: 4543 [2021-10-13 07:40:30,749 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 57.9ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-13 07:40:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4543 states. [2021-10-13 07:40:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4543 to 3731. [2021-10-13 07:40:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3731 states, 3730 states have (on average 1.1329758713136728) internal successors, (4226), 3730 states have internal predecessors, (4226), 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-10-13 07:40:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4226 transitions. [2021-10-13 07:40:31,085 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4226 transitions. Word has length 99 [2021-10-13 07:40:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:31,085 INFO L470 AbstractCegarLoop]: Abstraction has 3731 states and 4226 transitions. [2021-10-13 07:40:31,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.5) internal successors, (156), 7 states have internal predecessors, (156), 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-10-13 07:40:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4226 transitions. [2021-10-13 07:40:31,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-10-13 07:40:31,104 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:31,105 INFO L512 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 07:40:31,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:31,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-10-13 07:40:31,325 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:31,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:31,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1700743775, now seen corresponding path program 1 times [2021-10-13 07:40:31,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:31,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141210084] [2021-10-13 07:40:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:31,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:31,489 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:31,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141210084] [2021-10-13 07:40:31,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141210084] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:31,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:31,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 07:40:31,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422039936] [2021-10-13 07:40:31,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:40:31,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:31,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:40:31,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:40:31,492 INFO L87 Difference]: Start difference. First operand 3731 states and 4226 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-13 07:40:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:32,415 INFO L93 Difference]: Finished difference Result 12497 states and 14274 transitions. [2021-10-13 07:40:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:40:32,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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) Word has length 118 [2021-10-13 07:40:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:32,429 INFO L225 Difference]: With dead ends: 12497 [2021-10-13 07:40:32,430 INFO L226 Difference]: Without dead ends: 10471 [2021-10-13 07:40:32,434 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.9ms TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:40:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10471 states. [2021-10-13 07:40:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10471 to 6505. [2021-10-13 07:40:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6505 states, 6504 states have (on average 1.1432964329643296) internal successors, (7436), 6504 states have internal predecessors, (7436), 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-10-13 07:40:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6505 states to 6505 states and 7436 transitions. [2021-10-13 07:40:32,881 INFO L78 Accepts]: Start accepts. Automaton has 6505 states and 7436 transitions. Word has length 118 [2021-10-13 07:40:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:32,882 INFO L470 AbstractCegarLoop]: Abstraction has 6505 states and 7436 transitions. [2021-10-13 07:40:32,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-10-13 07:40:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 6505 states and 7436 transitions. [2021-10-13 07:40:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-10-13 07:40:32,885 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:32,886 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-10-13 07:40:32,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 07:40:32,886 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:32,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:32,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1926987636, now seen corresponding path program 1 times [2021-10-13 07:40:32,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:32,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255448209] [2021-10-13 07:40:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:32,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-13 07:40:32,924 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:32,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255448209] [2021-10-13 07:40:32,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255448209] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:32,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:32,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:40:32,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599333219] [2021-10-13 07:40:32,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:40:32,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:32,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:40:32,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:32,926 INFO L87 Difference]: Start difference. First operand 6505 states and 7436 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-10-13 07:40:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:33,577 INFO L93 Difference]: Finished difference Result 13519 states and 15527 transitions. [2021-10-13 07:40:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:40:33,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) Word has length 123 [2021-10-13 07:40:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:33,585 INFO L225 Difference]: With dead ends: 13519 [2021-10-13 07:40:33,585 INFO L226 Difference]: Without dead ends: 7228 [2021-10-13 07:40:33,588 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:40:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7228 states. [2021-10-13 07:40:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7228 to 6512. [2021-10-13 07:40:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 6511 states have (on average 1.155582859775764) internal successors, (7524), 6511 states have internal predecessors, (7524), 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-10-13 07:40:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7524 transitions. [2021-10-13 07:40:34,015 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7524 transitions. Word has length 123 [2021-10-13 07:40:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:34,015 INFO L470 AbstractCegarLoop]: Abstraction has 6512 states and 7524 transitions. [2021-10-13 07:40:34,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-10-13 07:40:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7524 transitions. [2021-10-13 07:40:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-10-13 07:40:34,019 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:34,020 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 07:40:34,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 07:40:34,020 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:34,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:34,021 INFO L82 PathProgramCache]: Analyzing trace with hash -175805878, now seen corresponding path program 1 times [2021-10-13 07:40:34,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:34,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424531135] [2021-10-13 07:40:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:34,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-13 07:40:34,077 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:34,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424531135] [2021-10-13 07:40:34,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424531135] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:34,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:34,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:40:34,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56443692] [2021-10-13 07:40:34,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:34,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:34,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:34,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:34,079 INFO L87 Difference]: Start difference. First operand 6512 states and 7524 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-10-13 07:40:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:34,478 INFO L93 Difference]: Finished difference Result 10459 states and 12009 transitions. [2021-10-13 07:40:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:40:34,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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) Word has length 143 [2021-10-13 07:40:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:34,483 INFO L225 Difference]: With dead ends: 10459 [2021-10-13 07:40:34,483 INFO L226 Difference]: Without dead ends: 4519 [2021-10-13 07:40:34,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:34,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2021-10-13 07:40:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4105. [2021-10-13 07:40:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4104 states have (on average 1.1401072124756335) internal successors, (4679), 4104 states have internal predecessors, (4679), 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-10-13 07:40:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 4679 transitions. [2021-10-13 07:40:34,769 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 4679 transitions. Word has length 143 [2021-10-13 07:40:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:34,769 INFO L470 AbstractCegarLoop]: Abstraction has 4105 states and 4679 transitions. [2021-10-13 07:40:34,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-10-13 07:40:34,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 4679 transitions. [2021-10-13 07:40:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-10-13 07:40:34,772 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:34,772 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 07:40:34,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 07:40:34,772 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:34,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1597127135, now seen corresponding path program 1 times [2021-10-13 07:40:34,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:34,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146920114] [2021-10-13 07:40:34,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:34,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-13 07:40:34,823 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:34,823 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146920114] [2021-10-13 07:40:34,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146920114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:34,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:40:34,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:40:34,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900879161] [2021-10-13 07:40:34,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:40:34,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:34,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:40:34,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:40:34,826 INFO L87 Difference]: Start difference. First operand 4105 states and 4679 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-10-13 07:40:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:35,169 INFO L93 Difference]: Finished difference Result 7055 states and 8004 transitions. [2021-10-13 07:40:35,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:40:35,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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) Word has length 144 [2021-10-13 07:40:35,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:35,174 INFO L225 Difference]: With dead ends: 7055 [2021-10-13 07:40:35,174 INFO L226 Difference]: Without dead ends: 3410 [2021-10-13 07:40:35,177 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:40:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2021-10-13 07:40:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3093. [2021-10-13 07:40:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 3092 states have (on average 1.1345407503234153) internal successors, (3508), 3092 states have internal predecessors, (3508), 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-10-13 07:40:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 3508 transitions. [2021-10-13 07:40:35,505 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 3508 transitions. Word has length 144 [2021-10-13 07:40:35,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:35,506 INFO L470 AbstractCegarLoop]: Abstraction has 3093 states and 3508 transitions. [2021-10-13 07:40:35,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-10-13 07:40:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 3508 transitions. [2021-10-13 07:40:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-10-13 07:40:35,509 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:40:35,510 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 07:40:35,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 07:40:35,510 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:40:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:40:35,511 INFO L82 PathProgramCache]: Analyzing trace with hash 262470301, now seen corresponding path program 1 times [2021-10-13 07:40:35,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:40:35,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012217212] [2021-10-13 07:40:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:35,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:40:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 61 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-13 07:40:35,627 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:40:35,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012217212] [2021-10-13 07:40:35,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012217212] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:40:35,627 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548515183] [2021-10-13 07:40:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:40:35,628 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:40:35,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:40:35,633 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:40:35,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-13 07:40:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:40:36,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-13 07:40:36,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:40:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-13 07:40:36,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:40:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-13 07:40:36,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548515183] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:40:36,998 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-13 07:40:36,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 11 [2021-10-13 07:40:36,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483329360] [2021-10-13 07:40:36,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 07:40:37,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:40:37,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 07:40:37,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:40:37,001 INFO L87 Difference]: Start difference. First operand 3093 states and 3508 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-10-13 07:40:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:40:37,203 INFO L93 Difference]: Finished difference Result 3716 states and 4199 transitions. [2021-10-13 07:40:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:40:37,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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) Word has length 145 [2021-10-13 07:40:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:40:37,204 INFO L225 Difference]: With dead ends: 3716 [2021-10-13 07:40:37,204 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 07:40:37,206 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 52.4ms TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-13 07:40:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 07:40:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 07:40:37,207 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-10-13 07:40:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 07:40:37,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2021-10-13 07:40:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:40:37,207 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 07:40:37,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 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-10-13 07:40:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 07:40:37,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 07:40:37,209 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:40:37,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-13 07:40:37,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-10-13 07:40:37,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 07:40:37,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:37,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:37,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:37,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:37,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:42,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:42,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:42,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:43,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:44,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:44,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:44,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:44,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:44,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:47,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:47,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:47,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:47,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:48,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:48,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:49,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:50,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:50,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:50,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:50,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:54,351 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,791 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:56,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:40:57,074 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:41:03,645 WARN L207 SmtUtils]: Spent 5.04 s on a formula simplification. DAG size of input: 623 DAG size of output: 150 [2021-10-13 07:41:18,116 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 685 DAG size of output: 155 [2021-10-13 07:41:33,467 WARN L207 SmtUtils]: Spent 6.42 s on a formula simplification. DAG size of input: 827 DAG size of output: 167 [2021-10-13 07:41:43,089 INFO L853 garLoopResultBuilder]: At program point L103-1(lines 91 122) the Hoare annotation is: (let ((.cse30 (+ ~local~0 1)) (.cse22 (= ~t3_pc~0 1)) (.cse4 (= ~t2_pc~0 1))) (let ((.cse27 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse0 (= ~m_st~0 2)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse29 (<= 2 ~t2_st~0)) (.cse28 (<= 2 ~t3_st~0)) (.cse25 (= 0 ~t2_pc~0)) (.cse26 (not .cse4)) (.cse17 (= 2 ~t3_st~0)) (.cse1 (= 2 ~t2_st~0)) (.cse15 (= ~m_pc~0 0)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse22)) (.cse18 (<= ~token~0 .cse30)) (.cse3 (= ~E_3~0 2)) (.cse23 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= .cse30 ~token~0)) (.cse7 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse21 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 (or (and .cse17 .cse18 .cse3 .cse4 .cse5 .cse19 .cse7 .cse20 .cse8 .cse21 .cse12 .cse13 .cse22) (and .cse17 .cse18 .cse3 .cse23 .cse4 .cse5 .cse19 .cse7 .cse20 .cse8 .cse21 .cse24 .cse13 .cse22)) .cse9) (and .cse17 .cse3 .cse7 .cse15 .cse25 .cse8 .cse9 .cse21 .cse26 .cse12 .cse13 .cse22) (and .cse17 .cse16 .cse3 .cse5 .cse6 .cse7 .cse20 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse22) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse20 .cse15 .cse25 .cse8 .cse21 .cse12 .cse13 .cse14) (and .cse16 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14 .cse27) (and .cse2 (= ~E_3~0 ~E_1~0) .cse7 .cse15 .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14) (and (= ~t1_pc~0 1) .cse16 .cse2 .cse3 .cse5 .cse6 .cse7 .cse20 .cse25 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14) (and .cse17 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse22) (and .cse6 .cse20 .cse15 .cse8 .cse24 .cse13 .cse22) (and .cse6 .cse20 .cse15 .cse8 .cse12 .cse13 .cse14) (and .cse17 .cse16 .cse1 .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse9 .cse24 .cse13 .cse22 .cse27) (and .cse28 .cse20 .cse15 .cse8 .cse29 .cse24 .cse13 .cse22) (and .cse17 .cse0 .cse3 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse13 .cse22) (and .cse2 .cse20 .cse15 .cse8 .cse29 .cse12 .cse13 .cse14) (and .cse28 .cse20 .cse15 .cse25 .cse8 .cse21 .cse26 .cse12 .cse13 .cse22) (and .cse17 .cse1 .cse3 .cse4 .cse7 .cse15 .cse8 .cse9 .cse24 .cse13 .cse22) (and .cse16 .cse2 .cse18 .cse3 .cse23 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse21 .cse12 .cse13 .cse14)))) [2021-10-13 07:41:43,090 INFO L853 garLoopResultBuilder]: At program point L368(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse35 (+ ~local~0 1)) (.cse23 (= ~t2_pc~0 1))) (let ((.cse0 (= ~m_st~0 2)) (.cse27 (<= 2 ~t3_st~0)) (.cse30 (not .cse23)) (.cse31 (<= ~token~0 .cse35)) (.cse32 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse33 (<= .cse35 ~token~0)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse28 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse26 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse29 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse26 .cse27 .cse3 .cse20 .cse24 .cse8 .cse28 .cse25 .cse13 .cse21) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse26 .cse3 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse21) (and .cse1 .cse26 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse30 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse22 .cse1 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse26 .cse3 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse31 .cse18 .cse2 .cse32 .cse23 .cse4 .cse5 .cse33 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse22 .cse26 .cse3 .cse23 .cse29 .cse6 .cse24 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (let ((.cse34 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse34 ~token~0) (<= ~token~0 .cse34) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse26 .cse27 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse30 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse29 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse17 .cse18 (or (and .cse15 .cse16 .cse31 .cse2 .cse23 .cse4 .cse33 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse31 .cse2 .cse32 .cse23 .cse4 .cse33 .cse6 .cse20 .cse8 .cse9 .cse25 .cse13 .cse21))) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse28 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse26 .cse3 .cse23 .cse29 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-13 07:41:43,090 INFO L857 garLoopResultBuilder]: For program point L238(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,091 INFO L857 garLoopResultBuilder]: For program point L238-2(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,091 INFO L857 garLoopResultBuilder]: For program point L238-3(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,091 INFO L857 garLoopResultBuilder]: For program point L238-5(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,091 INFO L857 garLoopResultBuilder]: For program point L238-6(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,091 INFO L857 garLoopResultBuilder]: For program point L238-8(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,092 INFO L857 garLoopResultBuilder]: For program point L238-9(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,092 INFO L857 garLoopResultBuilder]: For program point L238-11(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,092 INFO L857 garLoopResultBuilder]: For program point L238-12(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,092 INFO L857 garLoopResultBuilder]: For program point L238-14(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,092 INFO L857 garLoopResultBuilder]: For program point L238-15(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,092 INFO L857 garLoopResultBuilder]: For program point L238-17(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,093 INFO L857 garLoopResultBuilder]: For program point L238-18(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,093 INFO L857 garLoopResultBuilder]: For program point L238-20(lines 238 247) no Hoare annotation was computed. [2021-10-13 07:41:43,093 INFO L857 garLoopResultBuilder]: For program point L371(lines 371 378) no Hoare annotation was computed. [2021-10-13 07:41:43,093 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 244) no Hoare annotation was computed. [2021-10-13 07:41:43,093 INFO L857 garLoopResultBuilder]: For program point L239-1(lines 239 244) no Hoare annotation was computed. [2021-10-13 07:41:43,093 INFO L857 garLoopResultBuilder]: For program point L239-2(lines 239 244) no Hoare annotation was computed. [2021-10-13 07:41:43,094 INFO L857 garLoopResultBuilder]: For program point L239-3(lines 239 244) no Hoare annotation was computed. [2021-10-13 07:41:43,094 INFO L857 garLoopResultBuilder]: For program point L239-4(lines 239 244) no Hoare annotation was computed. [2021-10-13 07:41:43,094 INFO L857 garLoopResultBuilder]: For program point L239-5(lines 239 244) no Hoare annotation was computed. [2021-10-13 07:41:43,094 INFO L857 garLoopResultBuilder]: For program point L239-6(lines 239 244) no Hoare annotation was computed. [2021-10-13 07:41:43,094 INFO L857 garLoopResultBuilder]: For program point L702(lines 702 706) no Hoare annotation was computed. [2021-10-13 07:41:43,095 INFO L853 garLoopResultBuilder]: At program point L175-1(lines 163 194) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse13 (not .cse0)) (.cse23 (= ~E_3~0 ~E_1~0)) (.cse18 (= ~m_st~0 2)) (.cse17 (< 0 ~t3_st~0)) (.cse14 (= ~t1_st~0 0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= 0 ~t2_pc~0)) (.cse8 (= 0 ~t2_st~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse19 (= 2 ~t2_st~0)) (.cse22 (= 2 ~t1_st~0)) (.cse1 (= ~E_3~0 2)) (.cse20 (= ~t2_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse15 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse5 .cse15 .cse7 (<= 2 ~t2_st~0) .cse16 .cse12) (and .cse13 .cse17 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse18 .cse19 .cse17 .cse1 .cse14 .cse20 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse16 .cse12) (and .cse0 .cse21 (<= (+ 3 ~local~0) ~token~0) .cse19 .cse22 .cse1 .cse20 .cse2 .cse4 .cse7 .cse16 .cse12 (< ~token~0 (+ ~local~0 4)) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (and .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse16 .cse12) (and .cse0 .cse22 .cse23 .cse4 .cse15 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse19 .cse13 .cse14 .cse20 .cse23 .cse4 .cse15 .cse7 .cse9 .cse10 .cse16 .cse12) (let ((.cse24 (+ ~local~0 1))) (and .cse0 .cse21 (<= ~token~0 .cse24) .cse22 .cse1 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse20 .cse2 .cse3 (<= .cse24 ~token~0) .cse4 .cse5 .cse7 .cse8 .cse16 .cse12)) (and .cse13 .cse17 .cse14 .cse23 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse18 .cse17 .cse1 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse21 .cse19 .cse22 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse7 .cse16 .cse12) (and .cse0 .cse21 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) (and .cse0 .cse19 .cse22 .cse1 .cse20 .cse4 .cse15 .cse7 .cse16 .cse12) (and .cse0 .cse5 .cse15 .cse7 .cse16 .cse12)))) [2021-10-13 07:41:43,095 INFO L860 garLoopResultBuilder]: At program point L708(lines 655 713) the Hoare annotation is: true [2021-10-13 07:41:43,095 INFO L857 garLoopResultBuilder]: For program point L48(lines 48 56) no Hoare annotation was computed. [2021-10-13 07:41:43,095 INFO L853 garLoopResultBuilder]: At program point L249(lines 237 251) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 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) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-13 07:41:43,095 INFO L853 garLoopResultBuilder]: At program point L249-1(lines 237 251) the Hoare annotation is: (let ((.cse12 (= ~t3_pc~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse14 (= 2 ~t2_st~0)) (.cse18 (not .cse12)) (.cse15 (= ~t2_pc~0 1)) (.cse19 (= 0 ~t3_st~0)) (.cse1 (= 2 ~t3_st~0)) (.cse16 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= ~E_3~0 2)) (.cse17 (= ~t1_st~0 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= 0 ~t2_pc~0)) (.cse7 (= ~E_M~0 2)) (.cse8 (= 0 ~t2_st~0)) (.cse9 (<= ~token~0 ~local~0)) (.cse10 (<= ~local~0 ~token~0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse12 .cse13) (and .cse1 .cse16 .cse14 .cse2 .cse17 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse0 .cse14 .cse18 .cse2 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse16 .cse18 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse16 .cse14 .cse18 .cse2 .cse17 .cse15 .cse3 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse19 .cse13) (and .cse1 .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)))) [2021-10-13 07:41:43,095 INFO L853 garLoopResultBuilder]: At program point L249-2(lines 237 251) the Hoare annotation is: (let ((.cse7 (= ~t3_pc~0 1)) (.cse25 (+ ~local~0 1))) (let ((.cse10 (= 2 ~t2_st~0)) (.cse23 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse12 (not (= ~E_3~0 1))) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= 2 ~t3_st~0)) (.cse22 (<= ~token~0 .cse25)) (.cse13 (= ~t2_pc~0 1)) (.cse24 (<= .cse25 ~token~0)) (.cse3 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse17 (not .cse7)) (.cse11 (= ~E_3~0 2)) (.cse14 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~m_st~0 0))) (.cse20 (= 0 ~t2_pc~0)) (.cse4 (= ~E_M~0 2)) (.cse15 (not (= ~t1_st~0 0))) (.cse21 (= 0 ~t2_st~0)) (.cse18 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse6 (= ~E_1~0 2)) (.cse19 (= 0 ~t3_st~0)) (.cse16 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16) (and .cse0 .cse9 .cse10 .cse17 .cse11 .cse12 .cse13 .cse14 .cse1 .cse2 .cse4 .cse15 .cse18 .cse6 .cse19 .cse16) (and .cse0 .cse8 .cse9 .cse11 .cse14 .cse1 .cse2 .cse20 .cse4 .cse15 .cse21 .cse18 .cse6 .cse7 .cse16) (and .cse0 .cse9 .cse17 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse15 .cse18 .cse6 .cse19) (and .cse9 (or (and .cse0 .cse8 .cse22 .cse11 .cse23 .cse12 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse22 .cse11 .cse13 .cse14 .cse1 .cse24 .cse2 .cse4 .cse21 .cse18 .cse6 .cse7)) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse6 .cse19) (and .cse0 .cse9 .cse17 .cse11 .cse14 .cse1 .cse2 .cse20 .cse4 .cse15 .cse21 .cse18 .cse6 .cse19 .cse16)))) [2021-10-13 07:41:43,096 INFO L853 garLoopResultBuilder]: At program point L249-3(lines 237 251) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-13 07:41:43,096 INFO L853 garLoopResultBuilder]: At program point L249-4(lines 237 251) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t3_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse3 (not (= ~E_M~0 0))) (.cse14 (= ~E_2~0 2)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse3 .cse14 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 4)) .cse15))) [2021-10-13 07:41:43,096 INFO L853 garLoopResultBuilder]: At program point L249-5(lines 237 251) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= 2 ~t3_st~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~E_1~0 2)) (.cse6 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6 .cse15) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse3 .cse4 .cse5 .cse6 .cse15) (and .cse0 .cse7 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 4)) .cse15) (and .cse0 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse1 .cse14 .cse2 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6 .cse15))) [2021-10-13 07:41:43,096 INFO L857 garLoopResultBuilder]: For program point L51(lines 51 55) no Hoare annotation was computed. [2021-10-13 07:41:43,096 INFO L853 garLoopResultBuilder]: At program point L249-6(lines 237 251) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,097 INFO L853 garLoopResultBuilder]: At program point L382(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse23 (= ~t2_pc~0 1)) (.cse36 (+ ~local~0 1))) (let ((.cse34 (<= ~token~0 .cse36)) (.cse35 (<= .cse36 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse30 (<= 2 ~t3_st~0)) (.cse33 (not .cse23)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse31 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse29 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse32 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse17 (let ((.cse28 (+ 2 ~local~0))) (let ((.cse26 (<= .cse28 ~token~0)) (.cse27 (<= ~token~0 .cse28))) (or (and .cse15 .cse26 .cse27 .cse22 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse14 .cse21) (and .cse15 .cse26 .cse27 .cse22 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)))) .cse18) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse29 .cse30 .cse3 .cse20 .cse24 .cse8 .cse31 .cse25 .cse13 .cse21) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse29 .cse3 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse34 .cse18 .cse2 .cse23 .cse4 .cse35 .cse6 .cse20 .cse8 .cse9 .cse25 .cse13 .cse21) (and .cse1 .cse29 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse33 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse22 .cse1 .cse2 .cse19 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse29 .cse3 .cse32 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse33 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse34 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse23 .cse4 .cse5 .cse35 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse22 .cse29 .cse3 .cse23 .cse32 .cse6 .cse24 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse29 .cse30 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse33 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse31 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse29 .cse3 .cse23 .cse32 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-13 07:41:43,097 INFO L853 garLoopResultBuilder]: At program point L52(lines 47 86) the Hoare annotation is: (and (= ~t1_pc~0 1) (= 2 ~t3_st~0) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~E_3~0 2) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2) (= ~t3_pc~0 1) (< ~token~0 (+ ~local~0 4))) [2021-10-13 07:41:43,097 INFO L857 garLoopResultBuilder]: For program point L385(lines 385 392) no Hoare annotation was computed. [2021-10-13 07:41:43,097 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 07:41:43,097 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,097 INFO L857 garLoopResultBuilder]: For program point L257-2(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,098 INFO L857 garLoopResultBuilder]: For program point L257-3(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,098 INFO L857 garLoopResultBuilder]: For program point L257-5(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,098 INFO L857 garLoopResultBuilder]: For program point L257-6(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,098 INFO L857 garLoopResultBuilder]: For program point L257-8(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,098 INFO L857 garLoopResultBuilder]: For program point L257-9(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,098 INFO L857 garLoopResultBuilder]: For program point L257-11(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L257-12(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L257-14(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L257-15(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L257-17(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L257-18(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L257-20(lines 257 266) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L258-2(lines 258 263) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L258-3(lines 258 263) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L258-4(lines 258 263) no Hoare annotation was computed. [2021-10-13 07:41:43,099 INFO L857 garLoopResultBuilder]: For program point L258-5(lines 258 263) no Hoare annotation was computed. [2021-10-13 07:41:43,100 INFO L857 garLoopResultBuilder]: For program point L258-6(lines 258 263) no Hoare annotation was computed. [2021-10-13 07:41:43,100 INFO L857 garLoopResultBuilder]: For program point L128(lines 128 136) no Hoare annotation was computed. [2021-10-13 07:41:43,100 INFO L853 garLoopResultBuilder]: At program point L131(lines 131 135) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse10 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse11 (= 2 ~t1_st~0)) (.cse12 (= ~E_3~0 2)) (.cse1 (< 0 ~t2_st~0)) (.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse15 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse9 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse6 .cse9) (and .cse0 .cse10 (not .cse9) .cse11 .cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse1 .cse13 .cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse15 .cse2 .cse4 .cse5 .cse6 .cse7) (let ((.cse16 (+ ~local~0 1))) (and .cse0 (= 2 ~t3_st~0) .cse10 (<= ~token~0 .cse16) .cse11 .cse12 .cse1 .cse13 .cse14 (<= .cse16 ~token~0) .cse15 .cse2 .cse4 .cse8 .cse6 .cse9)))) [2021-10-13 07:41:43,100 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 07:41:43,101 INFO L853 garLoopResultBuilder]: At program point L396(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse30 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse34 (+ ~local~0 1))) (let ((.cse28 (<= 2 ~t2_st~0)) (.cse31 (<= ~token~0 .cse34)) (.cse32 (<= .cse34 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse23 (= ~E_3~0 ~E_1~0)) (.cse26 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse19 (not (= ~E_3~0 1))) (.cse22 (not .cse15)) (.cse27 (<= 2 ~t3_st~0)) (.cse3 (= ~t1_st~0 0)) (.cse24 (= ~m_pc~0 0)) (.cse25 (not .cse30)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse29 (= 2 ~t2_st~0)) (.cse18 (= 2 ~t1_st~0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse22 .cse3 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse13 .cse14) (and .cse15 .cse1 .cse20 .cse24 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse22 .cse27 .cse3 .cse20 .cse24 .cse8 .cse28 .cse26 .cse13 .cse21) (and .cse16 .cse0 .cse29 .cse2 .cse3 .cse30 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse17 .cse29 .cse1 .cse18 .cse2 .cse19 .cse30 .cse4 .cse5 .cse6 .cse20 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse18 .cse2 .cse30 .cse6 .cse24 .cse8 .cse13 .cse21) (and .cse16 .cse22 .cse3 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse13 .cse21) (and .cse0 .cse29 .cse1 .cse2 .cse3 .cse30 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse31 .cse18 .cse2 .cse30 .cse4 .cse32 .cse6 .cse20 .cse8 .cse9 .cse26 .cse13 .cse21) (let ((.cse33 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse33 ~token~0) (<= ~token~0 .cse33) .cse29 .cse18 .cse2 .cse30 .cse4 .cse6 .cse20 .cse8 .cse26 .cse13 .cse14 .cse21)) (and .cse15 .cse29 .cse1 .cse2 .cse19 .cse30 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse1 .cse22 .cse3 .cse20 .cse24 .cse8 .cse28 .cse26 .cse13 .cse14) (and .cse29 .cse1 .cse22 .cse3 .cse30 .cse23 .cse6 .cse24 .cse8 .cse10 .cse11 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse29 .cse18 .cse2 .cse19 .cse30 .cse4 .cse6 .cse20 .cse8 .cse13 .cse21) (and .cse15 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse14) (and .cse15 .cse29 .cse1 .cse18 .cse2 .cse30 .cse6 .cse24 .cse8 .cse26 .cse13 .cse14) (and .cse15 .cse17 .cse1 .cse31 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse30 .cse4 .cse5 .cse32 .cse6 .cse20 .cse8 .cse9 .cse26 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse2 .cse30 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse1 .cse22 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse16 .cse29 .cse22 .cse3 .cse30 .cse23 .cse6 .cse24 .cse8 .cse10 .cse11 .cse26 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse29 .cse2 .cse19 .cse30 .cse4 .cse6 .cse20 .cse8 (not .cse3) .cse10 .cse11 .cse13 .cse21) (and .cse22 .cse27 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse25 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse29 .cse18 .cse2 .cse30 .cse4 .cse6 .cse8 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-13 07:41:43,101 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,101 INFO L857 garLoopResultBuilder]: For program point L200-2(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,101 INFO L857 garLoopResultBuilder]: For program point L200-3(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,102 INFO L857 garLoopResultBuilder]: For program point L200-5(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,102 INFO L857 garLoopResultBuilder]: For program point L200-6(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,102 INFO L857 garLoopResultBuilder]: For program point L200-8(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,102 INFO L857 garLoopResultBuilder]: For program point L200-9(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,102 INFO L857 garLoopResultBuilder]: For program point L200-11(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,102 INFO L857 garLoopResultBuilder]: For program point L200-12(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,102 INFO L857 garLoopResultBuilder]: For program point L200-14(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L200-15(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L200-17(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L200-18(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L200-20(lines 200 209) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L399(lines 399 406) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L201(lines 201 206) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L201-1(lines 201 206) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L201-2(lines 201 206) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L201-3(lines 201 206) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L201-4(lines 201 206) no Hoare annotation was computed. [2021-10-13 07:41:43,103 INFO L857 garLoopResultBuilder]: For program point L201-5(lines 201 206) no Hoare annotation was computed. [2021-10-13 07:41:43,104 INFO L857 garLoopResultBuilder]: For program point L201-6(lines 201 206) no Hoare annotation was computed. [2021-10-13 07:41:43,104 INFO L853 garLoopResultBuilder]: At program point L268(lines 256 270) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0) (= ~m_pc~0 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) (= 0 ~t3_st~0) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-13 07:41:43,104 INFO L853 garLoopResultBuilder]: At program point L268-1(lines 256 270) the Hoare annotation is: (let ((.cse14 (= ~t3_pc~0 1))) (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= ~t1_st~0 0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse16 (= ~t1_pc~0 1)) (.cse19 (= 2 ~t2_st~0)) (.cse17 (not .cse14)) (.cse2 (= ~E_3~0 2)) (.cse20 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse9 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse18 (= 0 ~t3_st~0)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse19 .cse17 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse15) (and .cse16 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse19 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse14 .cse15) (and .cse16 .cse19 .cse17 .cse2 .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse18 .cse15)))) [2021-10-13 07:41:43,104 INFO L853 garLoopResultBuilder]: At program point L268-2(lines 256 270) the Hoare annotation is: (let ((.cse25 (+ ~local~0 1)) (.cse14 (= ~t3_pc~0 1))) (let ((.cse16 (= 0 ~t2_pc~0)) (.cse24 (= ~m_pc~0 0)) (.cse3 (= 2 ~t2_st~0)) (.cse19 (not .cse14)) (.cse23 (= 0 ~t3_st~0)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse20 (<= ~token~0 .cse25)) (.cse4 (= ~E_3~0 2)) (.cse21 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse22 (<= .cse25 ~token~0)) (.cse8 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse17 (= 0 ~t2_st~0)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse11 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17 .cse18 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse19 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse11 .cse17 .cse18 .cse13 .cse23) (and .cse0 .cse7 .cse8 .cse9 .cse24 .cse10 .cse18 .cse13 .cse23) (and .cse0 .cse2 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse17 .cse18 .cse13 .cse23 .cse15) (and .cse0 .cse7 .cse8 .cse24 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse23 .cse15) (and .cse2 (or (and .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse17 .cse18 .cse13 .cse14) (and .cse0 .cse1 .cse20 .cse4 .cse21 .cse5 .cse6 .cse7 .cse22 .cse8 .cse9 .cse10 .cse17 .cse12 .cse13 .cse14)) .cse11)))) [2021-10-13 07:41:43,104 INFO L853 garLoopResultBuilder]: At program point L268-3(lines 256 270) the Hoare annotation is: (let ((.cse6 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse8 (= 0 ~t3_st~0)) (.cse4 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse18 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (= 2 ~t1_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse13 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse3 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse14 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse5 (= ~E_M~0 2)) (.cse15 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2)) (.cse16 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (let ((.cse17 (+ 2 ~local~0))) (let ((.cse9 (<= .cse17 ~token~0)) (.cse10 (<= ~token~0 .cse17))) (or (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse15 .cse7 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse16) (and .cse0 .cse9 .cse10 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse16)))) .cse18 .cse19) (and .cse0 .cse18 (not .cse16) .cse19 .cse11 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse15 .cse7 .cse16) (and .cse0 (= 2 ~t3_st~0) .cse18 .cse19 (not (= ~E_3~0 1)) .cse11 .cse12 .cse1 .cse13 .cse2 .cse3 .cse14 .cse5 .cse15 .cse7 .cse16))) [2021-10-13 07:41:43,105 INFO L853 garLoopResultBuilder]: At program point L268-4(lines 256 270) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t2_st~0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t3_st~0)) (.cse11 (= ~E_3~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse3 (not (= ~E_M~0 0))) (.cse14 (= ~E_2~0 2)) (.cse5 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse7 (= ~t3_pc~0 1)) (.cse15 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0) .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse8 (<= (+ 3 ~local~0) ~token~0) .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse3 .cse14 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 4)) .cse15))) [2021-10-13 07:41:43,105 INFO L853 garLoopResultBuilder]: At program point L268-5(lines 256 270) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,105 INFO L853 garLoopResultBuilder]: At program point L268-6(lines 256 270) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,105 INFO L853 garLoopResultBuilder]: At program point L139-1(lines 127 158) the Hoare annotation is: (let ((.cse17 (< 0 ~t2_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse27 (= 2 ~t3_st~0)) (.cse11 (not (= ~E_3~0 1))) (.cse12 (= ~m_pc~0 1)) (.cse2 (not (= ~m_st~0 0))) (.cse29 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse4 (= ~E_M~0 2)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse6 (= ~E_1~0 2)) (.cse25 (= ~t3_pc~0 1))) (let ((.cse28 (= ~m_st~0 2)) (.cse18 (= ~E_3~0 ~E_1~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= 2 ~t1_st~0)) (.cse30 (or (and .cse0 .cse27 .cse17 .cse11 .cse12 .cse2 .cse4 .cse24 .cse6 .cse25) (and .cse0 .cse27 .cse11 .cse12 .cse2 .cse29 .cse4 .cse24 .cse6 .cse25))) (.cse1 (not .cse25)) (.cse10 (= ~E_3~0 2)) (.cse13 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse14 (= ~E_2~0 2)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse5 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse7 (= 0 ~t3_st~0)) (.cse15 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse3 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse9 .cse10 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse15 .cse16 .cse17 .cse18 .cse14 .cse3 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse8 .cse9 (let ((.cse26 (+ 2 ~local~0))) (let ((.cse21 (<= .cse26 ~token~0)) (.cse22 (<= ~token~0 .cse26)) (.cse23 (= ~t2_pc~0 1))) (or (and .cse0 .cse21 .cse22 .cse10 .cse23 .cse12 .cse14 .cse2 .cse4 .cse24 .cse6 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 1) .cse7 .cse25) (and .cse0 .cse21 .cse22 .cse10 .cse23 .cse12 .cse14 .cse2 .cse4 .cse5 .cse6 .cse7 .cse25))))) (and .cse27 .cse28 .cse10 .cse16 .cse17 .cse12 .cse13 .cse14 .cse4 .cse19 .cse20 .cse24 .cse6 .cse25) (and .cse9 .cse10 .cse14 (or (and .cse0 .cse27 .cse29 .cse3 .cse4 .cse24 .cse6 .cse25) (and .cse0 .cse27 .cse17 .cse3 .cse4 .cse24 .cse6 .cse25))) (and .cse10 .cse14 .cse19 .cse20 .cse30) (and .cse28 .cse1 .cse10 .cse16 .cse17 .cse12 .cse13 .cse14 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse27 .cse15 .cse16 .cse17 .cse18 .cse14 .cse3 .cse4 .cse19 .cse20 .cse24 .cse6 .cse25) (and .cse8 .cse9 .cse10 .cse14 .cse30) (and .cse0 .cse2 .cse3 .cse4 .cse24 .cse6 .cse25) (and .cse1 .cse15 .cse16 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse4 .cse19 .cse20 .cse5 .cse6 .cse7) (and .cse15 (<= 2 ~t3_st~0) .cse16 .cse17 .cse2 .cse3 .cse4 .cse24 .cse6 .cse25)))) [2021-10-13 07:41:43,105 INFO L853 garLoopResultBuilder]: At program point L73(lines 47 86) the Hoare annotation is: (let ((.cse11 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse2 (= 2 ~t2_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= ~t2_pc~0 1)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (= 2 ~t3_st~0)) (.cse13 (not .cse0)) (.cse14 (= ~t1_st~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse12 (not .cse11)) (.cse3 (= 2 ~t1_st~0)) (.cse15 (= ~E_3~0 ~E_1~0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse16 (= ~m_pc~0 0)) (.cse21 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse22 (= 0 ~t2_st~0)) (.cse19 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse10 (= ~E_1~0 2)) (.cse20 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4))) (and .cse2 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse17 .cse18 .cse19 .cse10 .cse20) (and .cse0 .cse1 .cse3 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse19 .cse10 .cse11) (and .cse1 .cse2 .cse13 .cse14 .cse5 .cse15 .cse6 .cse7 .cse16 .cse8 .cse17 .cse18 .cse19 .cse10 .cse11) (and .cse0 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse19 .cse10 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse17 .cse18 .cse19 .cse10 .cse11) (and .cse12 .cse13 .cse14 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse17 .cse18 .cse19 .cse10 .cse20) (and .cse0 .cse12 .cse3 .cse15 .cse6 .cse7 .cse16 .cse21 .cse8 .cse22 .cse19 .cse10 .cse20)))) [2021-10-13 07:41:43,106 INFO L853 garLoopResultBuilder]: At program point L670-1(lines 465 707) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse17 (= ~t1_st~0 0)) (.cse18 (<= ~token~0 ~local~0)) (.cse19 (<= ~local~0 ~token~0)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse2 (not .cse12) (not .cse0) .cse17 (= ~E_3~0 ~E_1~0) .cse8 .cse9 .cse16 (= 0 ~t2_pc~0) .cse10 (= 0 ~t2_st~0) .cse18 .cse19 .cse11 (= 0 ~t3_st~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not .cse17) .cse18 .cse19 .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,106 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 07:41:43,106 INFO L853 garLoopResultBuilder]: At program point L211(lines 199 213) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 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) (= 0 ~t3_st~0)) [2021-10-13 07:41:43,106 INFO L853 garLoopResultBuilder]: At program point L211-1(lines 199 213) the Hoare annotation is: (let ((.cse17 (= ~t3_pc~0 1)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse15 (= 2 ~t3_st~0)) (.cse0 (= 2 ~t2_st~0)) (.cse2 (not .cse14)) (.cse4 (= ~t1_st~0 0)) (.cse5 (= ~t2_pc~0 1)) (.cse1 (not .cse17)) (.cse16 (= 2 ~t1_st~0)) (.cse3 (= ~E_3~0 2)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse8 (not (= ~m_st~0 0))) (.cse18 (= 0 ~t2_pc~0)) (.cse9 (= ~E_M~0 2)) (.cse19 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse15 .cse16 .cse3 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse0 .cse1 .cse16 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17) (and .cse14 .cse1 .cse16 .cse3 .cse6 .cse7 .cse8 .cse18 .cse9 .cse19 .cse10 .cse11 .cse12 .cse13)))) [2021-10-13 07:41:43,106 INFO L853 garLoopResultBuilder]: At program point L211-2(lines 199 213) the Hoare annotation is: (let ((.cse21 (+ ~local~0 1)) (.cse19 (= ~t3_pc~0 1))) (let ((.cse2 (not .cse19)) (.cse1 (= 2 ~t2_st~0)) (.cse3 (<= ~token~0 .cse21)) (.cse5 (= ~t2_pc~0 1)) (.cse8 (<= .cse21 ~token~0)) (.cse18 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse14 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (= 2 ~t3_st~0)) (.cse4 (= ~E_3~0 2)) (.cse6 (= ~m_pc~0 1)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse15 (= 0 ~t2_pc~0)) (.cse10 (= ~E_M~0 2)) (.cse11 (not (= ~t1_st~0 0))) (.cse16 (= 0 ~t2_st~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse16 .cse12 .cse13 .cse14) (and .cse0 .cse7 .cse9 .cse17 .cse10 .cse18 .cse13 .cse19) (and .cse0 .cse20 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse13 .cse19) (and .cse0 .cse7 .cse9 .cse17 .cse10 .cse12 .cse13 .cse14) (and .cse0 .cse20 .cse4 .cse6 .cse7 .cse9 .cse15 .cse10 .cse11 .cse16 .cse12 .cse13 .cse19)))) [2021-10-13 07:41:43,106 INFO L853 garLoopResultBuilder]: At program point L211-3(lines 199 213) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-13 07:41:43,106 INFO L853 garLoopResultBuilder]: At program point L211-4(lines 199 213) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t3_st~0)) (.cse7 (= ~m_pc~0 1)) (.cse9 (not (= ~E_M~0 0))) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~t3_pc~0 1)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse10 (= ~E_2~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse8 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse13 .cse14) (and .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 (or (and .cse0 .cse4 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse7 .cse9 .cse12 .cse13 .cse14 (= ~E_M~0 1))) .cse3 .cse5 .cse6 .cse10 (< ~token~0 (+ ~local~0 4))))) [2021-10-13 07:41:43,107 INFO L853 garLoopResultBuilder]: At program point L211-5(lines 199 213) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse7 (= 2 ~t3_st~0)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= 2 ~t2_st~0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (= ~E_3~0 2)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~m_pc~0 1)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse12 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse4 (= ~E_M~0 2)) (.cse5 (= ~E_1~0 2)) (.cse6 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse10 .cse11 .cse13 .cse1 .cse12 .cse2 .cse4 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse5 .cse6) (and .cse0 .cse7 .cse14 (<= (+ 3 ~local~0) ~token~0) .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse13 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6))) [2021-10-13 07:41:43,107 INFO L853 garLoopResultBuilder]: At program point L211-6(lines 199 213) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,107 INFO L853 garLoopResultBuilder]: At program point L411(lines 338 416) the Hoare annotation is: (let ((.cse7 (= ~m_pc~0 0)) (.cse13 (not (= ~E_3~0 1))) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (= ~E_3~0 2)) (.cse5 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse6 (= ~E_2~0 2)) (.cse8 (= ~E_M~0 2)) (.cse9 (= ~E_1~0 2)) (.cse10 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse13 .cse5 .cse14 .cse6 .cse11 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse5 .cse14 .cse6 .cse11 .cse8 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse9 .cse10) (and .cse0 .cse1 .cse12 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse8 .cse9 .cse10 (< ~token~0 (+ ~local~0 4))))) [2021-10-13 07:41:43,107 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2021-10-13 07:41:43,107 INFO L857 garLoopResultBuilder]: For program point L349-1(lines 344 410) no Hoare annotation was computed. [2021-10-13 07:41:43,108 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-13 07:41:43,108 INFO L857 garLoopResultBuilder]: For program point L219(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,108 INFO L857 garLoopResultBuilder]: For program point L219-2(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,108 INFO L857 garLoopResultBuilder]: For program point L219-3(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,108 INFO L857 garLoopResultBuilder]: For program point L219-5(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,108 INFO L857 garLoopResultBuilder]: For program point L219-6(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,109 INFO L857 garLoopResultBuilder]: For program point L219-8(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,109 INFO L857 garLoopResultBuilder]: For program point L219-9(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,109 INFO L857 garLoopResultBuilder]: For program point L219-11(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,109 INFO L857 garLoopResultBuilder]: For program point L219-12(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,109 INFO L857 garLoopResultBuilder]: For program point L219-14(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,109 INFO L857 garLoopResultBuilder]: For program point L219-15(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,110 INFO L857 garLoopResultBuilder]: For program point L219-17(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,110 INFO L857 garLoopResultBuilder]: For program point L219-18(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,110 INFO L857 garLoopResultBuilder]: For program point L219-20(lines 219 228) no Hoare annotation was computed. [2021-10-13 07:41:43,110 INFO L857 garLoopResultBuilder]: For program point L220(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:41:43,110 INFO L857 garLoopResultBuilder]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:41:43,110 INFO L857 garLoopResultBuilder]: For program point L220-2(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:41:43,111 INFO L857 garLoopResultBuilder]: For program point L220-3(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:41:43,111 INFO L857 garLoopResultBuilder]: For program point L220-4(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:41:43,111 INFO L857 garLoopResultBuilder]: For program point L220-5(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:41:43,111 INFO L857 garLoopResultBuilder]: For program point L220-6(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:41:43,112 INFO L853 garLoopResultBuilder]: At program point L354(lines 344 410) the Hoare annotation is: (let ((.cse21 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1)) (.cse33 (+ ~local~0 1))) (let ((.cse29 (<= ~token~0 .cse33)) (.cse30 (<= .cse33 ~token~0)) (.cse0 (= ~m_st~0 2)) (.cse28 (<= 2 ~t3_st~0)) (.cse16 (= 2 ~t3_st~0)) (.cse17 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse18 (= 2 ~t1_st~0)) (.cse19 (not (= ~E_3~0 1))) (.cse25 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse32 (<= 2 ~t2_st~0)) (.cse22 (= 2 ~t2_st~0)) (.cse26 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse23 (= ~t2_pc~0 1)) (.cse27 (= ~E_3~0 ~E_1~0)) (.cse24 (= ~m_pc~0 0)) (.cse1 (not .cse21)) (.cse2 (= ~E_3~0 2)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse20 (not (= ~m_st~0 0))) (.cse7 (= 0 ~t2_pc~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse16 .cse17 .cse18 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse22 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse2 .cse19 .cse4 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse20 .cse24 .cse8 .cse12 .cse13 .cse14) (and .cse1 .cse26 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse18 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse26 .cse28 .cse3 .cse20 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse16 .cse22 .cse26 .cse3 .cse23 .cse27 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse1 .cse26 .cse3 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse17 .cse22 .cse1 .cse18 .cse2 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14) (and .cse16 .cse26 .cse3 .cse27 .cse6 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 (<= (+ 3 ~local~0) ~token~0) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse8 .cse25 .cse13 .cse21 (< ~token~0 (+ ~local~0 4))) (and .cse15 .cse16 .cse22 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse10 .cse11 .cse25 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse29 .cse18 .cse2 .cse23 .cse4 .cse30 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse18 .cse2 .cse6 .cse24 .cse7 .cse8 .cse9 .cse12 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse29 .cse18 .cse2 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse23 .cse4 .cse5 .cse30 .cse6 .cse20 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse15 .cse22 .cse1 .cse18 .cse2 .cse23 .cse6 .cse24 .cse8 .cse12 .cse13 .cse14) (let ((.cse31 (+ 2 ~local~0))) (and .cse15 .cse17 (<= .cse31 ~token~0) (<= ~token~0 .cse31) .cse22 .cse18 .cse2 .cse23 .cse4 .cse6 .cse20 .cse8 .cse12 .cse13 .cse14 .cse21)) (and .cse15 .cse22 .cse1 .cse2 .cse23 .cse4 .cse5 .cse6 .cse20 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse20 .cse24 .cse8 .cse25 .cse13 .cse21) (and .cse15 .cse17 .cse1 .cse18 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse12 .cse13 .cse14) (and .cse16 .cse0 .cse22 .cse2 .cse3 .cse23 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse21) (and .cse26 .cse28 .cse3 .cse20 .cse24 .cse8 .cse32 .cse12 .cse13 .cse21) (and .cse15 .cse16 .cse17 .cse22 .cse18 .cse2 .cse19 .cse23 .cse4 .cse6 .cse20 .cse8 .cse25 .cse13 .cse21) (and .cse1 .cse3 .cse20 .cse24 .cse8 .cse32 .cse12 .cse13 .cse14) (and .cse22 .cse1 .cse26 .cse3 .cse23 .cse27 .cse6 .cse24 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse1 .cse2 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-13 07:41:43,112 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 100) no Hoare annotation was computed. [2021-10-13 07:41:43,112 INFO L857 garLoopResultBuilder]: For program point L357(lines 357 364) no Hoare annotation was computed. [2021-10-13 07:41:43,112 INFO L853 garLoopResultBuilder]: At program point L689(lines 689 698) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,113 INFO L853 garLoopResultBuilder]: At program point L689-1(lines 689 698) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,113 INFO L853 garLoopResultBuilder]: At program point L95(lines 95 99) the Hoare annotation is: (let ((.cse20 (= ~t3_pc~0 1)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse26 (<= 2 ~t2_st~0)) (.cse22 (= ~E_3~0 ~E_1~0)) (.cse21 (not .cse15)) (.cse25 (<= 2 ~t3_st~0)) (.cse19 (= 2 ~t3_st~0)) (.cse0 (= ~m_st~0 2)) (.cse17 (= 0 ~t2_pc~0)) (.cse18 (= 0 ~t2_st~0)) (.cse23 (= ~m_pc~0 0)) (.cse24 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse1 (= 2 ~t2_st~0)) (.cse2 (not .cse20)) (.cse3 (= ~E_3~0 2)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse16 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse14) (and .cse15 .cse19 .cse3 .cse5 .cse7 .cse16 .cse17 .cse8 .cse9 .cse18 .cse12 .cse13 .cse20) (and .cse19 .cse21 .cse22 .cse7 .cse23 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse23 .cse8 .cse12 .cse13 .cse14) (and .cse15 .cse19 .cse1 .cse3 .cse4 .cse5 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse2 .cse21 .cse16 .cse23 .cse17 .cse8 .cse18 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse21 .cse4 .cse22 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse21 .cse22 .cse7 .cse23 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse21 .cse25 .cse16 .cse23 .cse8 .cse26 .cse24 .cse13 .cse20) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse2 .cse21 .cse16 .cse23 .cse8 .cse26 .cse12 .cse13 .cse14) (and .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse19 .cse1 .cse21 .cse4 .cse22 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse20) (and .cse21 .cse25 .cse16 .cse23 .cse17 .cse8 .cse18 .cse12 .cse13 .cse20) (and .cse19 .cse0 .cse3 .cse5 .cse6 .cse7 .cse17 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse23 .cse8 .cse24 .cse13 .cse20) (and .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-10-13 07:41:43,113 INFO L853 garLoopResultBuilder]: At program point L230(lines 218 232) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t3_pc~0) (= ~E_3~0 ~E_1~0) (= ~E_2~0 2) (= ~m_pc~0 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) (= 0 ~t3_st~0)) [2021-10-13 07:41:43,114 INFO L853 garLoopResultBuilder]: At program point L230-1(lines 218 232) the Hoare annotation is: (let ((.cse15 (= ~t1_pc~0 1)) (.cse14 (= ~t3_pc~0 1))) (let ((.cse19 (not .cse14)) (.cse17 (= 2 ~t1_st~0)) (.cse8 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse20 (= 0 ~t3_st~0)) (.cse0 (= 2 ~t3_st~0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 2 ~t2_st~0)) (.cse2 (not .cse15)) (.cse3 (= ~E_3~0 2)) (.cse4 (= ~t1_st~0 0)) (.cse18 (= ~t2_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse9 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ULTIMATE.start_eval_~tmp~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse0 .cse16 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)) .cse14) (and .cse15 .cse0 .cse17 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse16 .cse19 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse16 .cse19 .cse17 .cse3 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse20) (and .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse15 .cse19 .cse17 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14)))) [2021-10-13 07:41:43,114 INFO L853 garLoopResultBuilder]: At program point L230-2(lines 218 232) the Hoare annotation is: (let ((.cse22 (+ ~local~0 1)) (.cse13 (= ~t3_pc~0 1))) (let ((.cse7 (= 0 ~t2_pc~0)) (.cse10 (= 0 ~t2_st~0)) (.cse14 (not .cse13)) (.cse20 (= ~m_pc~0 0)) (.cse11 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse15 (= 0 ~t3_st~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse16 (= 2 ~t2_st~0)) (.cse17 (<= ~token~0 .cse22)) (.cse3 (= ~E_3~0 2)) (.cse18 (= ~t2_pc~0 1)) (.cse4 (= ~m_pc~0 1)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse19 (<= .cse22 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ~t1_st~0 0))) (.cse21 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15) (and .cse0 .cse2 .cse16 .cse14 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse11 .cse12 .cse15) (and .cse0 .cse5 .cse6 .cse20 .cse8 .cse21 .cse12 .cse13) (and .cse0 .cse5 .cse6 .cse20 .cse8 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse17 .cse3 .cse18 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse21 .cse12 .cse13)))) [2021-10-13 07:41:43,114 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 172) no Hoare annotation was computed. [2021-10-13 07:41:43,114 INFO L853 garLoopResultBuilder]: At program point L230-3(lines 218 232) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~t2_pc~0 1)) (.cse6 (= ~m_pc~0 1)) (.cse8 (= ~E_2~0 2)) (.cse10 (or (not (= ~E_3~0 0)) (= ~E_2~0 0))) (.cse16 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse2 (= ~t3_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse4 (< 0 ~t2_st~0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (not (= ~m_st~0 0))) (.cse17 (= ~m_pc~0 0)) (.cse11 (= ~E_M~0 2)) (.cse12 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse13 (= ~E_1~0 2)) (.cse14 (= 0 ~t3_st~0))) (or (and .cse0 .cse1 (not .cse2) .cse3 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (let ((.cse15 (+ 2 ~local~0))) (and .cse0 (= 2 ~t3_st~0) .cse1 (<= .cse15 ~token~0) (<= ~token~0 .cse15) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse16 .cse13 .cse2)) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse16 .cse13 .cse2) (and .cse0 .cse4 .cse7 .cse9 .cse17 .cse11 .cse12 .cse13 .cse14))) [2021-10-13 07:41:43,115 INFO L853 garLoopResultBuilder]: At program point L230-4(lines 218 232) the Hoare annotation is: (let ((.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse4 (< 0 ~t3_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse9 (not (= ~E_M~0 0))) (.cse10 (= ~E_2~0 2)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse13 (= ~E_1~0 2)) (.cse14 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse8 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse13 .cse14) (and .cse0 .cse1 (<= (+ 3 ~local~0) ~token~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13 .cse14 (< ~token~0 (+ ~local~0 4))))) [2021-10-13 07:41:43,115 INFO L853 garLoopResultBuilder]: At program point L230-5(lines 218 232) the Hoare annotation is: (let ((.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse4 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (= ~E_2~0 2)) (.cse13 (not (= ~m_st~0 0))) (.cse9 (= ~E_M~0 2)) (.cse10 (= ~E_1~0 2)) (.cse11 (= ~t3_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse14 .cse12 .cse7 .cse13 .cse9 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 4))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse12 .cse7 .cse13 .cse9 .cse10 .cse11))) [2021-10-13 07:41:43,115 INFO L853 garLoopResultBuilder]: At program point L230-6(lines 218 232) the Hoare annotation is: (let ((.cse4 (= 2 ~t1_st~0)) (.cse16 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t3_st~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (= 2 ~t2_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse7 (= ~m_pc~0 1)) (.cse14 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse9 (= ULTIMATE.start_is_transmit3_triggered_~__retres1~3 0)) (.cse10 (= ~E_M~0 2)) (.cse11 (= ~E_1~0 2)) (.cse12 (= ~t3_pc~0 1)) (.cse13 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 (<= (+ 3 ~local~0) ~token~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 4)) .cse13) (and .cse0 .cse14 .cse15 .cse16 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse16 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9 .cse10 (not (= ~t1_st~0 0)) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse11 .cse12 .cse13))) [2021-10-13 07:41:43,116 INFO L853 garLoopResultBuilder]: At program point L167(lines 167 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse28 (= ~t3_pc~0 1))) (let ((.cse12 (= ~m_st~0 2)) (.cse22 (= ~E_3~0 ~E_1~0)) (.cse24 (not (= ~E_3~0 1))) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse15 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 2 ~t2_st~0)) (.cse3 (= 2 ~t1_st~0)) (.cse5 (= ~E_3~0 2)) (.cse6 (= ~t2_pc~0 1)) (.cse14 (= ~m_pc~0 1)) (.cse7 (= ~E_2~0 2)) (.cse2 (not .cse28)) (.cse21 (not .cse0)) (.cse13 (= ~t1_st~0 0)) (.cse18 (= 0 ~t2_pc~0)) (.cse19 (= 0 ~t2_st~0)) (.cse20 (= ULTIMATE.start_eval_~tmp~0 1)) (.cse4 (< 0 ~t3_st~0)) (.cse25 (not (= ~m_st~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse10 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse11 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse1 .cse2 .cse4 .cse5 .cse13 .cse6 .cse14 .cse15 .cse7 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse12 .cse2 .cse4 .cse5 .cse13 .cse14 .cse15 .cse7 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse1 .cse2 .cse21 .cse4 .cse13 .cse6 .cse22 .cse7 .cse8 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse22 .cse7 .cse8 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse14 .cse15 .cse7 .cse25 .cse9 .cse10 .cse11) (and .cse0 .cse23 .cse2 .cse3 .cse4 .cse5 .cse14 .cse15 .cse7 .cse25 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse2 .cse21 .cse4 .cse13 .cse22 .cse7 .cse8 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse24 .cse6 .cse14 .cse15 .cse7 .cse25 .cse9 .cse16 .cse17 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse14 .cse15 .cse7 .cse25 .cse18 .cse9 .cse19 .cse16 .cse17 .cse20 .cse11) (and .cse2 .cse21 .cse4 .cse13 .cse25 .cse8 .cse9 (<= 2 ~t2_st~0) .cse10 .cse11) (let ((.cse26 (+ ~local~0 1))) (and .cse0 .cse23 .cse2 (<= ~token~0 .cse26) .cse3 .cse4 .cse5 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 1) .cse6 .cse14 .cse15 (<= .cse26 ~token~0) .cse7 .cse25 .cse9 .cse19 .cse10 .cse11)) (let ((.cse27 (+ 2 ~local~0))) (and .cse0 .cse23 (<= .cse27 ~token~0) (<= ~token~0 .cse27) .cse1 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse9 .cse10 .cse11 .cse28)) (and .cse2 .cse21 .cse4 .cse13 .cse25 .cse8 .cse18 .cse9 .cse19 .cse20 .cse11) (and .cse0 .cse4 .cse25 .cse8 .cse9 .cse10 .cse11)))) [2021-10-13 07:41:43,121 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:41:43,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:41:43 BoogieIcfgContainer [2021-10-13 07:41:43,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:41:43,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:41:43,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:41:43,338 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:41:43,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:39:54" (3/4) ... [2021-10-13 07:41:43,343 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 07:41:43,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 140 nodes and edges [2021-10-13 07:41:43,388 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-10-13 07:41:43,392 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 07:41:43,395 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:41:43,651 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:41:43,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:41:43,653 INFO L168 Benchmark]: Toolchain (without parser) took 112414.89 ms. Allocated memory was 151.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 114.0 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 591.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:41:43,654 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 151.0 MB. Free memory is still 131.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:41:43,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.64 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 125.1 MB in the end (delta: -11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:41:43,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.91 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 121.4 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:41:43,656 INFO L168 Benchmark]: Boogie Preprocessor took 71.79 ms. Allocated memory is still 151.0 MB. Free memory was 121.4 MB in the beginning and 118.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:41:43,657 INFO L168 Benchmark]: RCFGBuilder took 2308.86 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 73.6 MB in the end (delta: 44.5 MB). Peak memory consumption was 67.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:41:43,657 INFO L168 Benchmark]: TraceAbstraction took 109181.68 ms. Allocated memory was 151.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 73.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.1 GB. [2021-10-13 07:41:43,658 INFO L168 Benchmark]: Witness Printer took 314.48 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:41:43,660 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.29 ms. Allocated memory is still 151.0 MB. Free memory is still 131.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 421.64 ms. Allocated memory is still 151.0 MB. Free memory was 113.7 MB in the beginning and 125.1 MB in the end (delta: -11.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 103.91 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 121.4 MB in the end (delta: 3.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.79 ms. Allocated memory is still 151.0 MB. Free memory was 121.4 MB in the beginning and 118.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2308.86 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 73.6 MB in the end (delta: 44.5 MB). Peak memory consumption was 67.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 109181.68 ms. Allocated memory was 151.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 73.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 16.1 GB. * Witness Printer took 314.48 ms. Allocated memory is still 2.6 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 29.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: 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 1 procedures, 145 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 108861.2ms, OverallIterations: 31, TraceHistogramMax: 4, EmptinessCheckTime: 283.6ms, AutomataDifference: 17437.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 65676.0ms, InitialAbstractionConstructionTime: 20.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7575 SDtfs, 10257 SDslu, 11528 SDs, 0 SdLazy, 2003 SolverSat, 475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1989.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1725 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 1494.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10124occurred in iteration=10, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 10656.0ms AutomataMinimizationTime, 31 MinimizatonAttempts, 33745 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 1402 NumberOfFragments, 16803 HoareAnnotationTreeSize, 46 FomulaSimplifications, 8469378 FormulaSimplificationTreeSizeReduction, 19754.1ms HoareSimplificationTime, 46 FomulaSimplificationsInter, 637506 FormulaSimplificationTreeSizeReductionInter, 45854.5ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 369.6ms SsaConstructionTime, 1261.9ms SatisfiabilityAnalysisTime, 7763.0ms InterpolantComputationTime, 3230 NumberOfCodeBlocks, 3230 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4008 ConstructedInterpolants, 0 QuantifiedInterpolants, 9477 SizeOfPredicates, 40 NumberOfNonLiveVariables, 3923 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 51 InterpolantComputations, 40 PerfectInterpolantSequences, 959/989 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 1 specifications checked. All of them hold - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((m_pc == t1_pc && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((__retres1 == 0 && 2 == t1_st) && ((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && 2 == t1_st) && ((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && 0 == t3_st) && t3_pc == 1) || ((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)))) || (((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((2 == t1_st && E_3 == 2) && E_2 == 2) && ((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((E_3 == 2 && E_2 == 2) && token <= local) && local <= token) && ((((((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((t1_pc == 1 && 2 == t3_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || (((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((__retres1 == 0 && 2 == t1_st) && E_3 == 2) && E_2 == 2) && ((((((((((t1_pc == 1 && 2 == t3_st) && 0 < t2_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((t1_pc == 1 && 2 == t3_st) && !(E_3 == 1)) && m_pc == 1) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)))) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((2 == t2_st && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && (((((((((((((2 == t3_st && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((2 == t3_st && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0))) || (((((((((((2 == t3_st && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t3_pc == 1) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((!(t3_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((__retres1 == 0 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((__retres1 == 0 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((2 <= t3_st && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((!(t3_pc == 1) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((2 <= t3_st && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((2 == t3_st && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 655]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((t1_pc == 1 && 0 < t2_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) && __retres1 == 0) && 2 == t1_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 465]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 1) && 0 == t3_st) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1))) && 2 == t1_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 167]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 0 < t3_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || ((((((t1_pc == 1 && 0 < t3_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t1_pc == 1) && 2 <= t3_st) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((!(t3_pc == 1) && !(t1_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) || (((((((!(t1_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && 0 < t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((((m_st == 2 && 2 == t2_st) && 0 < t3_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && token < local + 4) && __retres1 == 0)) || ((((((((((((t1_pc == 1 && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((!(t1_pc == 1) && 0 < t3_st) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || (((((((((((((m_st == 2 && 0 < t3_st) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && m_pc == t1_pc) && t1_st == 0) && m_pc == t3_pc) && E_3 == E_1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && 0 == t3_st) && __retres1 == 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || (((((((t1_pc == 1 && !(t3_pc == 1)) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || ((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && 0 == t3_st)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((m_st == 2 && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && E_3 == 2) && !(E_3 == 1)) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && E_2 == 2) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && 2 == t1_st) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && E_3 == 2) && t1_st == 0) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((m_st == 2 && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((t1_pc == 1 && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((2 == t3_st && m_st == 2) && 2 == t2_st) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || (((((((((!(t1_pc == 1) && 2 <= t3_st) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((!(t3_pc == 1) && t1_st == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || ((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && !(E_3 == 1)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0))) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && 0 < t3_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || ((((((((t1_pc == 1 && 0 < t3_st) && __retres1 == 0) && !(E_M == 0)) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((__retres1 == 0 && 3 + local <= token) && 2 == t2_st) && ((((((((t1_pc == 1 && 0 < t3_st) && m_pc == 1) && !(E_M == 0)) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) || (((((((t1_pc == 1 && 0 < t3_st) && m_pc == 1) && !(E_M == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && E_M == 1))) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && token < local + 4) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4) && __retres1 == 0) || ((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && __retres1 == 0) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == t3_st && __retres1 == 0) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1)) || ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((__retres1 == 0 && !(t3_pc == 1)) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || (((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && 0 == t3_st)) || ((((((((((((((2 == t3_st && __retres1 == 0) && 2 == t2_st) && !(t1_pc == 1)) && E_3 == 2) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && t3_pc == 1) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1) || ((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t1_st == 0)) && token <= local) && local <= token) && E_1 == 2) && t3_pc == 1)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && E_M == 2) && E_1 == 2) && t3_pc == 1) && token < local + 4)) || (((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && t3_pc == 1) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4) || ((((((((((((((2 == t2_st && !(t3_pc == 1)) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((t1_pc == 1 && 2 == t2_st) && !(t3_pc == 1)) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && 2 == t3_st) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((2 == t3_st && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && t3_pc == 1)) || ((((((((((((((!(t3_pc == 1) && !(t1_pc == 1)) && t1_st == 0) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((((((t1_pc == 1 && !(t3_pc == 1)) && 2 == t1_st) && E_3 == E_1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && 0 == t2_pc) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 3 + local <= token) && 2 == t2_st) && 2 == t1_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && token < local + 4 - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && 2 == t1_st) && __retres1 == 1) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) || ((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 + local <= token) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && (!(E_3 == 0) || E_2 == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || ((((((((t1_pc == 1 && 0 < t2_st) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st) - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && 2 == t2_st) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1) && __retres1 == 0) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && __retres1 == 0) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) && __retres1 == 0)) || (((((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || ((((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && m_pc == 0) && E_M == 2) && tmp == 1) && E_1 == 2) && 0 == t3_st)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && !(t3_pc == 1)) && E_3 == 2) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && 0 == t2_pc) && E_M == 2) && !(t1_st == 0)) && 0 == t2_st) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || (((((((t1_pc == 1 && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1)) || (((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && !(t3_pc == 1)) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && !(t1_st == 0)) && tmp == 1) && E_1 == 2) && 0 == t3_st) && __retres1 == 0)) || ((__retres1 == 0 && (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && 0 == t2_st) && tmp == 1) && E_1 == 2) && t3_pc == 1) || (((((((((((((((t1_pc == 1 && 2 == t3_st) && token <= local + 1) && E_3 == 2) && __retres1 == 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && __retres1 == 0) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) && t3_pc == 1))) && !(t1_st == 0)) RESULT: Ultimate proved your program to be correct! [2021-10-13 07:41:43,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bba3a167-58a8-4dcf-be26-d668f48d5def/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...