./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 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/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_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8 --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-47ea020 [2021-11-07 01:47:35,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:47:35,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:47:35,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:47:35,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:47:35,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:47:35,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:47:35,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:47:35,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:47:35,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:47:35,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:47:35,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:47:35,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:47:35,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:47:35,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:47:35,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:47:35,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:47:35,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:47:35,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:47:35,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:47:35,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:47:35,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:47:35,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:47:35,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:47:35,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:47:35,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:47:35,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:47:35,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:47:35,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:47:35,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:47:35,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:47:35,899 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:47:35,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:47:35,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:47:35,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:47:35,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:47:35,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:47:35,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:47:35,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:47:35,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:47:35,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:47:35,907 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 01:47:35,939 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:47:35,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:47:35,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:47:35,940 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:47:35,941 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:47:35,941 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:47:35,941 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:47:35,941 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:47:35,942 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:47:35,942 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:47:35,942 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:47:35,942 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:47:35,943 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:47:35,943 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:47:35,943 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:47:35,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:47:35,944 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:47:35,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:47:35,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:47:35,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:47:35,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 01:47:35,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:47:35,946 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 01:47:35,946 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:47:35,946 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:47:35,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 01:47:35,947 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:47:35,947 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 01:47:35,947 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:47:35,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:47:35,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:47:35,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:47:35,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:47:35,949 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 01:47:35,949 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:47:35,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:47:35,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 01:47:35,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:47:35,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:47:35,950 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_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/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_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8 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-07 01:47:36,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:47:36,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:47:36,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:47:36,318 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:47:36,319 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:47:36,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-11-07 01:47:36,430 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/data/957bafe19/452885eb9447493dafbca467aba1c0de/FLAG6e496e185 [2021-11-07 01:47:37,004 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:47:37,004 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2021-11-07 01:47:37,012 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/data/957bafe19/452885eb9447493dafbca467aba1c0de/FLAG6e496e185 [2021-11-07 01:47:37,302 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/data/957bafe19/452885eb9447493dafbca467aba1c0de [2021-11-07 01:47:37,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:47:37,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:47:37,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:47:37,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:47:37,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:47:37,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48574e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37, skipping insertion in model container [2021-11-07 01:47:37,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:47:37,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:47:37,589 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-11-07 01:47:37,594 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-11-07 01:47:37,597 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-11-07 01:47:37,599 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-11-07 01:47:37,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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-11-07 01:47:37,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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-11-07 01:47:37,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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-11-07 01:47:37,612 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-11-07 01:47:37,614 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-11-07 01:47:37,617 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-11-07 01:47:37,621 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-11-07 01:47:37,624 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-11-07 01:47:37,627 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-11-07 01:47:37,630 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-11-07 01:47:37,632 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-11-07 01:47:37,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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-11-07 01:47:37,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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-11-07 01:47:37,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:47:37,651 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:47:37,670 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1123,1136] [2021-11-07 01:47:37,672 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1338,1351] [2021-11-07 01:47:37,676 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1654,1667] [2021-11-07 01:47:37,678 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[1869,1882] [2021-11-07 01:47:37,681 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2402,2415] [2021-11-07 01:47:37,683 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2617,2630] [2021-11-07 01:47:37,686 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[2919,2932] [2021-11-07 01:47:37,688 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3134,3147] [2021-11-07 01:47:37,690 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3404,3417] [2021-11-07 01:47:37,697 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[3622,3635] [2021-11-07 01:47:37,701 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4106,4119] [2021-11-07 01:47:37,703 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4324,4337] [2021-11-07 01:47:37,721 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[4820,4833] [2021-11-07 01:47:37,723 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5221,5234] [2021-11-07 01:47:37,725 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5439,5452] [2021-11-07 01:47:37,727 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[5881,5894] [2021-11-07 01:47:37,729 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_38d02475-004f-4788-965c-ac2dd21255a6/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+nlh-reducer.c[6099,6112] [2021-11-07 01:47:37,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:47:37,764 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:47:37,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37 WrapperNode [2021-11-07 01:47:37,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:47:37,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:47:37,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:47:37,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:47:37,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:47:37,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:47:37,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:47:37,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:47:37,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:47:37,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:47:37,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:47:37,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:47:37,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (1/1) ... [2021-11-07 01:47:37,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:47:37,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:47:37,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:47:37,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:47:37,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:47:37,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:47:37,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:47:37,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:47:38,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:47:38,424 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-07 01:47:38,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:38 BoogieIcfgContainer [2021-11-07 01:47:38,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:47:38,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:47:38,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:47:38,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:47:38,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:47:37" (1/3) ... [2021-11-07 01:47:38,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c619ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:38, skipping insertion in model container [2021-11-07 01:47:38,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:47:37" (2/3) ... [2021-11-07 01:47:38,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77c619ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:47:38, skipping insertion in model container [2021-11-07 01:47:38,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:38" (3/3) ... [2021-11-07 01:47:38,443 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2021-11-07 01:47:38,449 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:47:38,450 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2021-11-07 01:47:38,511 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:47:38,519 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-07 01:47:38,520 INFO L340 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2021-11-07 01:47:38,543 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-07 01:47:38,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:47:38,550 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:38,551 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:38,552 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-07 01:47:38,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash 2133700231, now seen corresponding path program 1 times [2021-11-07 01:47:38,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:38,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448100571] [2021-11-07 01:47:38,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:38,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:38,867 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-07 01:47:38,868 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:38,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448100571] [2021-11-07 01:47:38,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448100571] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:38,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:38,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:47:38,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96488010] [2021-11-07 01:47:38,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:47:38,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:47:38,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:47:38,899 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-07 01:47:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:39,055 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2021-11-07 01:47:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:39,057 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-07 01:47:39,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:39,070 INFO L225 Difference]: With dead ends: 120 [2021-11-07 01:47:39,070 INFO L226 Difference]: Without dead ends: 108 [2021-11-07 01:47:39,073 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-07 01:47:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-07 01:47:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2021-11-07 01:47:39,117 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-07 01:47:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-11-07 01:47:39,121 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 7 [2021-11-07 01:47:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:39,121 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-11-07 01:47:39,122 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-07 01:47:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-11-07 01:47:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 01:47:39,123 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:39,123 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:39,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:47:39,124 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-07 01:47:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2130064740, now seen corresponding path program 1 times [2021-11-07 01:47:39,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:39,126 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425025975] [2021-11-07 01:47:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:39,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:39,195 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-07 01:47:39,196 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:39,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425025975] [2021-11-07 01:47:39,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425025975] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:39,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:39,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:47:39,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987747652] [2021-11-07 01:47:39,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:47:39,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:39,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:47:39,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:47:39,202 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-07 01:47:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:39,300 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-11-07 01:47:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:47:39,301 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-07 01:47:39,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:39,303 INFO L225 Difference]: With dead ends: 64 [2021-11-07 01:47:39,303 INFO L226 Difference]: Without dead ends: 62 [2021-11-07 01:47:39,304 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-07 01:47:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-07 01:47:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-07 01:47:39,328 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-07 01:47:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2021-11-07 01:47:39,330 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 7 [2021-11-07 01:47:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:39,330 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2021-11-07 01:47:39,331 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-07 01:47:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2021-11-07 01:47:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-07 01:47:39,331 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:39,332 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:39,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:47:39,332 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-07 01:47:39,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1607501556, now seen corresponding path program 1 times [2021-11-07 01:47:39,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:39,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333695542] [2021-11-07 01:47:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:39,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:39,469 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-07 01:47:39,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:39,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333695542] [2021-11-07 01:47:39,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333695542] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:39,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:39,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:47:39,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862673110] [2021-11-07 01:47:39,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:47:39,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:47:39,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:47:39,478 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-07 01:47:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:39,590 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2021-11-07 01:47:39,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:39,591 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-07 01:47:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:39,593 INFO L225 Difference]: With dead ends: 68 [2021-11-07 01:47:39,596 INFO L226 Difference]: Without dead ends: 66 [2021-11-07 01:47:39,597 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-07 01:47:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-11-07 01:47:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2021-11-07 01:47:39,608 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-07 01:47:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-11-07 01:47:39,613 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2021-11-07 01:47:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:39,614 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-11-07 01:47:39,614 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-07 01:47:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-11-07 01:47:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:47:39,615 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:39,615 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:39,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:47:39,617 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-07 01:47:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -448408979, now seen corresponding path program 1 times [2021-11-07 01:47:39,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:39,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212855939] [2021-11-07 01:47:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:39,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:39,770 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-07 01:47:39,770 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:39,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212855939] [2021-11-07 01:47:39,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212855939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:39,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:39,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:47:39,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912819741] [2021-11-07 01:47:39,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:47:39,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:47:39,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:47:39,773 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-07 01:47:39,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:39,909 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2021-11-07 01:47:39,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:39,910 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-07 01:47:39,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:39,911 INFO L225 Difference]: With dead ends: 66 [2021-11-07 01:47:39,911 INFO L226 Difference]: Without dead ends: 64 [2021-11-07 01:47:39,912 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-07 01:47:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-11-07 01:47:39,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2021-11-07 01:47:39,920 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-07 01:47:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2021-11-07 01:47:39,921 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 10 [2021-11-07 01:47:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:39,922 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2021-11-07 01:47:39,922 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-07 01:47:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2021-11-07 01:47:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:47:39,923 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:39,923 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:39,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:47:39,924 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-07 01:47:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1379104200, now seen corresponding path program 1 times [2021-11-07 01:47:39,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:39,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180907350] [2021-11-07 01:47:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:39,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:40,029 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-07 01:47:40,030 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:40,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180907350] [2021-11-07 01:47:40,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180907350] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:40,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:40,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:47:40,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754157224] [2021-11-07 01:47:40,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:47:40,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:40,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:47:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:47:40,038 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-07 01:47:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:40,157 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-11-07 01:47:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:40,158 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-07 01:47:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:40,159 INFO L225 Difference]: With dead ends: 64 [2021-11-07 01:47:40,159 INFO L226 Difference]: Without dead ends: 62 [2021-11-07 01:47:40,159 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-07 01:47:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-07 01:47:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2021-11-07 01:47:40,167 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-07 01:47:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-11-07 01:47:40,168 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 10 [2021-11-07 01:47:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:40,168 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-11-07 01:47:40,169 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-07 01:47:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-11-07 01:47:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:47:40,170 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:40,170 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:40,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:47:40,171 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-07 01:47:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1015772272, now seen corresponding path program 1 times [2021-11-07 01:47:40,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:40,172 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2806355] [2021-11-07 01:47:40,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:40,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:40,245 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-07 01:47:40,246 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:40,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2806355] [2021-11-07 01:47:40,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2806355] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:40,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:40,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:47:40,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686758207] [2021-11-07 01:47:40,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:47:40,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:47:40,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:47:40,253 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-07 01:47:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:40,327 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2021-11-07 01:47:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:47:40,327 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-07 01:47:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:40,328 INFO L225 Difference]: With dead ends: 62 [2021-11-07 01:47:40,328 INFO L226 Difference]: Without dead ends: 58 [2021-11-07 01:47:40,329 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-07 01:47:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-11-07 01:47:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2021-11-07 01:47:40,335 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-07 01:47:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-11-07 01:47:40,335 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2021-11-07 01:47:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:40,336 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-11-07 01:47:40,336 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-07 01:47:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-11-07 01:47:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:47:40,337 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:40,337 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:40,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:47:40,338 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-07 01:47:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1015281714, now seen corresponding path program 1 times [2021-11-07 01:47:40,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:40,339 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815677897] [2021-11-07 01:47:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:40,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:40,383 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-07 01:47:40,383 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:40,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815677897] [2021-11-07 01:47:40,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815677897] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:40,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:40,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:47:40,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104450668] [2021-11-07 01:47:40,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:47:40,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:47:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:47:40,386 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-07 01:47:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:40,492 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2021-11-07 01:47:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:40,492 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-07 01:47:40,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:40,493 INFO L225 Difference]: With dead ends: 99 [2021-11-07 01:47:40,493 INFO L226 Difference]: Without dead ends: 97 [2021-11-07 01:47:40,494 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-07 01:47:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-11-07 01:47:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2021-11-07 01:47:40,499 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-07 01:47:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-11-07 01:47:40,500 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 11 [2021-11-07 01:47:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:40,501 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-11-07 01:47:40,501 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-07 01:47:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-11-07 01:47:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-07 01:47:40,502 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:40,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:40,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:47:40,502 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-07 01:47:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:40,503 INFO L85 PathProgramCache]: Analyzing trace with hash 197446834, now seen corresponding path program 1 times [2021-11-07 01:47:40,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:40,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784178416] [2021-11-07 01:47:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:40,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:40,542 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-07 01:47:40,542 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:40,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784178416] [2021-11-07 01:47:40,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784178416] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:40,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:40,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:47:40,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714394364] [2021-11-07 01:47:40,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:47:40,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:47:40,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:47:40,545 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-07 01:47:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:40,594 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-11-07 01:47:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:47:40,603 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-07 01:47:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:40,604 INFO L225 Difference]: With dead ends: 56 [2021-11-07 01:47:40,604 INFO L226 Difference]: Without dead ends: 52 [2021-11-07 01:47:40,605 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-07 01:47:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-07 01:47:40,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-11-07 01:47:40,616 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-07 01:47:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-11-07 01:47:40,617 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2021-11-07 01:47:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:40,617 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-11-07 01:47:40,618 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-07 01:47:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-11-07 01:47:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:47:40,619 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:40,619 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:40,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:47:40,619 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-07 01:47:40,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1408957852, now seen corresponding path program 1 times [2021-11-07 01:47:40,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:40,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964648155] [2021-11-07 01:47:40,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:40,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:40,807 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-07 01:47:40,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:40,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964648155] [2021-11-07 01:47:40,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964648155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:40,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:40,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:40,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878335106] [2021-11-07 01:47:40,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:40,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:40,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:40,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:40,810 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-07 01:47:40,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:40,983 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-11-07 01:47:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:47:40,983 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-07 01:47:40,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:40,985 INFO L225 Difference]: With dead ends: 117 [2021-11-07 01:47:40,985 INFO L226 Difference]: Without dead ends: 115 [2021-11-07 01:47:40,985 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-07 01:47:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-11-07 01:47:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 56. [2021-11-07 01:47:40,992 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-07 01:47:40,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-11-07 01:47:40,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 12 [2021-11-07 01:47:40,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:40,993 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-11-07 01:47:40,993 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-07 01:47:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-11-07 01:47:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:47:40,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:40,995 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:40,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:47:40,995 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-07 01:47:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1842939021, now seen corresponding path program 1 times [2021-11-07 01:47:40,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:40,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427705200] [2021-11-07 01:47:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:40,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:41,037 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-07 01:47:41,038 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:41,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427705200] [2021-11-07 01:47:41,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427705200] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:41,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:41,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:47:41,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251127948] [2021-11-07 01:47:41,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:47:41,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:47:41,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:47:41,041 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-07 01:47:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:41,119 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-11-07 01:47:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:41,119 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-07 01:47:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:41,120 INFO L225 Difference]: With dead ends: 73 [2021-11-07 01:47:41,120 INFO L226 Difference]: Without dead ends: 71 [2021-11-07 01:47:41,121 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-07 01:47:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-11-07 01:47:41,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2021-11-07 01:47:41,126 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-07 01:47:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2021-11-07 01:47:41,126 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 12 [2021-11-07 01:47:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:41,127 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2021-11-07 01:47:41,127 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-07 01:47:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2021-11-07 01:47:41,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-07 01:47:41,128 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:41,128 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:41,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:47:41,129 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-07 01:47:41,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1844662925, now seen corresponding path program 1 times [2021-11-07 01:47:41,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:41,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664673051] [2021-11-07 01:47:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:41,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:41,170 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-07 01:47:41,170 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:41,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664673051] [2021-11-07 01:47:41,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664673051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:41,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:41,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:47:41,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860703022] [2021-11-07 01:47:41,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:47:41,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:41,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:47:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:47:41,173 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-07 01:47:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:41,234 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2021-11-07 01:47:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:41,235 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-07 01:47:41,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:41,235 INFO L225 Difference]: With dead ends: 54 [2021-11-07 01:47:41,235 INFO L226 Difference]: Without dead ends: 52 [2021-11-07 01:47:41,236 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-07 01:47:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-11-07 01:47:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-11-07 01:47:41,240 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-07 01:47:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-11-07 01:47:41,241 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 12 [2021-11-07 01:47:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:41,241 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-11-07 01:47:41,241 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-07 01:47:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-11-07 01:47:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:47:41,242 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:41,242 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:41,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:47:41,243 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-07 01:47:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -734819501, now seen corresponding path program 1 times [2021-11-07 01:47:41,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:41,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27021633] [2021-11-07 01:47:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:41,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:41,342 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-07 01:47:41,342 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:41,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27021633] [2021-11-07 01:47:41,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27021633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:41,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:41,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:41,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529672171] [2021-11-07 01:47:41,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:41,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:41,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:41,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:41,344 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-07 01:47:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:41,427 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2021-11-07 01:47:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 01:47:41,427 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-07 01:47:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:41,429 INFO L225 Difference]: With dead ends: 77 [2021-11-07 01:47:41,429 INFO L226 Difference]: Without dead ends: 75 [2021-11-07 01:47:41,430 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-07 01:47:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-11-07 01:47:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2021-11-07 01:47:41,434 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-07 01:47:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-11-07 01:47:41,435 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2021-11-07 01:47:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:41,435 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-11-07 01:47:41,435 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-07 01:47:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-11-07 01:47:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:47:41,436 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:41,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:41,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:47:41,437 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-07 01:47:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:41,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1296538901, now seen corresponding path program 1 times [2021-11-07 01:47:41,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:41,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964865038] [2021-11-07 01:47:41,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:41,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:41,515 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-07 01:47:41,515 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:41,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964865038] [2021-11-07 01:47:41,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964865038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:41,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:41,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:41,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723013907] [2021-11-07 01:47:41,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:41,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:41,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:41,518 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-07 01:47:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:41,623 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2021-11-07 01:47:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:47:41,623 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-07 01:47:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:41,624 INFO L225 Difference]: With dead ends: 91 [2021-11-07 01:47:41,624 INFO L226 Difference]: Without dead ends: 89 [2021-11-07 01:47:41,630 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-07 01:47:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-11-07 01:47:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 60. [2021-11-07 01:47:41,635 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-07 01:47:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-11-07 01:47:41,636 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 13 [2021-11-07 01:47:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:41,638 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-11-07 01:47:41,638 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-07 01:47:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-11-07 01:47:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:47:41,644 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:41,644 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:41,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:47:41,644 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-07 01:47:41,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1298086046, now seen corresponding path program 1 times [2021-11-07 01:47:41,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:41,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471384141] [2021-11-07 01:47:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:41,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:41,698 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-07 01:47:41,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:41,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471384141] [2021-11-07 01:47:41,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471384141] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:41,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:41,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:47:41,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482875782] [2021-11-07 01:47:41,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:47:41,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:47:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:47:41,700 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-07 01:47:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:41,778 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2021-11-07 01:47:41,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:41,779 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-07 01:47:41,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:41,779 INFO L225 Difference]: With dead ends: 80 [2021-11-07 01:47:41,780 INFO L226 Difference]: Without dead ends: 78 [2021-11-07 01:47:41,781 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-07 01:47:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-11-07 01:47:41,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2021-11-07 01:47:41,796 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-07 01:47:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2021-11-07 01:47:41,797 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 13 [2021-11-07 01:47:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:41,797 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2021-11-07 01:47:41,797 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-07 01:47:41,797 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2021-11-07 01:47:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 01:47:41,798 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:41,798 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:41,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 01:47:41,799 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-07 01:47:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1349979981, now seen corresponding path program 1 times [2021-11-07 01:47:41,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:41,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347299995] [2021-11-07 01:47:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:41,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:41,902 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-07 01:47:41,902 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:41,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347299995] [2021-11-07 01:47:41,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347299995] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:41,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:41,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:41,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335055243] [2021-11-07 01:47:41,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:41,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:41,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:41,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:41,904 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-07 01:47:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:41,992 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-11-07 01:47:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:47:41,993 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-07 01:47:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:41,994 INFO L225 Difference]: With dead ends: 69 [2021-11-07 01:47:41,994 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 01:47:41,994 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-07 01:47:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 01:47:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2021-11-07 01:47:41,999 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-07 01:47:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2021-11-07 01:47:41,999 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 13 [2021-11-07 01:47:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:42,000 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2021-11-07 01:47:42,000 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-07 01:47:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2021-11-07 01:47:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:47:42,001 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:42,001 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:42,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:47:42,001 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-07 01:47:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:42,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1585965895, now seen corresponding path program 1 times [2021-11-07 01:47:42,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:42,002 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519303472] [2021-11-07 01:47:42,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:42,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:42,092 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-07 01:47:42,093 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:42,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519303472] [2021-11-07 01:47:42,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519303472] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:42,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:42,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:42,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313002388] [2021-11-07 01:47:42,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:42,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:42,098 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-07 01:47:42,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:42,206 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-11-07 01:47:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 01:47:42,206 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-07 01:47:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:42,207 INFO L225 Difference]: With dead ends: 86 [2021-11-07 01:47:42,207 INFO L226 Difference]: Without dead ends: 84 [2021-11-07 01:47:42,208 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-07 01:47:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-11-07 01:47:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2021-11-07 01:47:42,212 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-07 01:47:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2021-11-07 01:47:42,213 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 14 [2021-11-07 01:47:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:42,213 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2021-11-07 01:47:42,213 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-07 01:47:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2021-11-07 01:47:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-07 01:47:42,214 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:42,214 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:42,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 01:47:42,214 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-07 01:47:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash 433495416, now seen corresponding path program 1 times [2021-11-07 01:47:42,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:42,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349649814] [2021-11-07 01:47:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:42,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:42,243 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-07 01:47:42,243 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:42,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349649814] [2021-11-07 01:47:42,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349649814] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:42,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:42,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:47:42,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360491141] [2021-11-07 01:47:42,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:47:42,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:42,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:47:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:47:42,245 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-07 01:47:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:42,271 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2021-11-07 01:47:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:47:42,271 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-07 01:47:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:42,272 INFO L225 Difference]: With dead ends: 62 [2021-11-07 01:47:42,272 INFO L226 Difference]: Without dead ends: 60 [2021-11-07 01:47:42,273 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-07 01:47:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-11-07 01:47:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2021-11-07 01:47:42,286 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-07 01:47:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2021-11-07 01:47:42,286 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 15 [2021-11-07 01:47:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:42,287 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2021-11-07 01:47:42,287 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-07 01:47:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2021-11-07 01:47:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 01:47:42,288 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:42,288 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:42,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:47:42,288 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-07 01:47:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash 553460123, now seen corresponding path program 1 times [2021-11-07 01:47:42,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:42,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941347361] [2021-11-07 01:47:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:42,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:42,328 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-07 01:47:42,328 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:42,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941347361] [2021-11-07 01:47:42,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941347361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:42,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:42,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:47:42,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428718502] [2021-11-07 01:47:42,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:47:42,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:42,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:47:42,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:47:42,332 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-07 01:47:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:42,369 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2021-11-07 01:47:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:47:42,370 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-07 01:47:42,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:42,371 INFO L225 Difference]: With dead ends: 60 [2021-11-07 01:47:42,371 INFO L226 Difference]: Without dead ends: 56 [2021-11-07 01:47:42,371 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-07 01:47:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-07 01:47:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-07 01:47:42,376 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-07 01:47:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2021-11-07 01:47:42,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 16 [2021-11-07 01:47:42,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:42,377 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2021-11-07 01:47:42,377 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-07 01:47:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2021-11-07 01:47:42,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:47:42,377 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:42,378 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:42,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:47:42,378 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-07 01:47:42,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash -995706929, now seen corresponding path program 1 times [2021-11-07 01:47:42,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:42,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18388194] [2021-11-07 01:47:42,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:42,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:42,444 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-07 01:47:42,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:42,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18388194] [2021-11-07 01:47:42,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18388194] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:47:42,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076788930] [2021-11-07 01:47:42,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:42,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:47:42,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:47:42,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:47:42,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 01:47:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:42,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 01:47:42,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:47:43,030 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-07 01:47:43,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:47:43,128 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-07 01:47:43,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076788930] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:47:43,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1530747459] [2021-11-07 01:47:43,150 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2021-11-07 01:47:43,150 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:47:43,155 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-07 01:47:43,161 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-07 01:47:43,162 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-07 01:47:43,200 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,202 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:47:43,203 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,203 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-11-07 01:47:43,204 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:47:43,205 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,205 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-07 01:47:43,208 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2021-11-07 01:47:43,232 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_9|], 21=[|v_#valid_10|]} [2021-11-07 01:47:43,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,255 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-07 01:47:43,255 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,256 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:47:43,257 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,257 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:47:43,258 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:47:43,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,271 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:43,295 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-07 01:47:43,296 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,300 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:47:43,301 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,302 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:47:43,302 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:47:43,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,310 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,312 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,314 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-11-07 01:47:43,315 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:47:43,315 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:111 [2021-11-07 01:47:43,321 INFO L180 QuantifierPusher]: treesize reduction 5, result has 95.9 percent of original size [2021-11-07 01:47:43,330 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-11-07 01:47:43,335 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,339 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-07 01:47:43,355 INFO L180 QuantifierPusher]: treesize reduction 8, result has 95.5 percent of original size [2021-11-07 01:47:43,362 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-11-07 01:47:43,387 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,395 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 155 [2021-11-07 01:47:43,400 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,405 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2021-11-07 01:47:43,418 INFO L180 QuantifierPusher]: treesize reduction 8, result has 96.4 percent of original size [2021-11-07 01:47:43,425 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 208 [2021-11-07 01:47:43,434 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,441 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 195 [2021-11-07 01:47:43,449 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,459 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 204 [2021-11-07 01:47:43,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,609 INFO L180 QuantifierPusher]: treesize reduction 8, result has 96.4 percent of original size [2021-11-07 01:47:43,620 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 212 [2021-11-07 01:47:43,631 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,648 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 230 [2021-11-07 01:47:43,657 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,676 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 223 [2021-11-07 01:47:43,687 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,701 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 232 [2021-11-07 01:47:43,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,853 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-07 01:47:43,862 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-07 01:47:43,867 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,875 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-07 01:47:43,880 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:43,885 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 133 [2021-11-07 01:47:43,903 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-07 01:47:43,909 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-07 01:47:43,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:43,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:44,146 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:44,164 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 270 [2021-11-07 01:47:44,166 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-07 01:47:47,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 01:47:47,173 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:47:47,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2021-11-07 01:47:47,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469046005] [2021-11-07 01:47:47,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:47:47,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:47:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2021-11-07 01:47:47,181 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-07 01:47:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:47,482 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2021-11-07 01:47:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-07 01:47:47,483 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-07 01:47:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:47,484 INFO L225 Difference]: With dead ends: 103 [2021-11-07 01:47:47,484 INFO L226 Difference]: Without dead ends: 101 [2021-11-07 01:47:47,485 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:47:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-11-07 01:47:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 52. [2021-11-07 01:47:47,491 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-07 01:47:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2021-11-07 01:47:47,491 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 17 [2021-11-07 01:47:47,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:47,492 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2021-11-07 01:47:47,492 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-07 01:47:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2021-11-07 01:47:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-07 01:47:47,493 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:47,493 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:47,543 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 01:47:47,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:47:47,722 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-07 01:47:47,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:47,722 INFO L85 PathProgramCache]: Analyzing trace with hash -7486289, now seen corresponding path program 1 times [2021-11-07 01:47:47,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:47,723 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120104875] [2021-11-07 01:47:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:47,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:47,790 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-07 01:47:47,790 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:47,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120104875] [2021-11-07 01:47:47,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120104875] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:47,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:47,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:47,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749801763] [2021-11-07 01:47:47,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:47,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:47,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:47,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:47,793 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-07 01:47:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:47,896 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2021-11-07 01:47:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:47:47,897 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-07 01:47:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:47,898 INFO L225 Difference]: With dead ends: 67 [2021-11-07 01:47:47,898 INFO L226 Difference]: Without dead ends: 65 [2021-11-07 01:47:47,899 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-07 01:47:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-11-07 01:47:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2021-11-07 01:47:47,905 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-07 01:47:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2021-11-07 01:47:47,906 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 17 [2021-11-07 01:47:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:47,906 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2021-11-07 01:47:47,907 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-07 01:47:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2021-11-07 01:47:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:47:47,910 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:47,910 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-07 01:47:47,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-11-07 01:47:47,911 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-07 01:47:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:47,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1807516650, now seen corresponding path program 1 times [2021-11-07 01:47:47,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:47,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053785604] [2021-11-07 01:47:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:47,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:48,002 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-07 01:47:48,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:48,002 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053785604] [2021-11-07 01:47:48,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053785604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:48,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:48,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:48,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083197104] [2021-11-07 01:47:48,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:48,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:48,008 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-07 01:47:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:48,104 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2021-11-07 01:47:48,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 01:47:48,104 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-07 01:47:48,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:48,106 INFO L225 Difference]: With dead ends: 59 [2021-11-07 01:47:48,106 INFO L226 Difference]: Without dead ends: 57 [2021-11-07 01:47:48,107 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-07 01:47:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-11-07 01:47:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2021-11-07 01:47:48,112 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-07 01:47:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2021-11-07 01:47:48,112 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 18 [2021-11-07 01:47:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:48,113 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2021-11-07 01:47:48,113 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-07 01:47:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2021-11-07 01:47:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:47:48,114 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:48,114 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-07 01:47:48,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-11-07 01:47:48,115 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-07 01:47:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:48,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1754075570, now seen corresponding path program 1 times [2021-11-07 01:47:48,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:48,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153595561] [2021-11-07 01:47:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:48,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:48,200 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-07 01:47:48,201 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:48,201 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153595561] [2021-11-07 01:47:48,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153595561] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:47:48,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:47:48,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-07 01:47:48,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267115738] [2021-11-07 01:47:48,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:47:48,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:48,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:47:48,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:47:48,204 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-07 01:47:48,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:48,292 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2021-11-07 01:47:48,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:47:48,292 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-07 01:47:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:48,293 INFO L225 Difference]: With dead ends: 42 [2021-11-07 01:47:48,293 INFO L226 Difference]: Without dead ends: 19 [2021-11-07 01:47:48,294 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-07 01:47:48,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-07 01:47:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-07 01:47:48,296 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-07 01:47:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2021-11-07 01:47:48,297 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 18 [2021-11-07 01:47:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:48,298 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2021-11-07 01:47:48,298 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-07 01:47:48,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-11-07 01:47:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-07 01:47:48,299 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:47:48,299 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:47:48,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-11-07 01:47:48,300 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-07 01:47:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:47:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash -808942776, now seen corresponding path program 1 times [2021-11-07 01:47:48,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:47:48,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482239254] [2021-11-07 01:47:48,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:48,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:47:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:48,386 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-07 01:47:48,387 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:47:48,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482239254] [2021-11-07 01:47:48,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482239254] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 01:47:48,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315522870] [2021-11-07 01:47:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:47:48,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 01:47:48,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:47:48,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 01:47:48,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 01:47:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:47:48,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-07 01:47:48,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 01:47:48,861 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-07 01:47:48,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 01:47:48,954 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-07 01:47:48,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315522870] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 01:47:48,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1160452536] [2021-11-07 01:47:48,960 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-07 01:47:48,960 INFO L166 IcfgInterpreter]: Building call graph [2021-11-07 01:47:48,960 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-07 01:47:48,961 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-07 01:47:48,961 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-07 01:47:48,984 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:48,985 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:47:48,986 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:48,986 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-11-07 01:47:48,987 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-07 01:47:48,987 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:48,988 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-07 01:47:48,990 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 139 [2021-11-07 01:47:48,998 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_10|], 21=[|v_#valid_11|]} [2021-11-07 01:47:49,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,014 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-07 01:47:49,015 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,015 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:47:49,016 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,016 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-07 01:47:49,017 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-07 01:47:49,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,023 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 01:47:49,059 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-07 01:47:49,060 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,063 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:47:49,063 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,064 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-07 01:47:49,064 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-07 01:47:49,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,072 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,074 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-11-07 01:47:49,075 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-07 01:47:49,075 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:111 [2021-11-07 01:47:49,081 INFO L180 QuantifierPusher]: treesize reduction 5, result has 95.9 percent of original size [2021-11-07 01:47:49,084 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 112 [2021-11-07 01:47:49,089 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,096 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 124 [2021-11-07 01:47:49,111 INFO L180 QuantifierPusher]: treesize reduction 8, result has 95.5 percent of original size [2021-11-07 01:47:49,116 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-11-07 01:47:49,124 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,130 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 155 [2021-11-07 01:47:49,134 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,139 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2021-11-07 01:47:49,149 INFO L180 QuantifierPusher]: treesize reduction 8, result has 96.4 percent of original size [2021-11-07 01:47:49,155 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 208 [2021-11-07 01:47:49,162 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,170 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 210 [2021-11-07 01:47:49,177 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,184 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 219 [2021-11-07 01:47:49,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,243 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,279 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-07 01:47:49,283 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-07 01:47:49,288 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,295 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 128 [2021-11-07 01:47:49,300 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,305 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 137 [2021-11-07 01:47:49,315 INFO L180 QuantifierPusher]: treesize reduction 66, result has 58.2 percent of original size [2021-11-07 01:47:49,318 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-11-07 01:47:49,325 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,329 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2021-11-07 01:47:49,351 INFO L180 QuantifierPusher]: treesize reduction 74, result has 63.5 percent of original size [2021-11-07 01:47:49,355 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2021-11-07 01:47:49,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:49,578 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-07 01:47:49,592 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 270 [2021-11-07 01:47:49,594 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-07 01:47:52,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-11-07 01:47:52,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 01:47:52,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 13 [2021-11-07 01:47:52,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250739940] [2021-11-07 01:47:52,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 01:47:52,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:47:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 01:47:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2021-11-07 01:47:52,739 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-07 01:47:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:47:52,866 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-11-07 01:47:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-07 01:47:52,867 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-07 01:47:52,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:47:52,867 INFO L225 Difference]: With dead ends: 30 [2021-11-07 01:47:52,867 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 01:47:52,868 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:47:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 01:47:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 01:47:52,869 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-07 01:47:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 01:47:52,869 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2021-11-07 01:47:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:47:52,869 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 01:47:52,870 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-07 01:47:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 01:47:52,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 01:47:52,873 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,874 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,874 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,875 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,875 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,875 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,875 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,876 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,876 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,876 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,876 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,877 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,878 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,878 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 01:47:52,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 01:47:53,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2021-11-07 01:47:53,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-07 01:47:53,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:53,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:53,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:53,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:53,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:53,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-07 01:47:53,939 INFO L857 garLoopResultBuilder]: For program point L225(line 225) no Hoare annotation was computed. [2021-11-07 01:47:53,939 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-11-07 01:47:53,940 INFO L857 garLoopResultBuilder]: For program point L349(lines 349 358) no Hoare annotation was computed. [2021-11-07 01:47:53,940 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-07 01:47:53,940 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 56) no Hoare annotation was computed. [2021-11-07 01:47:53,940 INFO L857 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2021-11-07 01:47:53,941 INFO L857 garLoopResultBuilder]: For program point L308(lines 308 316) no Hoare annotation was computed. [2021-11-07 01:47:53,941 INFO L857 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2021-11-07 01:47:53,941 INFO L857 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2021-11-07 01:47:53,942 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2021-11-07 01:47:53,942 INFO L857 garLoopResultBuilder]: For program point L102(lines 102 252) no Hoare annotation was computed. [2021-11-07 01:47:53,942 INFO L857 garLoopResultBuilder]: For program point L325(lines 325 362) no Hoare annotation was computed. [2021-11-07 01:47:53,942 INFO L857 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2021-11-07 01:47:53,943 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2021-11-07 01:47:53,944 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-07 01:47:53,944 INFO L857 garLoopResultBuilder]: For program point L20(lines 20 374) no Hoare annotation was computed. [2021-11-07 01:47:53,944 INFO L857 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2021-11-07 01:47:53,944 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 339) no Hoare annotation was computed. [2021-11-07 01:47:53,945 INFO L857 garLoopResultBuilder]: For program point L235(lines 235 243) no Hoare annotation was computed. [2021-11-07 01:47:53,945 INFO L857 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2021-11-07 01:47:53,945 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2021-11-07 01:47:53,945 INFO L857 garLoopResultBuilder]: For program point L153(lines 153 161) no Hoare annotation was computed. [2021-11-07 01:47:53,945 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 254) no Hoare annotation was computed. [2021-11-07 01:47:53,946 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-11-07 01:47:53,946 INFO L857 garLoopResultBuilder]: For program point L310(line 310) no Hoare annotation was computed. [2021-11-07 01:47:53,946 INFO L857 garLoopResultBuilder]: For program point L277(lines 277 364) no Hoare annotation was computed. [2021-11-07 01:47:53,946 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 310) no Hoare annotation was computed. [2021-11-07 01:47:53,946 INFO L857 garLoopResultBuilder]: For program point L71(lines 71 95) no Hoare annotation was computed. [2021-11-07 01:47:53,947 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2021-11-07 01:47:53,947 INFO L857 garLoopResultBuilder]: For program point L187(lines 187 197) no Hoare annotation was computed. [2021-11-07 01:47:53,947 INFO L857 garLoopResultBuilder]: For program point L113(lines 113 204) no Hoare annotation was computed. [2021-11-07 01:47:53,947 INFO L857 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2021-11-07 01:47:53,948 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-07 01:47:53,948 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-07 01:47:53,948 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 127) no Hoare annotation was computed. [2021-11-07 01:47:53,949 INFO L857 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2021-11-07 01:47:53,949 INFO L857 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-11-07 01:47:53,951 INFO L857 garLoopResultBuilder]: For program point L279(line 279) no Hoare annotation was computed. [2021-11-07 01:47:53,951 INFO L857 garLoopResultBuilder]: For program point L337(lines 337 360) no Hoare annotation was computed. [2021-11-07 01:47:53,952 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 351) no Hoare annotation was computed. [2021-11-07 01:47:53,952 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 210) no Hoare annotation was computed. [2021-11-07 01:47:53,952 INFO L857 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2021-11-07 01:47:53,952 INFO L857 garLoopResultBuilder]: For program point L296(lines 296 318) no Hoare annotation was computed. [2021-11-07 01:47:53,952 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 368) no Hoare annotation was computed. [2021-11-07 01:47:53,953 INFO L857 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2021-11-07 01:47:53,953 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-11-07 01:47:53,953 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 369) no Hoare annotation was computed. [2021-11-07 01:47:53,953 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2021-11-07 01:47:53,954 INFO L857 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2021-11-07 01:47:53,954 INFO L857 garLoopResultBuilder]: For program point L289(lines 289 363) no Hoare annotation was computed. [2021-11-07 01:47:53,954 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-07 01:47:53,954 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2021-11-07 01:47:53,954 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 245) no Hoare annotation was computed. [2021-11-07 01:47:53,954 INFO L857 garLoopResultBuilder]: For program point L83(lines 83 93) no Hoare annotation was computed. [2021-11-07 01:47:53,955 INFO L857 garLoopResultBuilder]: For program point L339(line 339) no Hoare annotation was computed. [2021-11-07 01:47:53,955 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 163) no Hoare annotation was computed. [2021-11-07 01:47:53,955 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 256) no Hoare annotation was computed. [2021-11-07 01:47:53,955 INFO L857 garLoopResultBuilder]: For program point L298(line 298) no Hoare annotation was computed. [2021-11-07 01:47:53,955 INFO L857 garLoopResultBuilder]: For program point L125(lines 125 202) no Hoare annotation was computed. [2021-11-07 01:47:53,956 INFO L860 garLoopResultBuilder]: At program point L315(lines 32 368) the Hoare annotation is: true [2021-11-07 01:47:53,956 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 225) no Hoare annotation was computed. [2021-11-07 01:47:53,956 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 251) no Hoare annotation was computed. [2021-11-07 01:47:53,956 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-11-07 01:47:53,957 INFO L860 garLoopResultBuilder]: At program point L373(lines 15 375) the Hoare annotation is: true [2021-11-07 01:47:53,957 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 199) no Hoare annotation was computed. [2021-11-07 01:47:53,957 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 298) no Hoare annotation was computed. [2021-11-07 01:47:53,957 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 366) no Hoare annotation was computed. [2021-11-07 01:47:53,957 INFO L857 garLoopResultBuilder]: For program point L134(lines 134 201) no Hoare annotation was computed. [2021-11-07 01:47:53,958 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-07 01:47:53,962 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-07 01:47:53,964 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:47:54,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:47:54 BoogieIcfgContainer [2021-11-07 01:47:54,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:47:54,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:47:54,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:47:54,017 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:47:54,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:47:38" (3/4) ... [2021-11-07 01:47:54,020 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 01:47:54,050 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-11-07 01:47:54,050 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-07 01:47:54,052 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:47:54,053 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 01:47:54,155 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:47:54,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:47:54,157 INFO L168 Benchmark]: Toolchain (without parser) took 16849.66 ms. Allocated memory was 81.8 MB in the beginning and 174.1 MB in the end (delta: 92.3 MB). Free memory was 45.0 MB in the beginning and 129.8 MB in the end (delta: -84.9 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:47:54,157 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 81.8 MB. Free memory is still 61.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:47:54,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.94 ms. Allocated memory was 81.8 MB in the beginning and 119.5 MB in the end (delta: 37.7 MB). Free memory was 44.7 MB in the beginning and 90.0 MB in the end (delta: -45.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:47:54,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.07 ms. Allocated memory is still 119.5 MB. Free memory was 90.0 MB in the beginning and 87.8 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:47:54,166 INFO L168 Benchmark]: Boogie Preprocessor took 30.42 ms. Allocated memory is still 119.5 MB. Free memory was 87.8 MB in the beginning and 86.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:47:54,167 INFO L168 Benchmark]: RCFGBuilder took 549.91 ms. Allocated memory is still 119.5 MB. Free memory was 86.6 MB in the beginning and 71.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:47:54,167 INFO L168 Benchmark]: TraceAbstraction took 15585.64 ms. Allocated memory was 119.5 MB in the beginning and 174.1 MB in the end (delta: 54.5 MB). Free memory was 71.2 MB in the beginning and 135.0 MB in the end (delta: -63.9 MB). Peak memory consumption was 79.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:47:54,170 INFO L168 Benchmark]: Witness Printer took 139.73 ms. Allocated memory is still 174.1 MB. Free memory was 135.0 MB in the beginning and 129.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:47:54,172 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.24 ms. Allocated memory is still 81.8 MB. Free memory is still 61.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 440.94 ms. Allocated memory was 81.8 MB in the beginning and 119.5 MB in the end (delta: 37.7 MB). Free memory was 44.7 MB in the beginning and 90.0 MB in the end (delta: -45.3 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.07 ms. Allocated memory is still 119.5 MB. Free memory was 90.0 MB in the beginning and 87.8 MB in the end (delta: 2.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.42 ms. Allocated memory is still 119.5 MB. Free memory was 87.8 MB in the beginning and 86.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 549.91 ms. Allocated memory is still 119.5 MB. Free memory was 86.6 MB in the beginning and 71.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15585.64 ms. Allocated memory was 119.5 MB in the beginning and 174.1 MB in the end (delta: 54.5 MB). Free memory was 71.2 MB in the beginning and 135.0 MB in the end (delta: -63.9 MB). Peak memory consumption was 79.7 MB. Max. memory is 16.1 GB. * Witness Printer took 139.73 ms. Allocated memory is still 174.1 MB. Free memory was 135.0 MB in the beginning and 129.8 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 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: 15.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, 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, 7.0s 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 349 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 17 NumberOfFragments, 177 HoareAnnotationTreeSize, 6 FomulaSimplifications, 561603 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 169502 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s 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-07 01:47:54,239 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38d02475-004f-4788-965c-ac2dd21255a6/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE