./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH --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 fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:11:16,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:11:16,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:11:16,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:11:16,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:11:16,058 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:11:16,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:11:16,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:11:16,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:11:16,065 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:11:16,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:11:16,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:11:16,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:11:16,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:11:16,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:11:16,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:11:16,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:11:16,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:11:16,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:11:16,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:11:16,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:11:16,083 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:11:16,085 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:11:16,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:11:16,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:11:16,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:11:16,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:11:16,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:11:16,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:11:16,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:11:16,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:11:16,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:11:16,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:11:16,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:11:16,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:11:16,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:11:16,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:11:16,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:11:16,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:11:16,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:11:16,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:11:16,105 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 05:11:16,132 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:11:16,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:11:16,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:11:16,134 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:11:16,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:11:16,134 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:11:16,134 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:11:16,135 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:11:16,135 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:11:16,135 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:11:16,135 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:11:16,135 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:11:16,136 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:11:16,136 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:11:16,136 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:11:16,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:11:16,137 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:11:16,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:11:16,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:11:16,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:11:16,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:11:16,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:11:16,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:11:16,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:11:16,139 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:11:16,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:11:16,139 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:11:16,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:11:16,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:11:16,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:11:16,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:11:16,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:11:16,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:11:16,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:11:16,141 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:11:16,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:11:16,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:11:16,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:11:16,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:11:16,142 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH 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 -> fc74ae7e31589f228260101e75826f872a5ff2be20b18370840af309ca05fc6e [2021-11-03 05:11:16,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:11:16,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:11:16,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:11:16,413 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:11:16,413 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:11:16,414 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-11-03 05:11:16,472 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/data/259fb5243/a25c0e63bfc14023869427b31058192e/FLAGfc6040930 [2021-11-03 05:11:16,970 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:11:16,971 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-11-03 05:11:16,978 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/data/259fb5243/a25c0e63bfc14023869427b31058192e/FLAGfc6040930 [2021-11-03 05:11:17,335 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/data/259fb5243/a25c0e63bfc14023869427b31058192e [2021-11-03 05:11:17,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:11:17,339 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:11:17,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:11:17,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:11:17,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:11:17,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29055619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17, skipping insertion in model container [2021-11-03 05:11:17,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:11:17,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:11:17,566 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-11-03 05:11:17,570 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-11-03 05:11:17,572 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-11-03 05:11:17,574 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-11-03 05:11:17,577 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-11-03 05:11:17,579 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-11-03 05:11:17,581 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-11-03 05:11:17,583 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-11-03 05:11:17,584 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-11-03 05:11:17,586 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-11-03 05:11:17,600 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-11-03 05:11:17,601 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-11-03 05:11:17,604 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-11-03 05:11:17,606 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-11-03 05:11:17,607 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-11-03 05:11:17,609 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-11-03 05:11:17,610 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-11-03 05:11:17,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:11:17,621 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:11:17,635 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-11-03 05:11:17,637 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-11-03 05:11:17,638 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-11-03 05:11:17,640 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-11-03 05:11:17,642 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-11-03 05:11:17,643 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-11-03 05:11:17,645 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-11-03 05:11:17,647 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-11-03 05:11:17,648 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-11-03 05:11:17,649 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-11-03 05:11:17,652 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-11-03 05:11:17,653 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-11-03 05:11:17,656 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-11-03 05:11:17,665 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-11-03 05:11:17,666 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-11-03 05:11:17,668 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-11-03 05:11:17,669 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_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-11-03 05:11:17,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:11:17,684 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:11:17,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17 WrapperNode [2021-11-03 05:11:17,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:11:17,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:11:17,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:11:17,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:11:17,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:11:17,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:11:17,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:11:17,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:11:17,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:11:17,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:11:17,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:11:17,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:11:17,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (1/1) ... [2021-11-03 05:11:17,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:11:17,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:17,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:11:17,834 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:11:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:11:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:11:17,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:11:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:11:18,225 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:11:18,225 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-03 05:11:18,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:11:18 BoogieIcfgContainer [2021-11-03 05:11:18,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:11:18,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:11:18,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:11:18,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:11:18,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:11:17" (1/3) ... [2021-11-03 05:11:18,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7dba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:11:18, skipping insertion in model container [2021-11-03 05:11:18,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:11:17" (2/3) ... [2021-11-03 05:11:18,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a7dba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:11:18, skipping insertion in model container [2021-11-03 05:11:18,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:11:18" (3/3) ... [2021-11-03 05:11:18,255 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2021-11-03 05:11:18,259 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:11:18,260 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-11-03 05:11:18,313 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:11:18,320 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:11:18,320 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-11-03 05:11:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 68 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-11-03 05:11:18,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 05:11:18,344 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:18,344 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:18,345 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:18,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2133700231, now seen corresponding path program 1 times [2021-11-03 05:11:18,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:18,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446115295] [2021-11-03 05:11:18,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:18,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:18,578 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:18,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446115295] [2021-11-03 05:11:18,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446115295] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:18,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:18,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:18,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134521910] [2021-11-03 05:11:18,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:18,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:18,613 INFO L87 Difference]: Start difference. First operand has 69 states, 51 states have (on average 1.8823529411764706) internal successors, (96), 68 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) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:18,778 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2021-11-03 05:11:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:18,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-11-03 05:11:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:18,790 INFO L225 Difference]: With dead ends: 120 [2021-11-03 05:11:18,791 INFO L226 Difference]: Without dead ends: 108 [2021-11-03 05:11:18,793 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-03 05:11:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-03 05:11:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2021-11-03 05:11:18,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 63 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-11-03 05:11:18,832 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 7 [2021-11-03 05:11:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:18,832 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-11-03 05:11:18,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-11-03 05:11:18,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 05:11:18,834 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:18,834 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:18,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:11:18,835 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2130064740, now seen corresponding path program 1 times [2021-11-03 05:11:18,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:18,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945331882] [2021-11-03 05:11:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:18,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:18,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:18,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945331882] [2021-11-03 05:11:18,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945331882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:18,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:18,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:18,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46224297] [2021-11-03 05:11:18,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:18,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:18,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:18,944 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:19,019 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-11-03 05:11:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:11:19,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-11-03 05:11:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:19,021 INFO L225 Difference]: With dead ends: 64 [2021-11-03 05:11:19,022 INFO L226 Difference]: Without dead ends: 62 [2021-11-03 05:11:19,022 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-03 05:11:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-03 05:11:19,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-03 05:11:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-11-03 05:11:19,030 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2021-11-03 05:11:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:19,031 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-11-03 05:11:19,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-11-03 05:11:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 05:11:19,032 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:19,032 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:19,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:11:19,033 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1607501556, now seen corresponding path program 1 times [2021-11-03 05:11:19,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:19,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424183965] [2021-11-03 05:11:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:19,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:19,088 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:19,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424183965] [2021-11-03 05:11:19,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424183965] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:19,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:19,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:19,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749283602] [2021-11-03 05:11:19,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:19,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:19,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:19,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:19,092 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:19,171 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-11-03 05:11:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:19,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-11-03 05:11:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:19,173 INFO L225 Difference]: With dead ends: 68 [2021-11-03 05:11:19,173 INFO L226 Difference]: Without dead ends: 66 [2021-11-03 05:11:19,174 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-03 05:11:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-03 05:11:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-11-03 05:11:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-11-03 05:11:19,184 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2021-11-03 05:11:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:19,185 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-11-03 05:11:19,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-11-03 05:11:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:11:19,186 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:19,186 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:19,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:11:19,189 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:19,190 INFO L85 PathProgramCache]: Analyzing trace with hash -448408979, now seen corresponding path program 1 times [2021-11-03 05:11:19,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:19,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412248842] [2021-11-03 05:11:19,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:19,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:19,299 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:19,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412248842] [2021-11-03 05:11:19,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412248842] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:19,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:19,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:11:19,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817137006] [2021-11-03 05:11:19,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:19,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:19,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:19,302 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:19,417 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-11-03 05:11:19,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:19,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-03 05:11:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:19,423 INFO L225 Difference]: With dead ends: 66 [2021-11-03 05:11:19,423 INFO L226 Difference]: Without dead ends: 64 [2021-11-03 05:11:19,424 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-03 05:11:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-11-03 05:11:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 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-11-03 05:11:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-11-03 05:11:19,439 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 10 [2021-11-03 05:11:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:19,440 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-11-03 05:11:19,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-11-03 05:11:19,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:11:19,441 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:19,441 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:19,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:11:19,441 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:19,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:19,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1379104200, now seen corresponding path program 1 times [2021-11-03 05:11:19,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:19,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027357635] [2021-11-03 05:11:19,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:19,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:19,527 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:19,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027357635] [2021-11-03 05:11:19,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027357635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:19,528 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:19,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:11:19,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000880663] [2021-11-03 05:11:19,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:19,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:19,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:19,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:19,532 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:19,638 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-11-03 05:11:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-11-03 05:11:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:19,641 INFO L225 Difference]: With dead ends: 64 [2021-11-03 05:11:19,642 INFO L226 Difference]: Without dead ends: 62 [2021-11-03 05:11:19,651 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-03 05:11:19,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-11-03 05:11:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-11-03 05:11:19,669 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 10 [2021-11-03 05:11:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:19,669 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-11-03 05:11:19,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-11-03 05:11:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:11:19,674 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:19,674 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:19,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:11:19,674 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1015772272, now seen corresponding path program 1 times [2021-11-03 05:11:19,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:19,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819893295] [2021-11-03 05:11:19,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:19,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:19,745 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:19,745 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819893295] [2021-11-03 05:11:19,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819893295] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:19,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:19,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:19,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279470955] [2021-11-03 05:11:19,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:19,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:19,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:19,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:19,753 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:19,814 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-11-03 05:11:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:11:19,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-11-03 05:11:19,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:19,817 INFO L225 Difference]: With dead ends: 62 [2021-11-03 05:11:19,817 INFO L226 Difference]: Without dead ends: 58 [2021-11-03 05:11:19,818 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:19,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-03 05:11:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2021-11-03 05:11:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 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-11-03 05:11:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-11-03 05:11:19,833 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2021-11-03 05:11:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:19,833 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-11-03 05:11:19,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-11-03 05:11:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:11:19,834 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:19,834 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:19,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:11:19,835 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1015281714, now seen corresponding path program 1 times [2021-11-03 05:11:19,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:19,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193713356] [2021-11-03 05:11:19,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:19,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:19,917 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:19,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193713356] [2021-11-03 05:11:19,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193713356] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:19,918 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:19,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:11:19,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254134584] [2021-11-03 05:11:19,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:19,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:19,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:19,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:19,921 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:20,039 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-11-03 05:11:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:20,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-11-03 05:11:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:20,040 INFO L225 Difference]: With dead ends: 99 [2021-11-03 05:11:20,040 INFO L226 Difference]: Without dead ends: 97 [2021-11-03 05:11:20,041 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-03 05:11:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2021-11-03 05:11:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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-11-03 05:11:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-11-03 05:11:20,047 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2021-11-03 05:11:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:20,047 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-11-03 05:11:20,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-11-03 05:11:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:11:20,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:20,048 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:20,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:11:20,049 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 197446834, now seen corresponding path program 1 times [2021-11-03 05:11:20,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:20,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440927523] [2021-11-03 05:11:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:20,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:20,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:20,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440927523] [2021-11-03 05:11:20,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440927523] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:20,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:20,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:20,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113715964] [2021-11-03 05:11:20,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:20,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:20,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:20,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:20,086 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:20,125 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-11-03 05:11:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:11:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-11-03 05:11:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:20,127 INFO L225 Difference]: With dead ends: 56 [2021-11-03 05:11:20,127 INFO L226 Difference]: Without dead ends: 52 [2021-11-03 05:11:20,127 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-03 05:11:20,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-11-03 05:11:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-11-03 05:11:20,132 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2021-11-03 05:11:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:20,132 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-11-03 05:11:20,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-11-03 05:11:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 05:11:20,133 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:20,133 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:20,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:11:20,134 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1408957852, now seen corresponding path program 1 times [2021-11-03 05:11:20,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:20,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292941873] [2021-11-03 05:11:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:20,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:20,242 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:20,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292941873] [2021-11-03 05:11:20,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292941873] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:20,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:20,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:20,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619828568] [2021-11-03 05:11:20,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:20,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:20,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:20,245 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:20,384 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-11-03 05:11:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:11:20,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-11-03 05:11:20,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:20,386 INFO L225 Difference]: With dead ends: 117 [2021-11-03 05:11:20,386 INFO L226 Difference]: Without dead ends: 115 [2021-11-03 05:11:20,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:11:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-03 05:11:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 56. [2021-11-03 05:11:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 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-11-03 05:11:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-11-03 05:11:20,398 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 12 [2021-11-03 05:11:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:20,398 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-11-03 05:11:20,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-11-03 05:11:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 05:11:20,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:20,400 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:20,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 05:11:20,401 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1842939021, now seen corresponding path program 1 times [2021-11-03 05:11:20,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:20,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500710267] [2021-11-03 05:11:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:20,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:20,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:20,453 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:20,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500710267] [2021-11-03 05:11:20,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500710267] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:20,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:20,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:11:20,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655793434] [2021-11-03 05:11:20,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:20,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:20,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:20,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:20,455 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:20,524 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-11-03 05:11:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-11-03 05:11:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:20,525 INFO L225 Difference]: With dead ends: 73 [2021-11-03 05:11:20,525 INFO L226 Difference]: Without dead ends: 71 [2021-11-03 05:11:20,526 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-03 05:11:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2021-11-03 05:11:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 53 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-11-03 05:11:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-11-03 05:11:20,531 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2021-11-03 05:11:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:20,531 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-11-03 05:11:20,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-11-03 05:11:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 05:11:20,532 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:20,532 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:20,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 05:11:20,532 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1844662925, now seen corresponding path program 1 times [2021-11-03 05:11:20,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:20,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590604237] [2021-11-03 05:11:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:20,534 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:20,577 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:20,577 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590604237] [2021-11-03 05:11:20,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590604237] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:20,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:20,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:11:20,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273251435] [2021-11-03 05:11:20,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:20,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:20,580 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:20,643 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2021-11-03 05:11:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-11-03 05:11:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:20,644 INFO L225 Difference]: With dead ends: 54 [2021-11-03 05:11:20,644 INFO L226 Difference]: Without dead ends: 52 [2021-11-03 05:11:20,645 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-03 05:11:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-11-03 05:11:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-11-03 05:11:20,649 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 12 [2021-11-03 05:11:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:20,649 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-11-03 05:11:20,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-11-03 05:11:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:11:20,650 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:20,650 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:20,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 05:11:20,651 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:20,651 INFO L85 PathProgramCache]: Analyzing trace with hash -734819501, now seen corresponding path program 1 times [2021-11-03 05:11:20,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:20,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401328781] [2021-11-03 05:11:20,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:20,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:20,742 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:20,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401328781] [2021-11-03 05:11:20,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401328781] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:20,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:20,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:20,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128428804] [2021-11-03 05:11:20,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:20,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:20,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:20,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:20,744 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:20,816 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2021-11-03 05:11:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:11:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-11-03 05:11:20,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:20,818 INFO L225 Difference]: With dead ends: 77 [2021-11-03 05:11:20,818 INFO L226 Difference]: Without dead ends: 75 [2021-11-03 05:11:20,819 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:11:20,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-03 05:11:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2021-11-03 05:11:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-11-03 05:11:20,824 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2021-11-03 05:11:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:20,824 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-11-03 05:11:20,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-11-03 05:11:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:11:20,825 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:20,825 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:20,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 05:11:20,825 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:20,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:20,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1296538901, now seen corresponding path program 1 times [2021-11-03 05:11:20,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:20,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199614048] [2021-11-03 05:11:20,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:20,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:20,906 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:20,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199614048] [2021-11-03 05:11:20,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199614048] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:20,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:20,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:20,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272367741] [2021-11-03 05:11:20,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:20,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:20,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:20,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:20,909 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:21,011 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-11-03 05:11:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:11:21,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-11-03 05:11:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:21,012 INFO L225 Difference]: With dead ends: 91 [2021-11-03 05:11:21,012 INFO L226 Difference]: Without dead ends: 89 [2021-11-03 05:11:21,013 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:11:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-03 05:11:21,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2021-11-03 05:11:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 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-11-03 05:11:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-11-03 05:11:21,019 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 13 [2021-11-03 05:11:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:21,020 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-11-03 05:11:21,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,021 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-11-03 05:11:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:11:21,023 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:21,023 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:21,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 05:11:21,024 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:21,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:21,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1298086046, now seen corresponding path program 1 times [2021-11-03 05:11:21,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:21,025 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907546273] [2021-11-03 05:11:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:21,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:21,071 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:21,071 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907546273] [2021-11-03 05:11:21,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907546273] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:21,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:21,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:11:21,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397770312] [2021-11-03 05:11:21,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:11:21,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:21,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:11:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:21,073 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:21,145 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-11-03 05:11:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-11-03 05:11:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:21,146 INFO L225 Difference]: With dead ends: 80 [2021-11-03 05:11:21,146 INFO L226 Difference]: Without dead ends: 78 [2021-11-03 05:11:21,147 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-03 05:11:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2021-11-03 05:11:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2021-11-03 05:11:21,154 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 13 [2021-11-03 05:11:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:21,154 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2021-11-03 05:11:21,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2021-11-03 05:11:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:11:21,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:21,157 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:21,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 05:11:21,159 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:21,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1349979981, now seen corresponding path program 1 times [2021-11-03 05:11:21,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:21,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376462770] [2021-11-03 05:11:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:21,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:21,262 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:21,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376462770] [2021-11-03 05:11:21,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376462770] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:21,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:21,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:21,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847595389] [2021-11-03 05:11:21,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:21,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:21,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:21,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:21,267 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:21,349 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-11-03 05:11:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:11:21,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-11-03 05:11:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:21,351 INFO L225 Difference]: With dead ends: 69 [2021-11-03 05:11:21,351 INFO L226 Difference]: Without dead ends: 65 [2021-11-03 05:11:21,353 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:11:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-03 05:11:21,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2021-11-03 05:11:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2021-11-03 05:11:21,358 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 13 [2021-11-03 05:11:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:21,358 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2021-11-03 05:11:21,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2021-11-03 05:11:21,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 05:11:21,359 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:21,359 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:21,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 05:11:21,360 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:21,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1585965895, now seen corresponding path program 1 times [2021-11-03 05:11:21,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:21,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302789655] [2021-11-03 05:11:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:21,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:21,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:21,450 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:21,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302789655] [2021-11-03 05:11:21,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302789655] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:21,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:21,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:21,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879390468] [2021-11-03 05:11:21,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:21,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:21,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:21,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:21,454 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:21,559 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-11-03 05:11:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:11:21,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-03 05:11:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:21,560 INFO L225 Difference]: With dead ends: 86 [2021-11-03 05:11:21,560 INFO L226 Difference]: Without dead ends: 84 [2021-11-03 05:11:21,561 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:11:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-03 05:11:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2021-11-03 05:11:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2021-11-03 05:11:21,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 14 [2021-11-03 05:11:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:21,570 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2021-11-03 05:11:21,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2021-11-03 05:11:21,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 05:11:21,571 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:21,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:21,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 05:11:21,572 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:21,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash 433495416, now seen corresponding path program 1 times [2021-11-03 05:11:21,573 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:21,573 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138303264] [2021-11-03 05:11:21,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:21,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:21,618 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:21,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138303264] [2021-11-03 05:11:21,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138303264] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:21,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:21,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:21,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803778684] [2021-11-03 05:11:21,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:21,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:21,620 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:21,646 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2021-11-03 05:11:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:11:21,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-03 05:11:21,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:21,647 INFO L225 Difference]: With dead ends: 62 [2021-11-03 05:11:21,647 INFO L226 Difference]: Without dead ends: 60 [2021-11-03 05:11:21,648 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:21,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-03 05:11:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-03 05:11:21,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 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-11-03 05:11:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-11-03 05:11:21,652 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 15 [2021-11-03 05:11:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:21,653 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-11-03 05:11:21,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,653 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-11-03 05:11:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 05:11:21,653 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:21,653 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:21,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 05:11:21,654 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:21,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash 553460123, now seen corresponding path program 1 times [2021-11-03 05:11:21,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:21,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650028500] [2021-11-03 05:11:21,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:21,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:21,685 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:21,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650028500] [2021-11-03 05:11:21,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650028500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:21,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:21,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:11:21,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67690002] [2021-11-03 05:11:21,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:11:21,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:11:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:11:21,688 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:21,724 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-11-03 05:11:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:11:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-11-03 05:11:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:21,725 INFO L225 Difference]: With dead ends: 60 [2021-11-03 05:11:21,725 INFO L226 Difference]: Without dead ends: 56 [2021-11-03 05:11:21,725 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:11:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-03 05:11:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-03 05:11:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-11-03 05:11:21,730 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2021-11-03 05:11:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:21,732 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-11-03 05:11:21,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-11-03 05:11:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 05:11:21,732 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:21,732 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:21,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 05:11:21,733 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:21,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:21,733 INFO L85 PathProgramCache]: Analyzing trace with hash -995706929, now seen corresponding path program 1 times [2021-11-03 05:11:21,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:21,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601976764] [2021-11-03 05:11:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:21,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:21,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:21,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601976764] [2021-11-03 05:11:21,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601976764] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:21,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137961777] [2021-11-03 05:11:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:21,809 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:21,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:21,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 05:11:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:21,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-03 05:11:21,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:22,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:11:22,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137961777] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:22,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1122494887] [2021-11-03 05:11:22,432 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-03 05:11:22,432 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:22,436 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-03 05:11:22,441 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-03 05:11:22,442 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-03 05:11:22,474 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,476 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 05:11:22,477 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,478 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-11-03 05:11:22,478 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 05:11:22,479 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,479 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-03 05:11:22,481 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2021-11-03 05:11:22,503 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_9|], 21=[|v_#valid_10|]} [2021-11-03 05:11:22,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-11-03 05:11:22,529 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,529 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-03 05:11:22,530 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,530 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-03 05:11:22,531 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 05:11:22,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,555 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:22,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-11-03 05:11:22,591 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,596 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-03 05:11:22,596 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,597 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-03 05:11:22,597 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 05:11:22,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,617 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,619 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,626 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-11-03 05:11:22,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-03 05:11:22,627 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:111 [2021-11-03 05:11:22,645 INFO L180 QuantifierPusher]: treesize reduction 5, result has 95.9 percent of original size [2021-11-03 05:11:22,650 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-11-03 05:11:22,656 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,661 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-03 05:11:22,679 INFO L180 QuantifierPusher]: treesize reduction 8, result has 95.5 percent of original size [2021-11-03 05:11:22,694 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-11-03 05:11:22,709 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,715 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 155 [2021-11-03 05:11:22,721 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,728 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2021-11-03 05:11:22,751 INFO L180 QuantifierPusher]: treesize reduction 8, result has 96.4 percent of original size [2021-11-03 05:11:22,758 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 208 [2021-11-03 05:11:22,768 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,776 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 195 [2021-11-03 05:11:22,783 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:22,791 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 204 [2021-11-03 05:11:22,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:22,952 INFO L180 QuantifierPusher]: treesize reduction 8, result has 96.4 percent of original size [2021-11-03 05:11:22,966 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 212 [2021-11-03 05:11:22,980 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:23,004 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 230 [2021-11-03 05:11:23,017 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:23,050 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 223 [2021-11-03 05:11:23,065 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:23,083 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 232 [2021-11-03 05:11:23,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,215 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-03 05:11:23,218 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-03 05:11:23,223 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:23,230 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-03 05:11:23,235 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:23,240 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-11-03 05:11:23,258 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-03 05:11:23,263 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-03 05:11:23,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,303 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:23,482 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:23,501 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 270 [2021-11-03 05:11:23,504 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-03 05:11:26,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 05:11:26,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:26,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2021-11-03 05:11:26,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775071569] [2021-11-03 05:11:26,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:11:26,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:11:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2021-11-03 05:11:26,354 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:26,616 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2021-11-03 05:11:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-03 05:11:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 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 17 [2021-11-03 05:11:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:26,618 INFO L225 Difference]: With dead ends: 103 [2021-11-03 05:11:26,618 INFO L226 Difference]: Without dead ends: 101 [2021-11-03 05:11:26,619 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2021-11-03 05:11:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-03 05:11:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 52. [2021-11-03 05:11:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-11-03 05:11:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-11-03 05:11:26,624 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 17 [2021-11-03 05:11:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:26,624 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-11-03 05:11:26,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-11-03 05:11:26,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-03 05:11:26,625 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:26,625 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:26,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:26,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:26,846 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash -7486289, now seen corresponding path program 1 times [2021-11-03 05:11:26,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:26,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051368275] [2021-11-03 05:11:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:26,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:26,910 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:26,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051368275] [2021-11-03 05:11:26,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051368275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:26,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:26,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:26,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363516731] [2021-11-03 05:11:26,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:26,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:26,912 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:27,002 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2021-11-03 05:11:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:11:27,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-11-03 05:11:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:27,003 INFO L225 Difference]: With dead ends: 67 [2021-11-03 05:11:27,003 INFO L226 Difference]: Without dead ends: 65 [2021-11-03 05:11:27,004 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-11-03 05:11:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-03 05:11:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2021-11-03 05:11:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 46 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-11-03 05:11:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2021-11-03 05:11:27,008 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 17 [2021-11-03 05:11:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:27,008 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2021-11-03 05:11:27,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2021-11-03 05:11:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:11:27,011 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:27,011 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:27,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-03 05:11:27,012 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1807516650, now seen corresponding path program 1 times [2021-11-03 05:11:27,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:27,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109349880] [2021-11-03 05:11:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:27,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:27,090 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:27,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109349880] [2021-11-03 05:11:27,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109349880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:27,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:27,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:27,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801529260] [2021-11-03 05:11:27,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:27,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:27,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:27,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:27,094 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:27,181 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2021-11-03 05:11:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:11:27,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-03 05:11:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:27,183 INFO L225 Difference]: With dead ends: 59 [2021-11-03 05:11:27,183 INFO L226 Difference]: Without dead ends: 57 [2021-11-03 05:11:27,183 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-11-03 05:11:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-03 05:11:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2021-11-03 05:11:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2021-11-03 05:11:27,196 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2021-11-03 05:11:27,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:27,196 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2021-11-03 05:11:27,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2021-11-03 05:11:27,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:11:27,197 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:27,197 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:27,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-03 05:11:27,197 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:27,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1754075570, now seen corresponding path program 1 times [2021-11-03 05:11:27,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:27,198 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506970126] [2021-11-03 05:11:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:27,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:27,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:27,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506970126] [2021-11-03 05:11:27,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506970126] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:11:27,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:11:27,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:11:27,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465990753] [2021-11-03 05:11:27,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-03 05:11:27,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-03 05:11:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:11:27,275 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:27,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:27,350 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2021-11-03 05:11:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:11:27,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-11-03 05:11:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:27,351 INFO L225 Difference]: With dead ends: 42 [2021-11-03 05:11:27,351 INFO L226 Difference]: Without dead ends: 19 [2021-11-03 05:11:27,352 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:11:27,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-03 05:11:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-03 05:11:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 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-11-03 05:11:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2021-11-03 05:11:27,355 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2021-11-03 05:11:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:27,355 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2021-11-03 05:11:27,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-11-03 05:11:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-03 05:11:27,356 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:11:27,356 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:11:27,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-03 05:11:27,357 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2021-11-03 05:11:27,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:11:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash -808942776, now seen corresponding path program 1 times [2021-11-03 05:11:27,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:11:27,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697218385] [2021-11-03 05:11:27,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:27,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:11:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:27,429 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:11:27,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697218385] [2021-11-03 05:11:27,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697218385] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 05:11:27,430 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811094321] [2021-11-03 05:11:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:11:27,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:11:27,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 05:11:27,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-03 05:11:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:11:27,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-03 05:11:27,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:11:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:11:27,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:11:27,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:11:27,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811094321] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-03 05:11:27,907 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [569634509] [2021-11-03 05:11:27,912 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-03 05:11:27,912 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 05:11:27,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-03 05:11:27,912 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-03 05:11:27,913 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-03 05:11:27,929 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:27,931 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 05:11:27,931 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:27,932 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-11-03 05:11:27,932 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 05:11:27,933 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:27,933 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-03 05:11:27,935 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2021-11-03 05:11:27,943 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_10|], 21=[|v_#valid_11|]} [2021-11-03 05:11:27,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-11-03 05:11:27,959 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:27,960 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-03 05:11:27,960 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:27,961 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-03 05:11:27,961 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 05:11:27,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:27,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:27,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 05:11:27,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-11-03 05:11:27,999 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,001 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-03 05:11:28,002 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,002 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-03 05:11:28,003 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 05:11:28,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,007 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,009 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,010 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-11-03 05:11:28,011 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-03 05:11:28,011 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:111 [2021-11-03 05:11:28,018 INFO L180 QuantifierPusher]: treesize reduction 5, result has 95.9 percent of original size [2021-11-03 05:11:28,021 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-11-03 05:11:28,025 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,031 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-03 05:11:28,045 INFO L180 QuantifierPusher]: treesize reduction 8, result has 95.5 percent of original size [2021-11-03 05:11:28,049 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-11-03 05:11:28,056 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,061 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 155 [2021-11-03 05:11:28,065 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,069 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2021-11-03 05:11:28,079 INFO L180 QuantifierPusher]: treesize reduction 8, result has 96.4 percent of original size [2021-11-03 05:11:28,084 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 208 [2021-11-03 05:11:28,090 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,099 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 210 [2021-11-03 05:11:28,122 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,128 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 219 [2021-11-03 05:11:28,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,188 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,205 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-03 05:11:28,209 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-03 05:11:28,213 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,218 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2021-11-03 05:11:28,222 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,226 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 137 [2021-11-03 05:11:28,234 INFO L180 QuantifierPusher]: treesize reduction 66, result has 58.2 percent of original size [2021-11-03 05:11:28,237 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-11-03 05:11:28,243 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,246 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-11-03 05:11:28,265 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-03 05:11:28,269 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-03 05:11:28,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:28,446 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 05:11:28,458 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 270 [2021-11-03 05:11:28,460 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-03 05:11:31,254 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-03 05:11:31,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-03 05:11:31,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2021-11-03 05:11:31,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993703972] [2021-11-03 05:11:31,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-03 05:11:31,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:11:31,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-03 05:11:31,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-11-03 05:11:31,256 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:11:31,359 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-11-03 05:11:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 05:11:31,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-03 05:11:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:11:31,359 INFO L225 Difference]: With dead ends: 30 [2021-11-03 05:11:31,359 INFO L226 Difference]: Without dead ends: 0 [2021-11-03 05:11:31,360 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-11-03 05:11:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-03 05:11:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-03 05:11:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-03 05:11:31,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2021-11-03 05:11:31,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:11:31,361 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-03 05:11:31,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:11:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-03 05:11:31,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-03 05:11:31,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,364 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,365 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,366 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,367 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:11:31,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-03 05:11:31,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 05:11:31,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-03 05:11:31,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:31,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:31,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:31,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:31,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:31,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 05:11:32,242 INFO L857 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2021-11-03 05:11:32,242 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L853 garLoopResultBuilder]: At program point L250(lines 102 252) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2021-11-03 05:11:32,243 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2021-11-03 05:11:32,244 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2021-11-03 05:11:32,244 INFO L857 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2021-11-03 05:11:32,244 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2021-11-03 05:11:32,244 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-03 05:11:32,244 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2021-11-03 05:11:32,244 INFO L857 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-11-03 05:11:32,245 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2021-11-03 05:11:32,245 INFO L857 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2021-11-03 05:11:32,245 INFO L857 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2021-11-03 05:11:32,245 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2021-11-03 05:11:32,245 INFO L857 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2021-11-03 05:11:32,245 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2021-11-03 05:11:32,246 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-11-03 05:11:32,246 INFO L857 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2021-11-03 05:11:32,246 INFO L857 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2021-11-03 05:11:32,246 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2021-11-03 05:11:32,246 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2021-11-03 05:11:32,246 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2021-11-03 05:11:32,247 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2021-11-03 05:11:32,247 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2021-11-03 05:11:32,247 INFO L857 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2021-11-03 05:11:32,247 INFO L853 garLoopResultBuilder]: At program point L328(lines 32 368) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~main__t~0 1)) (.cse2 (< 0 ULTIMATE.start_main_~main__tagbuf_len~0))) (let ((.cse0 (let ((.cse3 (<= 1 ULTIMATE.start_main_~main__t~0)) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)))) (or (and .cse3 .cse1 .cse4 .cse2) (and .cse3 .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))))))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0) (and (or (and .cse0 .cse1 .cse2) (and .cse2 (= ULTIMATE.start_main_~main__t~0 0))) (not (= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0)))))) [2021-11-03 05:11:32,247 INFO L853 garLoopResultBuilder]: At program point L196(lines 60 254) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) [2021-11-03 05:11:32,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2021-11-03 05:11:32,248 INFO L857 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2021-11-03 05:11:32,248 INFO L857 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-11-03 05:11:32,248 INFO L857 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2021-11-03 05:11:32,248 INFO L857 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2021-11-03 05:11:32,248 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2021-11-03 05:11:32,249 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2021-11-03 05:11:32,249 INFO L857 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2021-11-03 05:11:32,249 INFO L857 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2021-11-03 05:11:32,249 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2021-11-03 05:11:32,249 INFO L857 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2021-11-03 05:11:32,249 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-11-03 05:11:32,250 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2021-11-03 05:11:32,250 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2021-11-03 05:11:32,250 INFO L857 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2021-11-03 05:11:32,250 INFO L857 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2021-11-03 05:11:32,250 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-03 05:11:32,250 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2021-11-03 05:11:32,251 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2021-11-03 05:11:32,251 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2021-11-03 05:11:32,251 INFO L857 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2021-11-03 05:11:32,251 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2021-11-03 05:11:32,251 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2021-11-03 05:11:32,251 INFO L857 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2021-11-03 05:11:32,251 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2021-11-03 05:11:32,252 INFO L860 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: true [2021-11-03 05:11:32,252 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2021-11-03 05:11:32,252 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2021-11-03 05:11:32,252 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-11-03 05:11:32,252 INFO L860 garLoopResultBuilder]: At program point L373(lines 15 375) the Hoare annotation is: true [2021-11-03 05:11:32,252 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2021-11-03 05:11:32,253 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2021-11-03 05:11:32,253 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2021-11-03 05:11:32,253 INFO L857 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2021-11-03 05:11:32,253 INFO L853 garLoopResultBuilder]: At program point L357(lines 283 364) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~main__t~0 0))) (let ((.cse0 (let ((.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0))) (.cse3 (<= 0 ULTIMATE.start_main_~main__t~0))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) .cse2 .cse3) (and .cse2 .cse1 .cse3))))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~17) (< ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0) (and (< 0 ULTIMATE.start_main_~main__tagbuf_len~0) .cse0 .cse1)))) [2021-11-03 05:11:32,256 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-11-03 05:11:32,258 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:11:32,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:11:32 BoogieIcfgContainer [2021-11-03 05:11:32,275 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:11:32,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:11:32,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:11:32,276 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:11:32,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:11:18" (3/4) ... [2021-11-03 05:11:32,280 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-03 05:11:32,292 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-03 05:11:32,292 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-03 05:11:32,293 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:11:32,294 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-03 05:11:32,358 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 05:11:32,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:11:32,359 INFO L168 Benchmark]: Toolchain (without parser) took 15019.92 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 82.9 MB in the beginning and 82.9 MB in the end (delta: 18.7 kB). Peak memory consumption was 49.8 MB. Max. memory is 16.1 GB. [2021-11-03 05:11:32,359 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 113.2 MB. Free memory is still 68.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:11:32,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.48 ms. Allocated memory is still 113.2 MB. Free memory was 82.9 MB in the beginning and 82.0 MB in the end (delta: 908.9 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:11:32,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.72 ms. Allocated memory is still 113.2 MB. Free memory was 82.0 MB in the beginning and 79.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:11:32,361 INFO L168 Benchmark]: Boogie Preprocessor took 24.01 ms. Allocated memory is still 113.2 MB. Free memory was 79.8 MB in the beginning and 78.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:11:32,361 INFO L168 Benchmark]: RCFGBuilder took 476.21 ms. Allocated memory is still 113.2 MB. Free memory was 78.7 MB in the beginning and 63.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-03 05:11:32,361 INFO L168 Benchmark]: TraceAbstraction took 14046.26 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 63.1 MB in the beginning and 89.2 MB in the end (delta: -26.0 MB). Peak memory consumption was 73.8 MB. Max. memory is 16.1 GB. [2021-11-03 05:11:32,362 INFO L168 Benchmark]: Witness Printer took 82.45 ms. Allocated memory is still 163.6 MB. Free memory was 89.2 MB in the beginning and 82.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-03 05:11:32,364 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.18 ms. Allocated memory is still 113.2 MB. Free memory is still 68.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 344.48 ms. Allocated memory is still 113.2 MB. Free memory was 82.9 MB in the beginning and 82.0 MB in the end (delta: 908.9 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.72 ms. Allocated memory is still 113.2 MB. Free memory was 82.0 MB in the beginning and 79.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.01 ms. Allocated memory is still 113.2 MB. Free memory was 79.8 MB in the beginning and 78.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 476.21 ms. Allocated memory is still 113.2 MB. Free memory was 78.7 MB in the beginning and 63.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14046.26 ms. Allocated memory was 113.2 MB in the beginning and 163.6 MB in the end (delta: 50.3 MB). Free memory was 63.1 MB in the beginning and 89.2 MB in the end (delta: -26.0 MB). Peak memory consumption was 73.8 MB. Max. memory is 16.1 GB. * Witness Printer took 82.45 ms. Allocated memory is still 163.6 MB. Free memory was 89.2 MB in the beginning and 82.9 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 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: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 127]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 143]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 155]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 225]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 237]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 279]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 298]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 310]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 339]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 351]: 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, 69 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 928 SDtfs, 1467 SDslu, 1457 SDs, 0 SdLazy, 1803 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 108 SyntacticMatches, 10 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 17 NumberOfFragments, 177 HoareAnnotationTreeSize, 6 FomulaSimplifications, 561603 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 169502 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 1520 SizeOfPredicates, 6 NumberOfNonLiveVariables, 233 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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 17 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: ((main__t < main__tagbuf_len && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && main__t < main__tagbuf_len) && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t) || ((!(__VERIFIER_assert__cond == 0) && main__t == 0) && 0 <= main__t))) || ((0 < main__tagbuf_len && (((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t) || ((!(__VERIFIER_assert__cond == 0) && main__t == 0) && 0 <= main__t))) && main__t == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((1 <= __VERIFIER_assert__cond && main__t < main__tagbuf_len) && ((((1 <= main__t && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len) || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || ((((((((1 <= main__t && main__t <= 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__tagbuf_len) || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__t <= 1) && 0 < main__tagbuf_len) || (0 < main__tagbuf_len && main__t == 0)) && !(main__t == main__tagbuf_len)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-03 05:11:32,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a815d86-e670-4397-9fd9-c1e0e6fdd80d/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE