./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG --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 949942bcd30c11cd050737185c4313ee1459089f9da346d697b721e3407e41e2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 05:41:29,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:41:29,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:41:29,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:41:29,830 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:41:29,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:41:29,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:41:29,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:41:29,845 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:41:29,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:41:29,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:41:29,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:41:29,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:41:29,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:41:29,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:41:29,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:41:29,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:41:29,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:41:29,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:41:29,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:41:29,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:41:29,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:41:29,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:41:29,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:41:29,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:41:29,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:41:29,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:41:29,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:41:29,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:41:29,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:41:29,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:41:29,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:41:29,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:41:29,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:41:29,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:41:29,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:41:29,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:41:29,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:41:29,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:41:29,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:41:29,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:41:29,910 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:41:29,964 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:41:29,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:41:29,967 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:41:29,967 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:41:29,967 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:41:29,968 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:41:29,968 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:41:29,968 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:41:29,975 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:41:29,975 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:41:29,976 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:41:29,977 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:41:29,977 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:41:29,977 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:41:29,977 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:41:29,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:41:29,978 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:41:29,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:41:29,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:41:29,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:41:29,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:41:29,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:41:29,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:41:29,980 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:41:29,980 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:41:29,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:41:29,981 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:41:29,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:41:29,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:41:29,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:41:29,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:41:29,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:41:29,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:41:29,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:41:29,985 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:41:29,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:41:29,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:41:29,986 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:41:29,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:41:29,987 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_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/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_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG 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 -> 949942bcd30c11cd050737185c4313ee1459089f9da346d697b721e3407e41e2 [2021-10-29 05:41:30,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:41:30,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:41:30,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:41:30,292 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:41:30,296 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:41:30,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-29 05:41:30,390 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/data/95e1167c9/18c6034bd0694dd59712201b44a0b830/FLAG41ef707a4 [2021-10-29 05:41:30,919 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:41:30,920 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/sv-benchmarks/c/systemc/token_ring.02.cil-1.c [2021-10-29 05:41:30,932 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/data/95e1167c9/18c6034bd0694dd59712201b44a0b830/FLAG41ef707a4 [2021-10-29 05:41:31,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/data/95e1167c9/18c6034bd0694dd59712201b44a0b830 [2021-10-29 05:41:31,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:41:31,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:41:31,281 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:41:31,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:41:31,284 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:41:31,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19fb5e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31, skipping insertion in model container [2021-10-29 05:41:31,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,293 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:41:31,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:41:31,497 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_e25c0d6e-b8c4-4476-a99a-edb7b2414027/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-29 05:41:31,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:41:31,576 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:41:31,587 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_e25c0d6e-b8c4-4476-a99a-edb7b2414027/sv-benchmarks/c/systemc/token_ring.02.cil-1.c[366,379] [2021-10-29 05:41:31,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:41:31,637 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:41:31,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31 WrapperNode [2021-10-29 05:41:31,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:41:31,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:41:31,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:41:31,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:41:31,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:41:31,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:41:31,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:41:31,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:41:31,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:41:31,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:41:31,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:41:31,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:41:31,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (1/1) ... [2021-10-29 05:41:31,781 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:41:31,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:41:31,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:41:31,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:41:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:41:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:41:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:41:31,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:41:33,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:41:33,481 INFO L299 CfgBuilder]: Removed 103 assume(true) statements. [2021-10-29 05:41:33,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:41:33 BoogieIcfgContainer [2021-10-29 05:41:33,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:41:33,487 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:41:33,487 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:41:33,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:41:33,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:41:31" (1/3) ... [2021-10-29 05:41:33,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e48e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:41:33, skipping insertion in model container [2021-10-29 05:41:33,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:41:31" (2/3) ... [2021-10-29 05:41:33,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e48e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:41:33, skipping insertion in model container [2021-10-29 05:41:33,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:41:33" (3/3) ... [2021-10-29 05:41:33,496 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2021-10-29 05:41:33,503 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:41:33,503 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 05:41:33,573 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:41:33,578 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:41:33,579 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 05:41:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 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-29 05:41:33,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 05:41:33,602 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:33,603 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:41:33,603 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -94103792, now seen corresponding path program 1 times [2021-10-29 05:41:33,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:33,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402223805] [2021-10-29 05:41:33,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:33,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:33,787 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-29 05:41:33,788 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:33,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402223805] [2021-10-29 05:41:33,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402223805] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:33,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:33,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:41:33,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477270114] [2021-10-29 05:41:33,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:41:33,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:41:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:33,812 INFO L87 Difference]: Start difference. First operand has 100 states, 98 states have (on average 1.5714285714285714) internal successors, (154), 99 states have internal predecessors, (154), 0 states have call successors, (0), 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 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-29 05:41:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:33,887 INFO L93 Difference]: Finished difference Result 275 states and 422 transitions. [2021-10-29 05:41:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:41:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-10-29 05:41:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:33,901 INFO L225 Difference]: With dead ends: 275 [2021-10-29 05:41:33,902 INFO L226 Difference]: Without dead ends: 173 [2021-10-29 05:41:33,905 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-29 05:41:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 163. [2021-10-29 05:41:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 0 states have call successors, (0), 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-29 05:41:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2021-10-29 05:41:33,960 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 19 [2021-10-29 05:41:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:33,961 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2021-10-29 05:41:33,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 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-29 05:41:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2021-10-29 05:41:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:41:33,966 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:33,967 INFO L513 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] [2021-10-29 05:41:33,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:41:33,969 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -903760834, now seen corresponding path program 1 times [2021-10-29 05:41:33,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:33,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868451710] [2021-10-29 05:41:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:33,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:34,048 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-29 05:41:34,049 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:34,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868451710] [2021-10-29 05:41:34,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868451710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:34,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:34,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:34,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304577562] [2021-10-29 05:41:34,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:34,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:34,053 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-29 05:41:34,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:34,234 INFO L93 Difference]: Finished difference Result 514 states and 747 transitions. [2021-10-29 05:41:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:34,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 36 [2021-10-29 05:41:34,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:34,244 INFO L225 Difference]: With dead ends: 514 [2021-10-29 05:41:34,244 INFO L226 Difference]: Without dead ends: 356 [2021-10-29 05:41:34,250 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2021-10-29 05:41:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 279. [2021-10-29 05:41:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.4388489208633093) internal successors, (400), 278 states have internal predecessors, (400), 0 states have call successors, (0), 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-29 05:41:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 400 transitions. [2021-10-29 05:41:34,298 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 400 transitions. Word has length 36 [2021-10-29 05:41:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:34,298 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 400 transitions. [2021-10-29 05:41:34,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-29 05:41:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 400 transitions. [2021-10-29 05:41:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:41:34,302 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:34,302 INFO L513 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] [2021-10-29 05:41:34,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:41:34,303 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash 15213789, now seen corresponding path program 1 times [2021-10-29 05:41:34,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:34,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876018658] [2021-10-29 05:41:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:34,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:34,408 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-29 05:41:34,408 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:34,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876018658] [2021-10-29 05:41:34,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876018658] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:34,409 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:34,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:34,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583672164] [2021-10-29 05:41:34,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:34,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:34,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:34,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:34,412 INFO L87 Difference]: Start difference. First operand 279 states and 400 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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-29 05:41:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:34,542 INFO L93 Difference]: Finished difference Result 877 states and 1246 transitions. [2021-10-29 05:41:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-29 05:41:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:34,547 INFO L225 Difference]: With dead ends: 877 [2021-10-29 05:41:34,547 INFO L226 Difference]: Without dead ends: 606 [2021-10-29 05:41:34,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2021-10-29 05:41:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 484. [2021-10-29 05:41:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 483 states have (on average 1.4057971014492754) internal successors, (679), 483 states have internal predecessors, (679), 0 states have call successors, (0), 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-29 05:41:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 679 transitions. [2021-10-29 05:41:34,604 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 679 transitions. Word has length 36 [2021-10-29 05:41:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:34,605 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 679 transitions. [2021-10-29 05:41:34,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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-29 05:41:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 679 transitions. [2021-10-29 05:41:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 05:41:34,616 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:34,616 INFO L513 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] [2021-10-29 05:41:34,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:41:34,617 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:34,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1264110946, now seen corresponding path program 1 times [2021-10-29 05:41:34,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:34,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428249843] [2021-10-29 05:41:34,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:34,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:34,709 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-29 05:41:34,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:34,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428249843] [2021-10-29 05:41:34,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428249843] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:34,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:34,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:34,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973350058] [2021-10-29 05:41:34,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:41:34,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:34,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:41:34,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:34,713 INFO L87 Difference]: Start difference. First operand 484 states and 679 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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-29 05:41:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:34,772 INFO L93 Difference]: Finished difference Result 844 states and 1214 transitions. [2021-10-29 05:41:34,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:41:34,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-10-29 05:41:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:34,780 INFO L225 Difference]: With dead ends: 844 [2021-10-29 05:41:34,780 INFO L226 Difference]: Without dead ends: 568 [2021-10-29 05:41:34,784 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2021-10-29 05:41:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 532. [2021-10-29 05:41:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4293785310734464) internal successors, (759), 531 states have internal predecessors, (759), 0 states have call successors, (0), 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-29 05:41:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 759 transitions. [2021-10-29 05:41:34,814 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 759 transitions. Word has length 36 [2021-10-29 05:41:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:34,815 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 759 transitions. [2021-10-29 05:41:34,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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-29 05:41:34,816 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 759 transitions. [2021-10-29 05:41:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-29 05:41:34,819 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:34,820 INFO L513 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] [2021-10-29 05:41:34,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:41:34,820 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:34,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -642955608, now seen corresponding path program 1 times [2021-10-29 05:41:34,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:34,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17135032] [2021-10-29 05:41:34,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:34,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:34,948 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-29 05:41:34,948 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:34,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17135032] [2021-10-29 05:41:34,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17135032] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:34,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:34,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:34,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824570997] [2021-10-29 05:41:34,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:34,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:34,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:34,951 INFO L87 Difference]: Start difference. First operand 532 states and 759 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-29 05:41:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:35,072 INFO L93 Difference]: Finished difference Result 1793 states and 2575 transitions. [2021-10-29 05:41:35,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:35,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 [2021-10-29 05:41:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:35,080 INFO L225 Difference]: With dead ends: 1793 [2021-10-29 05:41:35,081 INFO L226 Difference]: Without dead ends: 1271 [2021-10-29 05:41:35,082 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2021-10-29 05:41:35,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 966. [2021-10-29 05:41:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.4124352331606218) internal successors, (1363), 965 states have internal predecessors, (1363), 0 states have call successors, (0), 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-29 05:41:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1363 transitions. [2021-10-29 05:41:35,161 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1363 transitions. Word has length 52 [2021-10-29 05:41:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:35,161 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1363 transitions. [2021-10-29 05:41:35,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-29 05:41:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1363 transitions. [2021-10-29 05:41:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-29 05:41:35,165 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:35,165 INFO L513 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] [2021-10-29 05:41:35,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:41:35,165 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:35,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:35,166 INFO L85 PathProgramCache]: Analyzing trace with hash -650280792, now seen corresponding path program 1 times [2021-10-29 05:41:35,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:35,167 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933316659] [2021-10-29 05:41:35,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:35,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:35,238 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-29 05:41:35,238 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:35,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933316659] [2021-10-29 05:41:35,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933316659] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:35,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:35,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:35,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107712767] [2021-10-29 05:41:35,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:35,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:35,242 INFO L87 Difference]: Start difference. First operand 966 states and 1363 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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-29 05:41:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:35,430 INFO L93 Difference]: Finished difference Result 3294 states and 4654 transitions. [2021-10-29 05:41:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 53 [2021-10-29 05:41:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:35,445 INFO L225 Difference]: With dead ends: 3294 [2021-10-29 05:41:35,445 INFO L226 Difference]: Without dead ends: 2338 [2021-10-29 05:41:35,448 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2021-10-29 05:41:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1748. [2021-10-29 05:41:35,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3892386949055524) internal successors, (2427), 1747 states have internal predecessors, (2427), 0 states have call successors, (0), 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-29 05:41:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2427 transitions. [2021-10-29 05:41:35,588 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2427 transitions. Word has length 53 [2021-10-29 05:41:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:35,588 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2427 transitions. [2021-10-29 05:41:35,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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-29 05:41:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2427 transitions. [2021-10-29 05:41:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-29 05:41:35,594 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:35,594 INFO L513 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] [2021-10-29 05:41:35,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:41:35,594 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:35,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash 128308584, now seen corresponding path program 1 times [2021-10-29 05:41:35,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:35,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346202588] [2021-10-29 05:41:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:35,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:35,653 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-29 05:41:35,653 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:35,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346202588] [2021-10-29 05:41:35,654 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346202588] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:35,654 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:35,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:35,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720658216] [2021-10-29 05:41:35,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:41:35,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:35,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:41:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:35,657 INFO L87 Difference]: Start difference. First operand 1748 states and 2427 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 05:41:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:35,801 INFO L93 Difference]: Finished difference Result 2978 states and 4160 transitions. [2021-10-29 05:41:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:41:35,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-10-29 05:41:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:35,815 INFO L225 Difference]: With dead ends: 2978 [2021-10-29 05:41:35,815 INFO L226 Difference]: Without dead ends: 1892 [2021-10-29 05:41:35,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2021-10-29 05:41:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1748. [2021-10-29 05:41:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.3388666285060102) internal successors, (2339), 1747 states have internal predecessors, (2339), 0 states have call successors, (0), 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-29 05:41:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2339 transitions. [2021-10-29 05:41:35,930 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2339 transitions. Word has length 54 [2021-10-29 05:41:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:35,931 INFO L470 AbstractCegarLoop]: Abstraction has 1748 states and 2339 transitions. [2021-10-29 05:41:35,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 05:41:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2339 transitions. [2021-10-29 05:41:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-29 05:41:35,936 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:35,936 INFO L513 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] [2021-10-29 05:41:35,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:41:35,936 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:35,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:35,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1101797543, now seen corresponding path program 1 times [2021-10-29 05:41:35,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:35,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829969868] [2021-10-29 05:41:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:35,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:36,001 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-29 05:41:36,001 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:36,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829969868] [2021-10-29 05:41:36,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829969868] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:36,002 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:36,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:41:36,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716625089] [2021-10-29 05:41:36,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:41:36,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:36,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:41:36,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:36,004 INFO L87 Difference]: Start difference. First operand 1748 states and 2339 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 05:41:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:36,209 INFO L93 Difference]: Finished difference Result 3234 states and 4351 transitions. [2021-10-29 05:41:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:41:36,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-10-29 05:41:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:36,220 INFO L225 Difference]: With dead ends: 3234 [2021-10-29 05:41:36,220 INFO L226 Difference]: Without dead ends: 1496 [2021-10-29 05:41:36,224 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:41:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2021-10-29 05:41:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1333. [2021-10-29 05:41:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 1332 states have (on average 1.3543543543543544) internal successors, (1804), 1332 states have internal predecessors, (1804), 0 states have call successors, (0), 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-29 05:41:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2021-10-29 05:41:36,314 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 54 [2021-10-29 05:41:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:36,314 INFO L470 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2021-10-29 05:41:36,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 05:41:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2021-10-29 05:41:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-29 05:41:36,318 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:36,319 INFO L513 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] [2021-10-29 05:41:36,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:41:36,319 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash -711580186, now seen corresponding path program 1 times [2021-10-29 05:41:36,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:36,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055452377] [2021-10-29 05:41:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:36,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:36,426 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-29 05:41:36,426 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:36,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055452377] [2021-10-29 05:41:36,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055452377] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:36,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:36,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:41:36,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004471937] [2021-10-29 05:41:36,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:41:36,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:41:36,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:36,431 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-29 05:41:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:36,612 INFO L93 Difference]: Finished difference Result 2602 states and 3527 transitions. [2021-10-29 05:41:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:41:36,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2021-10-29 05:41:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:36,624 INFO L225 Difference]: With dead ends: 2602 [2021-10-29 05:41:36,624 INFO L226 Difference]: Without dead ends: 1280 [2021-10-29 05:41:36,630 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:41:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2021-10-29 05:41:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1125. [2021-10-29 05:41:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3665480427046264) internal successors, (1536), 1124 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:41:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1536 transitions. [2021-10-29 05:41:36,725 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1536 transitions. Word has length 56 [2021-10-29 05:41:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:36,725 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1536 transitions. [2021-10-29 05:41:36,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-29 05:41:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1536 transitions. [2021-10-29 05:41:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-29 05:41:36,729 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:36,729 INFO L513 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] [2021-10-29 05:41:36,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:41:36,729 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1828301811, now seen corresponding path program 1 times [2021-10-29 05:41:36,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:36,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352373891] [2021-10-29 05:41:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:36,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:36,823 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-29 05:41:36,824 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:36,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352373891] [2021-10-29 05:41:36,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352373891] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:36,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:36,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:41:36,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624920997] [2021-10-29 05:41:36,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:41:36,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:36,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:41:36,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:36,828 INFO L87 Difference]: Start difference. First operand 1125 states and 1536 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 05:41:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:37,009 INFO L93 Difference]: Finished difference Result 2435 states and 3301 transitions. [2021-10-29 05:41:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:41:37,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-10-29 05:41:37,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:37,018 INFO L225 Difference]: With dead ends: 2435 [2021-10-29 05:41:37,019 INFO L226 Difference]: Without dead ends: 1321 [2021-10-29 05:41:37,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:41:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2021-10-29 05:41:37,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1125. [2021-10-29 05:41:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.3487544483985765) internal successors, (1516), 1124 states have internal predecessors, (1516), 0 states have call successors, (0), 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-29 05:41:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1516 transitions. [2021-10-29 05:41:37,091 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1516 transitions. Word has length 58 [2021-10-29 05:41:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:37,093 INFO L470 AbstractCegarLoop]: Abstraction has 1125 states and 1516 transitions. [2021-10-29 05:41:37,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 05:41:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1516 transitions. [2021-10-29 05:41:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-29 05:41:37,096 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:37,097 INFO L513 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] [2021-10-29 05:41:37,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:41:37,097 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1326313774, now seen corresponding path program 1 times [2021-10-29 05:41:37,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:37,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200676293] [2021-10-29 05:41:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:37,101 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:37,172 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-29 05:41:37,172 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:37,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200676293] [2021-10-29 05:41:37,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200676293] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:37,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:37,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:37,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892983540] [2021-10-29 05:41:37,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:41:37,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:37,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:41:37,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:37,176 INFO L87 Difference]: Start difference. First operand 1125 states and 1516 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 05:41:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:37,245 INFO L93 Difference]: Finished difference Result 1915 states and 2588 transitions. [2021-10-29 05:41:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:41:37,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2021-10-29 05:41:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:37,251 INFO L225 Difference]: With dead ends: 1915 [2021-10-29 05:41:37,251 INFO L226 Difference]: Without dead ends: 801 [2021-10-29 05:41:37,253 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-10-29 05:41:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 786. [2021-10-29 05:41:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2955414012738853) internal successors, (1017), 785 states have internal predecessors, (1017), 0 states have call successors, (0), 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-29 05:41:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1017 transitions. [2021-10-29 05:41:37,315 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1017 transitions. Word has length 58 [2021-10-29 05:41:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:37,316 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1017 transitions. [2021-10-29 05:41:37,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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-29 05:41:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1017 transitions. [2021-10-29 05:41:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-29 05:41:37,319 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:37,319 INFO L513 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] [2021-10-29 05:41:37,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:41:37,320 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash -906808733, now seen corresponding path program 1 times [2021-10-29 05:41:37,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:37,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224072395] [2021-10-29 05:41:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:37,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:37,491 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-29 05:41:37,491 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:37,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224072395] [2021-10-29 05:41:37,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224072395] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:41:37,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254001712] [2021-10-29 05:41:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:37,492 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:41:37,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:41:37,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:41:37,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 05:41:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:37,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-29 05:41:37,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:41:37,864 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-29 05:41:37,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:41:38,305 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-29 05:41:38,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254001712] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:38,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:41:38,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 4] imperfect sequences [8] total 12 [2021-10-29 05:41:38,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335622130] [2021-10-29 05:41:38,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:41:38,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:38,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:41:38,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-29 05:41:38,308 INFO L87 Difference]: Start difference. First operand 786 states and 1017 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-29 05:41:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:38,394 INFO L93 Difference]: Finished difference Result 1544 states and 2000 transitions. [2021-10-29 05:41:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:41:38,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 59 [2021-10-29 05:41:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:38,400 INFO L225 Difference]: With dead ends: 1544 [2021-10-29 05:41:38,400 INFO L226 Difference]: Without dead ends: 790 [2021-10-29 05:41:38,402 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-10-29 05:41:38,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-10-29 05:41:38,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 786. [2021-10-29 05:41:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.2751592356687897) internal successors, (1001), 785 states have internal predecessors, (1001), 0 states have call successors, (0), 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-29 05:41:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1001 transitions. [2021-10-29 05:41:38,457 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1001 transitions. Word has length 59 [2021-10-29 05:41:38,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:38,457 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1001 transitions. [2021-10-29 05:41:38,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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-29 05:41:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1001 transitions. [2021-10-29 05:41:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-29 05:41:38,462 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:38,462 INFO L513 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] [2021-10-29 05:41:38,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-29 05:41:38,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-29 05:41:38,688 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1977232412, now seen corresponding path program 1 times [2021-10-29 05:41:38,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:38,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587296267] [2021-10-29 05:41:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:38,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:38,740 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-29 05:41:38,740 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:38,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587296267] [2021-10-29 05:41:38,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587296267] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:38,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:38,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:38,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858509368] [2021-10-29 05:41:38,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:41:38,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:38,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:41:38,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:38,743 INFO L87 Difference]: Start difference. First operand 786 states and 1001 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-29 05:41:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:38,811 INFO L93 Difference]: Finished difference Result 1384 states and 1770 transitions. [2021-10-29 05:41:38,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:41:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-10-29 05:41:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:38,816 INFO L225 Difference]: With dead ends: 1384 [2021-10-29 05:41:38,816 INFO L226 Difference]: Without dead ends: 630 [2021-10-29 05:41:38,817 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2021-10-29 05:41:38,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 617. [2021-10-29 05:41:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.228896103896104) internal successors, (757), 616 states have internal predecessors, (757), 0 states have call successors, (0), 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-29 05:41:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 757 transitions. [2021-10-29 05:41:38,862 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 757 transitions. Word has length 59 [2021-10-29 05:41:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:38,863 INFO L470 AbstractCegarLoop]: Abstraction has 617 states and 757 transitions. [2021-10-29 05:41:38,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-29 05:41:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 757 transitions. [2021-10-29 05:41:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-29 05:41:38,865 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:38,866 INFO L513 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] [2021-10-29 05:41:38,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:41:38,866 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:38,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1340286050, now seen corresponding path program 1 times [2021-10-29 05:41:38,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:38,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647356050] [2021-10-29 05:41:38,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:38,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:38,992 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-29 05:41:38,993 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:38,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647356050] [2021-10-29 05:41:38,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647356050] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:41:38,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941006077] [2021-10-29 05:41:38,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:38,994 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:41:38,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:41:39,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:41:39,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-29 05:41:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:39,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-29 05:41:39,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:41:39,513 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-29 05:41:39,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:41:40,169 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-29 05:41:40,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941006077] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:40,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:41:40,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 5] imperfect sequences [8] total 13 [2021-10-29 05:41:40,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887866978] [2021-10-29 05:41:40,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 05:41:40,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:40,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 05:41:40,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-29 05:41:40,175 INFO L87 Difference]: Start difference. First operand 617 states and 757 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 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-29 05:41:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:40,437 INFO L93 Difference]: Finished difference Result 2176 states and 2676 transitions. [2021-10-29 05:41:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 05:41:40,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 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 60 [2021-10-29 05:41:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:40,447 INFO L225 Difference]: With dead ends: 2176 [2021-10-29 05:41:40,447 INFO L226 Difference]: Without dead ends: 1710 [2021-10-29 05:41:40,449 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-29 05:41:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2021-10-29 05:41:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1000. [2021-10-29 05:41:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 1.2392392392392393) internal successors, (1238), 999 states have internal predecessors, (1238), 0 states have call successors, (0), 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-29 05:41:40,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1238 transitions. [2021-10-29 05:41:40,533 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1238 transitions. Word has length 60 [2021-10-29 05:41:40,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:40,534 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1238 transitions. [2021-10-29 05:41:40,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 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-29 05:41:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1238 transitions. [2021-10-29 05:41:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-29 05:41:40,536 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:40,537 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:41:40,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-29 05:41:40,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:41:40,754 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -630394364, now seen corresponding path program 1 times [2021-10-29 05:41:40,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:40,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34215787] [2021-10-29 05:41:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:40,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:41:40,811 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:40,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34215787] [2021-10-29 05:41:40,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34215787] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:41:40,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590204664] [2021-10-29 05:41:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:40,812 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:41:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:41:40,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:41:40,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-29 05:41:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:41,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 05:41:41,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:41:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:41:41,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:41:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:41:41,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590204664] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:41,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:41:41,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-29 05:41:41,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951634842] [2021-10-29 05:41:41,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:41,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:41,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:41,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:41:41,397 INFO L87 Difference]: Start difference. First operand 1000 states and 1238 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-29 05:41:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:41,497 INFO L93 Difference]: Finished difference Result 1701 states and 2103 transitions. [2021-10-29 05:41:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 60 [2021-10-29 05:41:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:41,504 INFO L225 Difference]: With dead ends: 1701 [2021-10-29 05:41:41,504 INFO L226 Difference]: Without dead ends: 1040 [2021-10-29 05:41:41,507 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:41:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2021-10-29 05:41:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 942. [2021-10-29 05:41:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 1.234856535600425) internal successors, (1162), 941 states have internal predecessors, (1162), 0 states have call successors, (0), 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-29 05:41:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1162 transitions. [2021-10-29 05:41:41,588 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1162 transitions. Word has length 60 [2021-10-29 05:41:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:41,588 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1162 transitions. [2021-10-29 05:41:41,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-29 05:41:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1162 transitions. [2021-10-29 05:41:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-29 05:41:41,591 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:41,591 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:41:41,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-29 05:41:41,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-10-29 05:41:41,804 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:41,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 799905747, now seen corresponding path program 1 times [2021-10-29 05:41:41,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:41,805 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070476860] [2021-10-29 05:41:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:41,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:41:41,851 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:41,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070476860] [2021-10-29 05:41:41,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070476860] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:41:41,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752033248] [2021-10-29 05:41:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:41,852 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:41:41,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:41:41,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:41:41,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-29 05:41:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:42,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-29 05:41:42,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:41:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:41:42,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:41:42,430 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:41:42,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752033248] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:42,430 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:41:42,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-10-29 05:41:42,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843506928] [2021-10-29 05:41:42,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:42,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:41:42,433 INFO L87 Difference]: Start difference. First operand 942 states and 1162 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-29 05:41:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:42,568 INFO L93 Difference]: Finished difference Result 1668 states and 2049 transitions. [2021-10-29 05:41:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:42,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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 60 [2021-10-29 05:41:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:42,575 INFO L225 Difference]: With dead ends: 1668 [2021-10-29 05:41:42,575 INFO L226 Difference]: Without dead ends: 1109 [2021-10-29 05:41:42,577 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:41:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2021-10-29 05:41:42,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 943. [2021-10-29 05:41:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.2388535031847134) internal successors, (1167), 942 states have internal predecessors, (1167), 0 states have call successors, (0), 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-29 05:41:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1167 transitions. [2021-10-29 05:41:42,652 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1167 transitions. Word has length 60 [2021-10-29 05:41:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:42,652 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1167 transitions. [2021-10-29 05:41:42,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 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-29 05:41:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1167 transitions. [2021-10-29 05:41:42,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-29 05:41:42,655 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:42,655 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:41:42,692 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-10-29 05:41:42,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-10-29 05:41:42,880 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:42,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1422165127, now seen corresponding path program 1 times [2021-10-29 05:41:42,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:42,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612285582] [2021-10-29 05:41:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:42,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-29 05:41:42,911 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:42,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612285582] [2021-10-29 05:41:42,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612285582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:42,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:42,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:41:42,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845776417] [2021-10-29 05:41:42,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:41:42,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:41:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:42,914 INFO L87 Difference]: Start difference. First operand 943 states and 1167 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-29 05:41:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:43,021 INFO L93 Difference]: Finished difference Result 2143 states and 2688 transitions. [2021-10-29 05:41:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:41:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 [2021-10-29 05:41:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:43,029 INFO L225 Difference]: With dead ends: 2143 [2021-10-29 05:41:43,029 INFO L226 Difference]: Without dead ends: 1211 [2021-10-29 05:41:43,031 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:41:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2021-10-29 05:41:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1063. [2021-10-29 05:41:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1062 states have (on average 1.2448210922787193) internal successors, (1322), 1062 states have internal predecessors, (1322), 0 states have call successors, (0), 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-29 05:41:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1322 transitions. [2021-10-29 05:41:43,120 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1322 transitions. Word has length 60 [2021-10-29 05:41:43,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:43,120 INFO L470 AbstractCegarLoop]: Abstraction has 1063 states and 1322 transitions. [2021-10-29 05:41:43,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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-29 05:41:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1322 transitions. [2021-10-29 05:41:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-29 05:41:43,123 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:43,123 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-10-29 05:41:43,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 05:41:43,123 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 510128812, now seen corresponding path program 1 times [2021-10-29 05:41:43,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:43,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35484914] [2021-10-29 05:41:43,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:43,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-29 05:41:43,199 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:43,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35484914] [2021-10-29 05:41:43,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35484914] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 05:41:43,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251090971] [2021-10-29 05:41:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:43,200 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 05:41:43,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:41:43,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 05:41:43,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-29 05:41:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:43,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-29 05:41:43,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 05:41:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-29 05:41:43,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 05:41:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-29 05:41:43,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251090971] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:43,794 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-29 05:41:43,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [4] total 6 [2021-10-29 05:41:43,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897413420] [2021-10-29 05:41:43,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:43,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:41:43,796 INFO L87 Difference]: Start difference. First operand 1063 states and 1322 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-29 05:41:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:43,900 INFO L93 Difference]: Finished difference Result 1525 states and 1892 transitions. [2021-10-29 05:41:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:43,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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 61 [2021-10-29 05:41:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:43,907 INFO L225 Difference]: With dead ends: 1525 [2021-10-29 05:41:43,908 INFO L226 Difference]: Without dead ends: 1089 [2021-10-29 05:41:43,909 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:41:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2021-10-29 05:41:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 708. [2021-10-29 05:41:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 707 states have (on average 1.2347949080622347) internal successors, (873), 707 states have internal predecessors, (873), 0 states have call successors, (0), 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-29 05:41:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 873 transitions. [2021-10-29 05:41:43,981 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 873 transitions. Word has length 61 [2021-10-29 05:41:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:43,982 INFO L470 AbstractCegarLoop]: Abstraction has 708 states and 873 transitions. [2021-10-29 05:41:43,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-29 05:41:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 873 transitions. [2021-10-29 05:41:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-10-29 05:41:43,984 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:43,984 INFO L513 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] [2021-10-29 05:41:44,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-29 05:41:44,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-29 05:41:44,212 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:44,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:44,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1779942747, now seen corresponding path program 1 times [2021-10-29 05:41:44,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:44,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359640779] [2021-10-29 05:41:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:44,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-29 05:41:44,283 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:44,283 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359640779] [2021-10-29 05:41:44,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359640779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:44,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:44,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 05:41:44,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013451834] [2021-10-29 05:41:44,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 05:41:44,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:44,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 05:41:44,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:41:44,285 INFO L87 Difference]: Start difference. First operand 708 states and 873 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-29 05:41:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:44,480 INFO L93 Difference]: Finished difference Result 1350 states and 1635 transitions. [2021-10-29 05:41:44,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 05:41:44,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2021-10-29 05:41:44,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:44,485 INFO L225 Difference]: With dead ends: 1350 [2021-10-29 05:41:44,485 INFO L226 Difference]: Without dead ends: 577 [2021-10-29 05:41:44,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-29 05:41:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2021-10-29 05:41:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 464. [2021-10-29 05:41:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 463 states have (on average 1.1771058315334773) internal successors, (545), 463 states have internal predecessors, (545), 0 states have call successors, (0), 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-29 05:41:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 545 transitions. [2021-10-29 05:41:44,578 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 545 transitions. Word has length 61 [2021-10-29 05:41:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:44,579 INFO L470 AbstractCegarLoop]: Abstraction has 464 states and 545 transitions. [2021-10-29 05:41:44,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-29 05:41:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 545 transitions. [2021-10-29 05:41:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-29 05:41:44,581 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:44,581 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 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] [2021-10-29 05:41:44,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 05:41:44,582 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:44,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash -984781663, now seen corresponding path program 1 times [2021-10-29 05:41:44,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:44,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732329485] [2021-10-29 05:41:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:44,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:44,629 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-29 05:41:44,629 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:44,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732329485] [2021-10-29 05:41:44,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732329485] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:44,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:44,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:41:44,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149517622] [2021-10-29 05:41:44,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:44,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:44,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:44,632 INFO L87 Difference]: Start difference. First operand 464 states and 545 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-29 05:41:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:44,740 INFO L93 Difference]: Finished difference Result 840 states and 974 transitions. [2021-10-29 05:41:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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 62 [2021-10-29 05:41:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:44,744 INFO L225 Difference]: With dead ends: 840 [2021-10-29 05:41:44,744 INFO L226 Difference]: Without dead ends: 507 [2021-10-29 05:41:44,745 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-29 05:41:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 448. [2021-10-29 05:41:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.1565995525727069) internal successors, (517), 447 states have internal predecessors, (517), 0 states have call successors, (0), 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-29 05:41:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 517 transitions. [2021-10-29 05:41:44,792 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 517 transitions. Word has length 62 [2021-10-29 05:41:44,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:44,792 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 517 transitions. [2021-10-29 05:41:44,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 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-29 05:41:44,793 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 517 transitions. [2021-10-29 05:41:44,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-29 05:41:44,794 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:44,794 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 05:41:44,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 05:41:44,795 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:44,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:44,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1150400836, now seen corresponding path program 1 times [2021-10-29 05:41:44,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:44,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701248951] [2021-10-29 05:41:44,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:44,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:44,890 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-29 05:41:44,890 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:44,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701248951] [2021-10-29 05:41:44,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701248951] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:44,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:44,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:41:44,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434238665] [2021-10-29 05:41:44,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:41:44,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:44,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:41:44,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:44,892 INFO L87 Difference]: Start difference. First operand 448 states and 517 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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-29 05:41:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:45,036 INFO L93 Difference]: Finished difference Result 1300 states and 1491 transitions. [2021-10-29 05:41:45,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:41:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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 79 [2021-10-29 05:41:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:45,042 INFO L225 Difference]: With dead ends: 1300 [2021-10-29 05:41:45,043 INFO L226 Difference]: Without dead ends: 1007 [2021-10-29 05:41:45,044 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2021-10-29 05:41:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 774. [2021-10-29 05:41:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.1617076326002587) internal successors, (898), 773 states have internal predecessors, (898), 0 states have call successors, (0), 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-29 05:41:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 898 transitions. [2021-10-29 05:41:45,151 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 898 transitions. Word has length 79 [2021-10-29 05:41:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:45,151 INFO L470 AbstractCegarLoop]: Abstraction has 774 states and 898 transitions. [2021-10-29 05:41:45,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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-29 05:41:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 898 transitions. [2021-10-29 05:41:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-29 05:41:45,156 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:45,156 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2021-10-29 05:41:45,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 05:41:45,156 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1659025345, now seen corresponding path program 1 times [2021-10-29 05:41:45,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:45,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041410285] [2021-10-29 05:41:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:45,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-10-29 05:41:45,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:45,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041410285] [2021-10-29 05:41:45,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041410285] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:45,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:45,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:41:45,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133205988] [2021-10-29 05:41:45,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:41:45,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:45,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:41:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:41:45,234 INFO L87 Difference]: Start difference. First operand 774 states and 898 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-29 05:41:45,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:45,378 INFO L93 Difference]: Finished difference Result 1169 states and 1348 transitions. [2021-10-29 05:41:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:41:45,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 100 [2021-10-29 05:41:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:45,383 INFO L225 Difference]: With dead ends: 1169 [2021-10-29 05:41:45,383 INFO L226 Difference]: Without dead ends: 567 [2021-10-29 05:41:45,384 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-29 05:41:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2021-10-29 05:41:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 531. [2021-10-29 05:41:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 1.1566037735849057) internal successors, (613), 530 states have internal predecessors, (613), 0 states have call successors, (0), 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-29 05:41:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 613 transitions. [2021-10-29 05:41:45,441 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 613 transitions. Word has length 100 [2021-10-29 05:41:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:45,441 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 613 transitions. [2021-10-29 05:41:45,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-29 05:41:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 613 transitions. [2021-10-29 05:41:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-10-29 05:41:45,444 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:41:45,444 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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] [2021-10-29 05:41:45,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 05:41:45,444 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 05:41:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:41:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash -31532579, now seen corresponding path program 1 times [2021-10-29 05:41:45,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:41:45,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368379544] [2021-10-29 05:41:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:41:45,446 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:41:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:41:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-29 05:41:45,506 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:41:45,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368379544] [2021-10-29 05:41:45,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368379544] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:41:45,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:41:45,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:41:45,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794349676] [2021-10-29 05:41:45,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:41:45,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:41:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:41:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:45,508 INFO L87 Difference]: Start difference. First operand 531 states and 613 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-29 05:41:45,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:41:45,613 INFO L93 Difference]: Finished difference Result 774 states and 882 transitions. [2021-10-29 05:41:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:41:45,614 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 101 [2021-10-29 05:41:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:41:45,615 INFO L225 Difference]: With dead ends: 774 [2021-10-29 05:41:45,615 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 05:41:45,616 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:41:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 05:41:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 05:41:45,616 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-29 05:41:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 05:41:45,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2021-10-29 05:41:45,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:41:45,617 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 05:41:45,617 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-29 05:41:45,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 05:41:45,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 05:41:45,620 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:41:45,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 05:41:45,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 05:41:45,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:45,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:45,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,229 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:46,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,339 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:47,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:41:55,553 INFO L853 garLoopResultBuilder]: At program point L564(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-29 05:41:55,554 INFO L853 garLoopResultBuilder]: At program point L564-1(lines 564 573) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-29 05:41:55,554 INFO L857 garLoopResultBuilder]: For program point L300(lines 300 307) no Hoare annotation was computed. [2021-10-29 05:41:55,554 INFO L853 garLoopResultBuilder]: At program point L169(lines 157 171) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-29 05:41:55,555 INFO L853 garLoopResultBuilder]: At program point L169-1(lines 157 171) the Hoare annotation is: (let ((.cse13 (= ~t2_pc~0 1)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse0 (not .cse14)) (.cse1 (= ~t1_st~0 0)) (.cse12 (= 2 ~t2_st~0)) (.cse15 (= 2 ~t1_st~0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse13)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse12 .cse15 .cse13 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11) (and .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11)))) [2021-10-29 05:41:55,555 INFO L853 garLoopResultBuilder]: At program point L169-2(lines 157 171) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-29 05:41:55,555 INFO L853 garLoopResultBuilder]: At program point L169-3(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse9 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse10 (= ~m_pc~0 1)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (<= ~token~0 (+ 2 ~local~0)) .cse9 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse10 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-10-29 05:41:55,556 INFO L853 garLoopResultBuilder]: At program point L169-4(lines 157 171) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~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 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-29 05:41:55,556 INFO L853 garLoopResultBuilder]: At program point L169-5(lines 157 171) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-29 05:41:55,556 INFO L853 garLoopResultBuilder]: At program point L207(lines 195 209) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) [2021-10-29 05:41:55,557 INFO L853 garLoopResultBuilder]: At program point L207-1(lines 195 209) the Hoare annotation is: (let ((.cse15 (= ~t2_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (= 2 ~t2_st~0)) (.cse1 (= ~t1_st~0 0)) (.cse13 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse7 (= 0 ~t2_st~0)) (.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse10 (not .cse15)) (.cse11 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse12 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12) (and .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2021-10-29 05:41:55,557 INFO L853 garLoopResultBuilder]: At program point L207-2(lines 195 209) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse2 (<= ~token~0 .cse12)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse8 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (<= .cse12 ~token~0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 ~t2_st~0) (not .cse8) .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse8 .cse4 .cse6 (= ~m_pc~0 0) .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse2 (not .cse11) .cse8 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10)))) [2021-10-29 05:41:55,557 INFO L853 garLoopResultBuilder]: At program point L207-3(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (= 2 ~t1_st~0)) (.cse3 (< 0 ~t2_st~0)) (.cse4 (= ~t2_pc~0 1)) (.cse5 (= ~m_pc~0 1)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~E_M~0 0))) (.cse7 (= ~E_2~0 2)) (.cse11 (not (= ~m_st~0 0))) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< (+ ~local~0 1) ~token~0) .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse10 .cse6 .cse7 .cse11 (= ~m_pc~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse6 .cse7 .cse11 .cse8 .cse9))) [2021-10-29 05:41:55,557 INFO L853 garLoopResultBuilder]: At program point L207-4(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-29 05:41:55,558 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2021-10-29 05:41:55,558 INFO L853 garLoopResultBuilder]: At program point L207-5(lines 195 209) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-29 05:41:55,558 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,558 INFO L857 garLoopResultBuilder]: For program point L177-2(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,558 INFO L857 garLoopResultBuilder]: For program point L177-3(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,559 INFO L857 garLoopResultBuilder]: For program point L45(lines 45 49) no Hoare annotation was computed. [2021-10-29 05:41:55,559 INFO L857 garLoopResultBuilder]: For program point L177-5(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,559 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-29 05:41:55,559 INFO L857 garLoopResultBuilder]: For program point L177-6(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,559 INFO L857 garLoopResultBuilder]: For program point L177-8(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,559 INFO L857 garLoopResultBuilder]: For program point L177-9(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,560 INFO L857 garLoopResultBuilder]: For program point L177-11(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,560 INFO L857 garLoopResultBuilder]: For program point L177-12(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,560 INFO L857 garLoopResultBuilder]: For program point L177-14(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,560 INFO L857 garLoopResultBuilder]: For program point L177-15(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,560 INFO L857 garLoopResultBuilder]: For program point L177-17(lines 177 186) no Hoare annotation was computed. [2021-10-29 05:41:55,560 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 183) no Hoare annotation was computed. [2021-10-29 05:41:55,560 INFO L857 garLoopResultBuilder]: For program point L178-1(lines 178 183) no Hoare annotation was computed. [2021-10-29 05:41:55,561 INFO L857 garLoopResultBuilder]: For program point L178-2(lines 178 183) no Hoare annotation was computed. [2021-10-29 05:41:55,561 INFO L857 garLoopResultBuilder]: For program point L178-3(lines 178 183) no Hoare annotation was computed. [2021-10-29 05:41:55,561 INFO L853 garLoopResultBuilder]: At program point L46(lines 41 80) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) (= 2 ~t2_st~0) (= 2 ~t1_st~0) (= ~t2_pc~0 1) (= ~m_pc~0 1) (= ~E_2~0 2) (not (= ~m_st~0 0)) (< (+ ~local~0 1) ~token~0) (= ~E_M~0 2) (not (= ULTIMATE.start_eval_~tmp~0 0)) (= ~E_1~0 2)) [2021-10-29 05:41:55,561 INFO L857 garLoopResultBuilder]: For program point L178-4(lines 178 183) no Hoare annotation was computed. [2021-10-29 05:41:55,561 INFO L857 garLoopResultBuilder]: For program point L178-5(lines 178 183) no Hoare annotation was computed. [2021-10-29 05:41:55,562 INFO L853 garLoopResultBuilder]: At program point L311(lines 273 325) the Hoare annotation is: (let ((.cse2 (= ~t2_pc~0 1)) (.cse22 (+ ~local~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse21 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse19 (not .cse0)) (.cse7 (<= 2 ~t2_st~0)) (.cse1 (<= 2 ~t1_st~0)) (.cse9 (<= ~token~0 .cse22)) (.cse12 (<= .cse22 ~token~0)) (.cse16 (= ~t1_st~0 0)) (.cse15 (= 2 ~t2_st~0)) (.cse4 (not (= ~m_st~0 0))) (.cse11 (= ~m_pc~0 1)) (.cse23 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse24 (= ~m_st~0 ~E_1~0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (not .cse2)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse14 .cse8) (and .cse15 .cse16 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse2 .cse11 .cse12 .cse3 .cse4 .cse6 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse8) (and .cse0 .cse21 .cse15 .cse10 .cse2 .cse11 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse21 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse2 .cse11 .cse3 (< .cse22 ~token~0) .cse6 .cse8) (and .cse15 .cse19 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse0 .cse15 .cse10 .cse2 .cse3 .cse5 .cse6 .cse17 .cse18 .cse14 .cse8) (and .cse19 .cse16 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse0 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse10 .cse11 .cse23 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse23 .cse12 .cse3 .cse4 .cse6 .cse13 .cse20 .cse14 .cse8) (and .cse16 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse15 .cse2 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse8) (and .cse0 .cse11 .cse23 .cse3 .cse24 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse20 .cse14 .cse8)))) [2021-10-29 05:41:55,562 INFO L857 garLoopResultBuilder]: For program point L278(lines 278 282) no Hoare annotation was computed. [2021-10-29 05:41:55,562 INFO L857 garLoopResultBuilder]: For program point L278-1(lines 273 325) no Hoare annotation was computed. [2021-10-29 05:41:55,562 INFO L857 garLoopResultBuilder]: For program point L577(lines 577 581) no Hoare annotation was computed. [2021-10-29 05:41:55,563 INFO L853 garLoopResultBuilder]: At program point L545-1(lines 370 582) the Hoare annotation is: (let ((.cse8 (<= ~token~0 ~local~0)) (.cse9 (<= ~local~0 ~token~0)) (.cse13 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse12 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse10 (= ~E_1~0 2)) (.cse11 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (not .cse0) (= ~t1_st~0 0) .cse5 .cse13 .cse7 (= 0 ~t2_st~0) .cse8 .cse9 (not .cse2) .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse13 .cse7 .cse10) (and .cse0 .cse12 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11))) [2021-10-29 05:41:55,563 INFO L857 garLoopResultBuilder]: For program point L314(lines 314 321) no Hoare annotation was computed. [2021-10-29 05:41:55,563 INFO L853 garLoopResultBuilder]: At program point L283(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-29 05:41:55,564 INFO L860 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-10-29 05:41:55,564 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 94) no Hoare annotation was computed. [2021-10-29 05:41:55,564 INFO L860 garLoopResultBuilder]: At program point L583(lines 530 588) the Hoare annotation is: true [2021-10-29 05:41:55,564 INFO L857 garLoopResultBuilder]: For program point L286(lines 286 293) no Hoare annotation was computed. [2021-10-29 05:41:55,564 INFO L853 garLoopResultBuilder]: At program point L188(lines 176 190) the Hoare annotation is: (and (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ~m_pc~0 ~t1_pc~0) (= ~m_pc~0 ~t2_pc~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~m_pc~0 0) (= ~E_M~0 2) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2021-10-29 05:41:55,565 INFO L853 garLoopResultBuilder]: At program point L188-1(lines 176 190) the Hoare annotation is: (let ((.cse4 (= ~t2_pc~0 1)) (.cse15 (= ~t1_pc~0 1))) (let ((.cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not .cse15)) (.cse3 (= ~t1_st~0 0)) (.cse1 (= 2 ~t2_st~0)) (.cse16 (= 2 ~t1_st~0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (= ~E_2~0 2)) (.cse7 (not (= ~m_st~0 0))) (.cse8 (= ~m_pc~0 0)) (.cse9 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse10 (<= ~token~0 ~local~0)) (.cse11 (<= ~local~0 ~token~0)) (.cse14 (not .cse4)) (.cse12 (not (= ULTIMATE.start_eval_~tmp~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12) (and .cse15 .cse1 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12) (and .cse15 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12)))) [2021-10-29 05:41:55,565 INFO L853 garLoopResultBuilder]: At program point L188-2(lines 176 190) the Hoare annotation is: (let ((.cse12 (+ ~local~0 1))) (let ((.cse2 (<= ~token~0 .cse12)) (.cse3 (= ~m_pc~0 1)) (.cse5 (<= .cse12 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~E_2~0 1)) (.cse11 (= ~t2_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (< 0 ~t1_st~0)) (.cse8 (= ~E_M~0 2)) (.cse9 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse10 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~t2_st~0) .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse4 .cse6 .cse7 (= ~m_pc~0 0) .cse8 .cse9 .cse10)))) [2021-10-29 05:41:55,565 INFO L857 garLoopResultBuilder]: For program point L122(lines 122 130) no Hoare annotation was computed. [2021-10-29 05:41:55,566 INFO L853 garLoopResultBuilder]: At program point L89(lines 89 93) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1))) (let ((.cse15 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse16 (= 2 ~t2_st~0)) (.cse12 (<= ~token~0 ~local~0)) (.cse13 (<= ~local~0 ~token~0)) (.cse10 (not .cse0)) (.cse3 (= ~E_2~0 2)) (.cse4 (not (= ~m_st~0 0))) (.cse5 (< 0 ~t1_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse11 (= 0 ~t2_st~0)) (.cse14 (not .cse1)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse3 .cse5 .cse6 .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 2 ~t2_st~0) .cse8 .cse9) (and .cse0 .cse15 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11 .cse12 .cse13 .cse8 .cse9) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse16 .cse1 .cse15 .cse3 .cse4 .cse5 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse15 .cse2 .cse3 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse11 .cse12 .cse13 .cse14 .cse8 .cse9) (and .cse16 .cse10 .cse1 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13 .cse8 .cse9) (and .cse10 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse14 .cse8 .cse9)))) [2021-10-29 05:41:55,566 INFO L853 garLoopResultBuilder]: At program point L188-3(lines 176 190) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= 2 ~t1_st~0)) (.cse1 (< 0 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse11 (= ~m_pc~0 1)) (.cse4 (not (= ~E_M~0 0))) (.cse5 (= ~E_2~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 (<= ~token~0 (+ 2 ~local~0)) .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse2 .cse11 .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse7 .cse8))) [2021-10-29 05:41:55,566 INFO L853 garLoopResultBuilder]: At program point L188-4(lines 176 190) the Hoare annotation is: (let ((.cse1 (= 2 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ~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 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8))) [2021-10-29 05:41:55,566 INFO L853 garLoopResultBuilder]: At program point L188-5(lines 176 190) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse7 (= ~E_M~0 2)) (.cse8 (= ~E_1~0 2)) (.cse9 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse8 .cse9) (and .cse0 .cse2 .cse4 .cse5 .cse6 (= ~m_pc~0 0) .cse7 .cse8) (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2021-10-29 05:41:55,567 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 05:41:55,567 INFO L857 garLoopResultBuilder]: For program point L158(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,567 INFO L853 garLoopResultBuilder]: At program point L125(lines 125 129) the Hoare annotation is: (let ((.cse19 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse20 (+ ~local~0 1))) (let ((.cse5 (= ~m_st~0 ~E_1~0)) (.cse7 (<= ~token~0 ~local~0)) (.cse8 (<= ~local~0 ~token~0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse17 (<= ~token~0 .cse20)) (.cse16 (= 2 ~t1_st~0)) (.cse2 (= ~m_pc~0 1)) (.cse18 (<= .cse20 ~token~0)) (.cse12 (not .cse0)) (.cse13 (= ~t1_st~0 0)) (.cse1 (< 0 ~t2_st~0)) (.cse4 (= ~E_2~0 2)) (.cse15 (not (= ~m_st~0 0))) (.cse14 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse9 (not .cse19)) (.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 .cse13 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 (<= 2 ~t1_st~0) .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse16 .cse1 .cse4 .cse14 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse17 .cse16 .cse1 .cse2 .cse3 .cse18 .cse4 .cse15 .cse6 .cse9 .cse10 .cse11) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse19 .cse3 .cse4 .cse15 .cse14 .cse6 .cse10 .cse11) (and .cse0 .cse17 .cse16 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse19 .cse2 .cse18 .cse4 .cse15 .cse6 .cse10 .cse11) (and .cse12 .cse13 .cse1 .cse4 .cse15 .cse14 .cse6 .cse9 .cse10 .cse11)))) [2021-10-29 05:41:55,567 INFO L857 garLoopResultBuilder]: For program point L158-2(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,568 INFO L857 garLoopResultBuilder]: For program point L158-3(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,568 INFO L857 garLoopResultBuilder]: For program point L158-5(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,568 INFO L857 garLoopResultBuilder]: For program point L158-6(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,568 INFO L857 garLoopResultBuilder]: For program point L158-8(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,568 INFO L857 garLoopResultBuilder]: For program point L158-9(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,568 INFO L857 garLoopResultBuilder]: For program point L158-11(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,568 INFO L857 garLoopResultBuilder]: For program point L158-12(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,569 INFO L857 garLoopResultBuilder]: For program point L158-14(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,569 INFO L857 garLoopResultBuilder]: For program point L158-15(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,569 INFO L857 garLoopResultBuilder]: For program point L158-17(lines 158 167) no Hoare annotation was computed. [2021-10-29 05:41:55,569 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 164) no Hoare annotation was computed. [2021-10-29 05:41:55,569 INFO L857 garLoopResultBuilder]: For program point L159-1(lines 159 164) no Hoare annotation was computed. [2021-10-29 05:41:55,569 INFO L857 garLoopResultBuilder]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2021-10-29 05:41:55,570 INFO L857 garLoopResultBuilder]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2021-10-29 05:41:55,570 INFO L857 garLoopResultBuilder]: For program point L159-4(lines 159 164) no Hoare annotation was computed. [2021-10-29 05:41:55,570 INFO L857 garLoopResultBuilder]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2021-10-29 05:41:55,570 INFO L853 garLoopResultBuilder]: At program point L326(lines 267 331) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= 2 ~t2_st~0)) (.cse2 (= ~t2_pc~0 1)) (.cse3 (= ~m_pc~0 1)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse6 (= ~E_M~0 2)) (.cse7 (= ~E_1~0 2))) (or (and .cse0 .cse1 (= 2 ~t1_st~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 .cse4 .cse5 (= ~m_pc~0 0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse7))) [2021-10-29 05:41:55,570 INFO L857 garLoopResultBuilder]: For program point L196(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,571 INFO L857 garLoopResultBuilder]: For program point L196-2(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,571 INFO L857 garLoopResultBuilder]: For program point L196-3(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,571 INFO L853 garLoopResultBuilder]: At program point L97-1(lines 85 116) the Hoare annotation is: (let ((.cse0 (= ~t2_pc~0 1))) (let ((.cse19 (+ ~local~0 1)) (.cse3 (< 0 ~t1_st~0)) (.cse17 (= ~m_pc~0 1)) (.cse12 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse1 (= ~E_2~0 2)) (.cse2 (not (= ~m_st~0 0))) (.cse5 (= ~E_M~0 2)) (.cse15 (not .cse0)) (.cse6 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse7 (= ~E_1~0 2))) (let ((.cse8 (or (and .cse17 .cse12 .cse1 .cse3 (= ~m_st~0 ~E_1~0) .cse5 .cse15 .cse6 .cse7) (and (= ~t1_pc~0 1) .cse17 .cse12 .cse1 .cse2 .cse5 .cse15 .cse6 .cse7))) (.cse9 (<= ~token~0 .cse19)) (.cse18 (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) (.cse10 (<= .cse19 ~token~0)) (.cse11 (= 0 ~t2_st~0)) (.cse16 (= 2 ~t2_st~0)) (.cse4 (= ~m_pc~0 0)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~t2_st~0) .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse11 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse15 .cse6 .cse7) (and .cse1 .cse3 .cse4 .cse5 .cse11 .cse13 .cse14 .cse15 .cse6 .cse7) (and (or (and .cse16 .cse0 .cse17 .cse12 .cse1 .cse2 .cse5 .cse6 .cse7 .cse18) (and .cse16 .cse0 .cse17 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7)) .cse13 .cse14) (and .cse9 (not .cse18) .cse0 .cse17 .cse12 .cse10 .cse1 .cse2 .cse5 .cse11 .cse6 .cse7) (and .cse16 .cse0 .cse1 .cse3 .cse4 .cse5 .cse13 .cse14 .cse6 .cse7))))) [2021-10-29 05:41:55,571 INFO L857 garLoopResultBuilder]: For program point L196-5(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,571 INFO L857 garLoopResultBuilder]: For program point L196-6(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,572 INFO L857 garLoopResultBuilder]: For program point L196-8(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,572 INFO L857 garLoopResultBuilder]: For program point L196-9(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,572 INFO L857 garLoopResultBuilder]: For program point L196-11(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,572 INFO L857 garLoopResultBuilder]: For program point L196-12(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,572 INFO L857 garLoopResultBuilder]: For program point L196-14(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,572 INFO L857 garLoopResultBuilder]: For program point L196-15(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,573 INFO L857 garLoopResultBuilder]: For program point L196-17(lines 196 205) no Hoare annotation was computed. [2021-10-29 05:41:55,573 INFO L857 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2021-10-29 05:41:55,573 INFO L857 garLoopResultBuilder]: For program point L197-1(lines 197 202) no Hoare annotation was computed. [2021-10-29 05:41:55,573 INFO L857 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2021-10-29 05:41:55,573 INFO L857 garLoopResultBuilder]: For program point L197-3(lines 197 202) no Hoare annotation was computed. [2021-10-29 05:41:55,573 INFO L857 garLoopResultBuilder]: For program point L197-4(lines 197 202) no Hoare annotation was computed. [2021-10-29 05:41:55,573 INFO L857 garLoopResultBuilder]: For program point L197-5(lines 197 202) no Hoare annotation was computed. [2021-10-29 05:41:55,574 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-29 05:41:55,574 INFO L853 garLoopResultBuilder]: At program point L297(lines 273 325) the Hoare annotation is: (let ((.cse1 (= ~t2_pc~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse24 (+ ~local~0 1))) (let ((.cse21 (<= 2 ~t1_st~0)) (.cse20 (<= 2 ~t2_st~0)) (.cse9 (<= ~token~0 .cse24)) (.cse12 (<= .cse24 ~token~0)) (.cse4 (not (= ~m_st~0 0))) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse15 (= 2 ~t2_st~0)) (.cse11 (= ~m_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse23 (= ~m_st~0 ~E_1~0)) (.cse19 (not .cse0)) (.cse16 (= ~t1_st~0 0)) (.cse10 (= 2 ~t1_st~0)) (.cse3 (= ~E_2~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse13 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse22 (not .cse1)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse10 (not (= ULTIMATE.start_is_transmit2_triggered_~__retres1~2 0)) .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse13 .cse7 .cse8) (and .cse0 .cse14 .cse15 .cse10 .cse1 .cse11 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse16 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse9 .cse10 .cse1 .cse11 .cse12 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse15 .cse19 .cse16 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse10 .cse1 .cse3 .cse5 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse0 .cse15 .cse1 .cse11 .cse3 .cse4 .cse6 .cse17 .cse18 .cse7 .cse8) (and .cse19 .cse16 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse21 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse4 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse21 .cse1 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8) (and .cse0 .cse9 .cse10 .cse11 .cse2 .cse12 .cse3 .cse4 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse16 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse4 .cse5 .cse6 .cse13 .cse22 .cse7 .cse8) (and .cse0 .cse14 (<= ~token~0 (+ 2 ~local~0)) .cse15 .cse10 .cse1 .cse11 .cse3 (< .cse24 ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse11 .cse2 .cse3 .cse23 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse19 .cse16 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8) (and .cse0 .cse10 .cse3 .cse5 .cse6 .cse13 .cse17 .cse18 .cse22 .cse7 .cse8)))) [2021-10-29 05:41:55,574 INFO L853 garLoopResultBuilder]: At program point L133-1(lines 121 152) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1))) (let ((.cse10 (not .cse0)) (.cse11 (= ~t1_st~0 0)) (.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse2 (= 2 ~t1_st~0)) (.cse12 (< 0 ~t2_st~0)) (.cse3 (= ~m_pc~0 1)) (.cse16 (+ ~local~0 1)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~E_2~0 2)) (.cse6 (not (= ~m_st~0 0))) (.cse13 (= ~m_pc~0 0)) (.cse7 (= ~E_M~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse9 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse15 .cse8 .cse9) (and (or (and .cse11 .cse12 .cse3 .cse4 .cse5 (= ~m_st~0 ~E_1~0) .cse7 .cse8 .cse9) (and .cse11 (= ~t2_pc~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse14 .cse15) (and .cse0 .cse1 (<= ~token~0 (+ 2 ~local~0)) .cse2 .cse3 .cse5 (< .cse16 ~token~0) .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse12 .cse5 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9) (and .cse0 (<= 2 ~t1_st~0) .cse12 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9) (and .cse0 (<= ~token~0 .cse16) .cse2 .cse12 .cse3 .cse4 (<= .cse16 ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9)))) [2021-10-29 05:41:55,575 INFO L853 garLoopResultBuilder]: At program point L67(lines 41 80) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse3 (= ~t2_pc~0 1))) (let ((.cse10 (= 0 ~t2_st~0)) (.cse13 (not .cse3)) (.cse2 (= 2 ~t1_st~0)) (.cse1 (= 2 ~t2_st~0)) (.cse14 (not .cse0)) (.cse15 (= ~t1_st~0 0)) (.cse4 (= ~E_2~0 2)) (.cse5 (not (= ~m_st~0 0))) (.cse9 (= ~m_pc~0 0)) (.cse6 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse7 (not (= ULTIMATE.start_eval_~tmp~0 0))) (.cse8 (= ~E_1~0 2))) (or (and .cse0 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (<= ~token~0 (+ 2 ~local~0)) .cse1 .cse2 .cse3 (= ~m_pc~0 1) .cse4 .cse5 (< (+ ~local~0 1) ~token~0) .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse14 .cse15 .cse4 .cse5 .cse9 .cse6 .cse10 .cse11 .cse12 .cse13 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8) (and .cse1 .cse14 .cse15 .cse3 .cse4 .cse5 .cse9 .cse6 .cse11 .cse12 .cse7 .cse8)))) [2021-10-29 05:41:55,578 INFO L731 BasicCegarLoop]: Path program histogram: [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-29 05:41:55,580 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:41:55,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:41:55 BoogieIcfgContainer [2021-10-29 05:41:55,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:41:55,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:41:55,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:41:55,655 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:41:55,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:41:33" (3/4) ... [2021-10-29 05:41:55,658 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 05:41:55,679 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2021-10-29 05:41:55,681 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-10-29 05:41:55,682 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-29 05:41:55,684 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 05:41:55,814 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:41:55,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:41:55,815 INFO L168 Benchmark]: Toolchain (without parser) took 24535.13 ms. Allocated memory was 113.2 MB in the beginning and 281.0 MB in the end (delta: 167.8 MB). Free memory was 82.9 MB in the beginning and 219.7 MB in the end (delta: -136.8 MB). Peak memory consumption was 32.0 MB. Max. memory is 16.1 GB. [2021-10-29 05:41:55,816 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 113.2 MB. Free memory is still 68.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:41:55,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.96 ms. Allocated memory was 113.2 MB in the beginning and 155.2 MB in the end (delta: 41.9 MB). Free memory was 82.5 MB in the beginning and 127.2 MB in the end (delta: -44.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:41:55,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.45 ms. Allocated memory is still 155.2 MB. Free memory was 127.2 MB in the beginning and 123.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:41:55,817 INFO L168 Benchmark]: Boogie Preprocessor took 51.04 ms. Allocated memory is still 155.2 MB. Free memory was 123.6 MB in the beginning and 121.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:41:55,818 INFO L168 Benchmark]: RCFGBuilder took 1725.37 ms. Allocated memory is still 155.2 MB. Free memory was 120.9 MB in the beginning and 112.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:41:55,818 INFO L168 Benchmark]: TraceAbstraction took 22166.99 ms. Allocated memory was 155.2 MB in the beginning and 281.0 MB in the end (delta: 125.8 MB). Free memory was 111.2 MB in the beginning and 235.6 MB in the end (delta: -124.3 MB). Peak memory consumption was 162.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:41:55,818 INFO L168 Benchmark]: Witness Printer took 159.65 ms. Allocated memory is still 281.0 MB. Free memory was 235.6 MB in the beginning and 219.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-29 05:41:55,821 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.26 ms. Allocated memory is still 113.2 MB. Free memory is still 68.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 357.96 ms. Allocated memory was 113.2 MB in the beginning and 155.2 MB in the end (delta: 41.9 MB). Free memory was 82.5 MB in the beginning and 127.2 MB in the end (delta: -44.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.45 ms. Allocated memory is still 155.2 MB. Free memory was 127.2 MB in the beginning and 123.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.04 ms. Allocated memory is still 155.2 MB. Free memory was 123.6 MB in the beginning and 121.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1725.37 ms. Allocated memory is still 155.2 MB. Free memory was 120.9 MB in the beginning and 112.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 68.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22166.99 ms. Allocated memory was 155.2 MB in the beginning and 281.0 MB in the end (delta: 125.8 MB). Free memory was 111.2 MB in the beginning and 235.6 MB in the end (delta: -124.3 MB). Peak memory consumption was 162.1 MB. Max. memory is 16.1 GB. * Witness Printer took 159.65 ms. Allocated memory is still 281.0 MB. Free memory was 235.6 MB in the beginning and 219.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 16.8 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.0s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3520 SDtfs, 4838 SDslu, 4429 SDs, 0 SdLazy, 930 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 734 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1748occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 3774 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 288 NumberOfFragments, 6220 HoareAnnotationTreeSize, 33 FomulaSimplifications, 179031 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 33 FomulaSimplificationsInter, 47486 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1634 NumberOfCodeBlocks, 1634 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1901 ConstructedInterpolants, 0 QuantifiedInterpolants, 4748 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 33 InterpolantComputations, 28 PerfectInterpolantSequences, 482/493 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: 195]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || ((((((((((((__retres1 == 0 && 2 == t2_st) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && __retres1 == 0)) || (((((((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && __retres1 == 0) - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: (((((((((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_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_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_st == 0 && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 89]: Loop Invariant Derived loop invariant: ((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((__retres1 == 0 && 2 == t2_st) && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) || ((((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && 0 == t2_st) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2 - InvariantResult [Line: 564]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && 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)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2)) || ((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && E_1 == 2)) || (((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || ((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((__retres1 == 0 && m_pc == t1_pc) && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) || (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((((((((((((((t2_pc == 1 && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && token <= local + 1) && local + 1 <= token) && 0 == t2_st)) || (((((((t2_pc == 1 && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((m_pc == 1 && __retres1 == 0) && E_2 == 2) && 0 < t1_st) && m_st == E_1) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) && 0 == t2_st) && token <= local) && local <= token)) || ((((((((E_2 == 2 && !(m_st == 0)) && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((E_2 == 2 && 0 < t1_st) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((2 == t2_st && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && 0 < t1_st) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) && token <= local) && local <= token)) || (((((((((((token <= local + 1 && !(__retres1 == 0)) && 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)) || (((((((((2 == t2_st && t2_pc == 1) && E_2 == 2) && 0 < t1_st) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) || ((((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && 0 < t2_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && 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)) || (((((((((!(t1_pc == 1) && t1_st == 0) && 0 < t2_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: (((((((((((((!(t1_pc == 1) && t1_st == 0) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) || (((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0))) || (((((((((((t1_pc == 1 && 2 == t1_st) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) && __retres1 == 0) || ((((((((t1_pc == 1 && E_2 == 1) && t2_pc == 1) && __retres1 == 0) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && E_2 == 1) && token <= local + 1) && !(__retres1 == 0)) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((m_pc == t1_pc && m_pc == t2_pc) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) || ((((((t1_pc == 1 && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && 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)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2) || (((((((((((t1_pc == 1 && token <= 2 + local) && 2 == t1_st) && !(__retres1 == 0)) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 370]: Loop Invariant Derived loop invariant: (((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((((((__retres1 == 0 && !(t1_pc == 1)) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && E_1 == 2) && __retres1 == 0)) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && __retres1 == 0) || (((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && E_1 == 2) && __retres1 == 0) - InvariantResult [Line: 273]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((t1_pc == 1 && t2_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && !(tmp == 0)) && E_1 == 2) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && !(__retres1 == 0)) && 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)) || ((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && t1_st == 0) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && 2 == t2_st) && token <= local + 1) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || ((((((((((2 == t2_st && !(t1_pc == 1)) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && E_2 == 2) && m_pc == 0) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t2_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && token <= local) && local <= token) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((t1_pc == 1 && 2 <= t1_st) && t2_pc == 1) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 2 <= t2_st) && !(tmp == 0)) && E_1 == 2)) || ((((((((((((t1_pc == 1 && token <= local + 1) && 2 == t1_st) && m_pc == 1) && __retres1 == 0) && local + 1 <= token) && E_2 == 2) && !(m_st == 0)) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_st == 0 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && E_M == 2) && 0 == t2_st) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t2_st) && 2 == t1_st) && t2_pc == 1) && m_pc == 1) && E_2 == 2) && local + 1 < token) && E_M == 2) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && m_pc == 1) && __retres1 == 0) && E_2 == 2) && m_st == E_1) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((!(t1_pc == 1) && t1_st == 0) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2)) || ((((((((((t1_pc == 1 && 2 == t1_st) && E_2 == 2) && m_pc == 0) && E_M == 2) && 0 == t2_st) && token <= local) && local <= token) && !(t2_pc == 1)) && !(tmp == 0)) && E_1 == 2) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && __retres1 == 0) && token <= 2 + local) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && !(E_M == 0)) && E_2 == 2) && local + 1 < token) && !(tmp == 0)) && E_1 == 2) || (((((((((t1_pc == 1 && 0 < t2_st) && t2_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && m_pc == 0) && !(tmp == 0)) && E_1 == 2)) || (((((((((((t1_pc == 1 && __retres1 == 0) && 2 == t1_st) && 0 < t2_st) && t2_pc == 1) && m_pc == 1) && __retres1 == 0) && !(E_M == 0)) && E_2 == 2) && !(m_st == 0)) && !(tmp == 0)) && E_1 == 2) RESULT: Ultimate proved your program to be correct! [2021-10-29 05:41:55,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25c0d6e-b8c4-4476-a99a-edb7b2414027/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...