./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6d41d2a2a28e240d9196f063199b00c22e981e9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:32:38,670 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:32:38,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:32:38,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:32:38,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:32:38,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:32:38,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:32:38,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:32:38,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:32:38,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:32:38,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:32:38,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:32:38,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:32:38,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:32:38,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:32:38,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:32:38,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:32:38,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:32:38,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:32:38,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:32:38,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:32:38,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:32:38,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:32:38,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:32:38,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:32:38,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:32:38,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:32:38,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:32:38,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:32:38,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:32:38,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:32:38,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:32:38,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:32:38,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:32:38,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:32:38,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:32:38,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:32:38,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:32:38,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:32:38,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:32:38,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:32:38,760 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:32:38,784 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:32:38,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:32:38,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:32:38,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:32:38,787 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:32:38,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:32:38,788 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:32:38,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:32:38,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:32:38,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:32:38,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:32:38,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:32:38,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:32:38,790 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:32:38,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:32:38,791 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:32:38,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:32:38,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:32:38,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:32:38,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:32:38,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:32:38,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:32:38,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:32:38,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:32:38,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:32:38,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:32:38,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:32:38,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:32:38,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/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_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC 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 -> Automizer 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 -> c6d41d2a2a28e240d9196f063199b00c22e981e9 [2021-10-11 00:32:39,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:32:39,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:32:39,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:32:39,064 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:32:39,065 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:32:39,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-11 00:32:39,126 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/data/14e383fab/78b4b7f6bc854560bf03989a9303a347/FLAGefd0d905a [2021-10-11 00:32:39,615 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:32:39,616 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-11 00:32:39,623 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/data/14e383fab/78b4b7f6bc854560bf03989a9303a347/FLAGefd0d905a [2021-10-11 00:32:40,000 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/data/14e383fab/78b4b7f6bc854560bf03989a9303a347 [2021-10-11 00:32:40,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:32:40,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:32:40,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:40,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:32:40,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:32:40,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b01817c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40, skipping insertion in model container [2021-10-11 00:32:40,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,031 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:32:40,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:32:40,227 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-10-11 00:32:40,236 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-10-11 00:32:40,239 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-10-11 00:32:40,241 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-10-11 00:32:40,243 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-10-11 00:32:40,245 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-10-11 00:32:40,248 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-10-11 00:32:40,250 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-10-11 00:32:40,252 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-10-11 00:32:40,254 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-10-11 00:32:40,258 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-10-11 00:32:40,260 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-10-11 00:32:40,262 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-10-11 00:32:40,263 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-10-11 00:32:40,266 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-10-11 00:32:40,268 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-10-11 00:32:40,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:40,294 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:32:40,313 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2021-10-11 00:32:40,315 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2021-10-11 00:32:40,317 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2021-10-11 00:32:40,318 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2021-10-11 00:32:40,320 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2021-10-11 00:32:40,321 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2021-10-11 00:32:40,324 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2021-10-11 00:32:40,325 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2021-10-11 00:32:40,327 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2021-10-11 00:32:40,329 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2021-10-11 00:32:40,331 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2021-10-11 00:32:40,333 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2021-10-11 00:32:40,334 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2021-10-11 00:32:40,336 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2021-10-11 00:32:40,339 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2021-10-11 00:32:40,340 WARN L226 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_0fcb563c-2c86-4377-b727-f7cce12952e8/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2021-10-11 00:32:40,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:40,357 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:32:40,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40 WrapperNode [2021-10-11 00:32:40,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:40,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:40,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:32:40,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:32:40,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,446 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:40,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:32:40,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:32:40,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:32:40,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... [2021-10-11 00:32:40,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:32:40,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:32:40,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:32:40,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:32:40,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:32:40,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:32:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:32:40,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:32:40,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:32:40,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:32:40,995 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 00:32:40,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:40 BoogieIcfgContainer [2021-10-11 00:32:40,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:32:40,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:32:40,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:32:41,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:32:41,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:32:40" (1/3) ... [2021-10-11 00:32:41,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5c265d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:32:41, skipping insertion in model container [2021-10-11 00:32:41,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:40" (2/3) ... [2021-10-11 00:32:41,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5c265d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:32:41, skipping insertion in model container [2021-10-11 00:32:41,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:40" (3/3) ... [2021-10-11 00:32:41,006 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2021-10-11 00:32:41,019 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:32:41,022 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2021-10-11 00:32:41,033 INFO L253 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2021-10-11 00:32:41,057 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:32:41,057 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:32:41,058 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:32:41,058 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:32:41,058 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:32:41,058 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:32:41,058 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:32:41,058 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:32:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2021-10-11 00:32:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-11 00:32:41,081 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:41,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:41,083 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:41,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2021-10-11 00:32:41,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:41,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096315179] [2021-10-11 00:32:41,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:41,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096315179] [2021-10-11 00:32:41,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:41,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:32:41,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707514772] [2021-10-11 00:32:41,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:32:41,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:32:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:41,358 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2021-10-11 00:32:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:41,410 INFO L93 Difference]: Finished difference Result 83 states and 110 transitions. [2021-10-11 00:32:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:32:41,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-10-11 00:32:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:41,421 INFO L225 Difference]: With dead ends: 83 [2021-10-11 00:32:41,422 INFO L226 Difference]: Without dead ends: 72 [2021-10-11 00:32:41,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-10-11 00:32:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-10-11 00:32:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-10-11 00:32:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2021-10-11 00:32:41,467 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2021-10-11 00:32:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:41,468 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2021-10-11 00:32:41,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:32:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2021-10-11 00:32:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 00:32:41,469 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:41,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:41,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:32:41,470 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2021-10-11 00:32:41,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:41,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487074102] [2021-10-11 00:32:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:41,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487074102] [2021-10-11 00:32:41,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:41,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:41,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393779827] [2021-10-11 00:32:41,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:41,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:41,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:41,551 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 4 states. [2021-10-11 00:32:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:41,668 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-10-11 00:32:41,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:32:41,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-10-11 00:32:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:41,670 INFO L225 Difference]: With dead ends: 73 [2021-10-11 00:32:41,671 INFO L226 Difference]: Without dead ends: 71 [2021-10-11 00:32:41,671 INFO L677 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-10-11 00:32:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-11 00:32:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 53. [2021-10-11 00:32:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-10-11 00:32:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-10-11 00:32:41,680 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2021-10-11 00:32:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:41,680 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-10-11 00:32:41,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-10-11 00:32:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 00:32:41,681 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:41,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:41,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:32:41,682 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2021-10-11 00:32:41,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:41,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446907429] [2021-10-11 00:32:41,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:41,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446907429] [2021-10-11 00:32:41,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:41,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:41,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095973064] [2021-10-11 00:32:41,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:41,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:41,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:41,737 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 4 states. [2021-10-11 00:32:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:41,825 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2021-10-11 00:32:41,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:41,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-10-11 00:32:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:41,828 INFO L225 Difference]: With dead ends: 143 [2021-10-11 00:32:41,828 INFO L226 Difference]: Without dead ends: 93 [2021-10-11 00:32:41,829 INFO L677 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-10-11 00:32:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-10-11 00:32:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 52. [2021-10-11 00:32:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-10-11 00:32:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-10-11 00:32:41,837 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2021-10-11 00:32:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:41,838 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-10-11 00:32:41,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-10-11 00:32:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:32:41,839 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:41,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:41,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:32:41,839 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2021-10-11 00:32:41,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:41,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405327776] [2021-10-11 00:32:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:41,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405327776] [2021-10-11 00:32:41,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:41,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:41,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243293393] [2021-10-11 00:32:41,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:41,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:41,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:41,912 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 4 states. [2021-10-11 00:32:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:42,040 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-10-11 00:32:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:32:42,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 00:32:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:42,046 INFO L225 Difference]: With dead ends: 92 [2021-10-11 00:32:42,046 INFO L226 Difference]: Without dead ends: 90 [2021-10-11 00:32:42,047 INFO L677 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-10-11 00:32:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-10-11 00:32:42,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 50. [2021-10-11 00:32:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-10-11 00:32:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2021-10-11 00:32:42,062 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2021-10-11 00:32:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:42,062 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2021-10-11 00:32:42,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:42,063 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2021-10-11 00:32:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:32:42,064 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:42,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:42,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:32:42,065 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2021-10-11 00:32:42,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:42,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468675261] [2021-10-11 00:32:42,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:42,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468675261] [2021-10-11 00:32:42,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:42,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:42,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886599726] [2021-10-11 00:32:42,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:42,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:42,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:42,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:42,171 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2021-10-11 00:32:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:42,255 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2021-10-11 00:32:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:42,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 00:32:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:42,257 INFO L225 Difference]: With dead ends: 69 [2021-10-11 00:32:42,257 INFO L226 Difference]: Without dead ends: 67 [2021-10-11 00:32:42,258 INFO L677 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-10-11 00:32:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-11 00:32:42,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2021-10-11 00:32:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-10-11 00:32:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2021-10-11 00:32:42,265 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2021-10-11 00:32:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:42,265 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2021-10-11 00:32:42,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:42,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2021-10-11 00:32:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:32:42,266 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:42,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:42,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:32:42,267 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2021-10-11 00:32:42,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:42,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544127469] [2021-10-11 00:32:42,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:42,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544127469] [2021-10-11 00:32:42,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:42,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:42,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515784041] [2021-10-11 00:32:42,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:42,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:42,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:42,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:42,352 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2021-10-11 00:32:42,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:42,462 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2021-10-11 00:32:42,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:32:42,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2021-10-11 00:32:42,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:42,464 INFO L225 Difference]: With dead ends: 87 [2021-10-11 00:32:42,464 INFO L226 Difference]: Without dead ends: 85 [2021-10-11 00:32:42,465 INFO L677 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-10-11 00:32:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-10-11 00:32:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 46. [2021-10-11 00:32:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-10-11 00:32:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-10-11 00:32:42,471 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2021-10-11 00:32:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:42,472 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-10-11 00:32:42,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-10-11 00:32:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:32:42,478 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:42,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:42,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:32:42,479 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2021-10-11 00:32:42,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:42,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798303256] [2021-10-11 00:32:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:42,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798303256] [2021-10-11 00:32:42,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:42,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:42,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352861811] [2021-10-11 00:32:42,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:42,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:42,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:42,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:42,582 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2021-10-11 00:32:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:42,750 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2021-10-11 00:32:42,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:42,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-10-11 00:32:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:42,753 INFO L225 Difference]: With dead ends: 75 [2021-10-11 00:32:42,753 INFO L226 Difference]: Without dead ends: 73 [2021-10-11 00:32:42,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:32:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-10-11 00:32:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2021-10-11 00:32:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-10-11 00:32:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2021-10-11 00:32:42,767 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2021-10-11 00:32:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:42,768 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2021-10-11 00:32:42,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2021-10-11 00:32:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:32:42,769 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:42,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:42,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:32:42,770 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:42,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2021-10-11 00:32:42,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:42,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578571036] [2021-10-11 00:32:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:42,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:42,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578571036] [2021-10-11 00:32:42,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:42,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:42,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801481621] [2021-10-11 00:32:42,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:42,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:42,866 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states. [2021-10-11 00:32:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:42,943 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2021-10-11 00:32:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:32:42,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-10-11 00:32:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:42,945 INFO L225 Difference]: With dead ends: 83 [2021-10-11 00:32:42,945 INFO L226 Difference]: Without dead ends: 81 [2021-10-11 00:32:42,946 INFO L677 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-10-11 00:32:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-11 00:32:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 42. [2021-10-11 00:32:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2021-10-11 00:32:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2021-10-11 00:32:42,966 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2021-10-11 00:32:42,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:42,966 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2021-10-11 00:32:42,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2021-10-11 00:32:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:32:42,968 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:42,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:42,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:32:42,969 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:42,969 INFO L82 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2021-10-11 00:32:42,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:42,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220498490] [2021-10-11 00:32:42,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:43,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220498490] [2021-10-11 00:32:43,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:43,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:43,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093537202] [2021-10-11 00:32:43,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:43,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:43,056 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2021-10-11 00:32:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:43,145 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-10-11 00:32:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:32:43,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 00:32:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:43,147 INFO L225 Difference]: With dead ends: 57 [2021-10-11 00:32:43,148 INFO L226 Difference]: Without dead ends: 55 [2021-10-11 00:32:43,148 INFO L677 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-10-11 00:32:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-11 00:32:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2021-10-11 00:32:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2021-10-11 00:32:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2021-10-11 00:32:43,161 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2021-10-11 00:32:43,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:43,162 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2021-10-11 00:32:43,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2021-10-11 00:32:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:32:43,164 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:43,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:43,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:32:43,164 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:43,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2021-10-11 00:32:43,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:43,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858331064] [2021-10-11 00:32:43,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:43,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858331064] [2021-10-11 00:32:43,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:43,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:43,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505555629] [2021-10-11 00:32:43,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:43,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:43,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:43,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:43,246 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2021-10-11 00:32:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:43,296 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2021-10-11 00:32:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:32:43,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2021-10-11 00:32:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:43,298 INFO L225 Difference]: With dead ends: 57 [2021-10-11 00:32:43,298 INFO L226 Difference]: Without dead ends: 55 [2021-10-11 00:32:43,299 INFO L677 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-10-11 00:32:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-11 00:32:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2021-10-11 00:32:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-10-11 00:32:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-10-11 00:32:43,303 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2021-10-11 00:32:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:43,303 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-10-11 00:32:43,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-10-11 00:32:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:32:43,305 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:43,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:43,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:32:43,305 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:43,306 INFO L82 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2021-10-11 00:32:43,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:43,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987332161] [2021-10-11 00:32:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:43,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987332161] [2021-10-11 00:32:43,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:43,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:32:43,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258499573] [2021-10-11 00:32:43,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:32:43,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:43,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:32:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:32:43,375 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 4 states. [2021-10-11 00:32:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:43,442 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2021-10-11 00:32:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:43,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 00:32:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:43,444 INFO L225 Difference]: With dead ends: 65 [2021-10-11 00:32:43,444 INFO L226 Difference]: Without dead ends: 63 [2021-10-11 00:32:43,448 INFO L677 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-10-11 00:32:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-11 00:32:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2021-10-11 00:32:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-10-11 00:32:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2021-10-11 00:32:43,455 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2021-10-11 00:32:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:43,457 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2021-10-11 00:32:43,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:32:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2021-10-11 00:32:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 00:32:43,458 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:43,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:43,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:32:43,459 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2021-10-11 00:32:43,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:43,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937103251] [2021-10-11 00:32:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:43,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937103251] [2021-10-11 00:32:43,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:43,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:43,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835367305] [2021-10-11 00:32:43,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:43,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:43,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:43,523 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2021-10-11 00:32:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:43,645 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2021-10-11 00:32:43,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:43,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-10-11 00:32:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:43,646 INFO L225 Difference]: With dead ends: 70 [2021-10-11 00:32:43,647 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 00:32:43,647 INFO L677 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-10-11 00:32:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 00:32:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 34. [2021-10-11 00:32:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2021-10-11 00:32:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-10-11 00:32:43,664 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2021-10-11 00:32:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:43,665 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-10-11 00:32:43,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-10-11 00:32:43,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 00:32:43,669 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:43,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:43,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:32:43,670 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:43,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2021-10-11 00:32:43,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:43,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450446781] [2021-10-11 00:32:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:43,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450446781] [2021-10-11 00:32:43,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:43,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:32:43,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252680741] [2021-10-11 00:32:43,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:32:43,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:43,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:32:43,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:32:43,739 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2021-10-11 00:32:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:43,896 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2021-10-11 00:32:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:32:43,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-10-11 00:32:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:43,898 INFO L225 Difference]: With dead ends: 58 [2021-10-11 00:32:43,898 INFO L226 Difference]: Without dead ends: 56 [2021-10-11 00:32:43,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:32:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-10-11 00:32:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 32. [2021-10-11 00:32:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 00:32:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2021-10-11 00:32:43,903 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2021-10-11 00:32:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:43,904 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2021-10-11 00:32:43,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:32:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2021-10-11 00:32:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:32:43,905 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:43,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:43,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:32:43,906 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:43,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:43,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2021-10-11 00:32:43,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:43,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316500867] [2021-10-11 00:32:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:43,957 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316500867] [2021-10-11 00:32:43,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:43,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:43,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835543665] [2021-10-11 00:32:43,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:32:43,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:43,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:43,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:43,959 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 5 states. [2021-10-11 00:32:44,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:44,098 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2021-10-11 00:32:44,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:32:44,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-10-11 00:32:44,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:44,099 INFO L225 Difference]: With dead ends: 83 [2021-10-11 00:32:44,099 INFO L226 Difference]: Without dead ends: 81 [2021-10-11 00:32:44,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:32:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-10-11 00:32:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 30. [2021-10-11 00:32:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-10-11 00:32:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-10-11 00:32:44,105 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2021-10-11 00:32:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:44,106 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-10-11 00:32:44,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:32:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-10-11 00:32:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 00:32:44,107 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:44,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:44,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:32:44,107 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:44,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:44,108 INFO L82 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2021-10-11 00:32:44,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:44,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399152934] [2021-10-11 00:32:44,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:44,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399152934] [2021-10-11 00:32:44,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:44,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:32:44,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477416655] [2021-10-11 00:32:44,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:32:44,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:44,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:32:44,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:32:44,179 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2021-10-11 00:32:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:44,320 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2021-10-11 00:32:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:32:44,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-10-11 00:32:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:44,321 INFO L225 Difference]: With dead ends: 56 [2021-10-11 00:32:44,322 INFO L226 Difference]: Without dead ends: 54 [2021-10-11 00:32:44,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:32:44,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-10-11 00:32:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2021-10-11 00:32:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-10-11 00:32:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-10-11 00:32:44,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2021-10-11 00:32:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:44,331 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-10-11 00:32:44,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:32:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-10-11 00:32:44,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 00:32:44,334 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:32:44,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:44,334 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:32:44,336 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:32:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2021-10-11 00:32:44,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:44,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572341674] [2021-10-11 00:32:44,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:32:44,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572341674] [2021-10-11 00:32:44,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:44,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:32:44,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260749992] [2021-10-11 00:32:44,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:32:44,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:32:44,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:32:44,409 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2021-10-11 00:32:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:44,605 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2021-10-11 00:32:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:32:44,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2021-10-11 00:32:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:32:44,606 INFO L225 Difference]: With dead ends: 121 [2021-10-11 00:32:44,606 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 00:32:44,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:32:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 00:32:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 00:32:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 00:32:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:32:44,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-10-11 00:32:44,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:32:44,609 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:44,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:32:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:32:44,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 00:32:44,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:32:44,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 00:32:44,780 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 75 [2021-10-11 00:32:44,947 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 98 [2021-10-11 00:32:45,111 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 75 [2021-10-11 00:32:45,273 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 17 [2021-10-11 00:32:45,691 WARN L197 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 33 [2021-10-11 00:32:45,924 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 9 [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 59) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point L217(line 217) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point L151(lines 151 281) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point L110(lines 110 123) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point L36(lines 36 300) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2021-10-11 00:32:45,927 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point L86(lines 86 127) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point L20(lines 20 312) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point L243(lines 243 267) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point L45(lines 45 288) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2021-10-11 00:32:45,928 INFO L258 CegarLoopResult]: At program point L293(lines 38 294) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__j~0) (<= (+ ULTIMATE.start_main_~main__j~0 5) ULTIMATE.start_main_~main__bufsize~0) (<= 0 ULTIMATE.start_main_~main__i~0) (< ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__len~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2021-10-11 00:32:45,928 INFO L262 CegarLoopResult]: For program point L227(lines 227 269) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 205) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L265 CegarLoopResult]: At program point L310(lines 13 313) the Hoare annotation is: true [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L203(lines 203 273) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L38(lines 38 294) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L245(line 245) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2021-10-11 00:32:45,929 INFO L262 CegarLoopResult]: For program point L229(line 229) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L163(lines 163 279) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L258 CegarLoopResult]: At program point L304(lines 25 312) the Hoare annotation is: (and (<= 0 ULTIMATE.start_main_~main__i~0) (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0)) [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L139(lines 139 283) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L98(lines 98 125) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L255(lines 255 265) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 165) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L57(lines 57 286) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2021-10-11 00:32:45,930 INFO L262 CegarLoopResult]: For program point L74(lines 74 129) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L258 CegarLoopResult]: At program point L264(lines 31 306) the Hoare annotation is: (let ((.cse3 (<= (+ ULTIMATE.start_main_~main__j~0 4) ULTIMATE.start_main_~main__bufsize~0))) (let ((.cse1 (let ((.cse4 (<= 1 ULTIMATE.start_main_~main__i~0))) (or (and .cse3 .cse4) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse4)))) (.cse2 (<= 1 ULTIMATE.start_main_~main__j~0)) (.cse0 (<= (+ ULTIMATE.start_main_~main__limit~0 4) ULTIMATE.start_main_~main__bufsize~0))) (or (and (= ULTIMATE.start_main_~main__j~0 0) (<= 0 ULTIMATE.start_main_~main__i~0) (< ULTIMATE.start_main_~main__i~0 ULTIMATE.start_main_~main__len~0) .cse0) (and .cse1 .cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~14 0)) .cse0) (and .cse3 .cse1 .cse2 .cse0)))) [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L66(lines 66 285) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 153) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L215(lines 215 271) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L257(line 257) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L191(lines 191 275) no Hoare annotation was computed. [2021-10-11 00:32:45,931 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2021-10-11 00:32:45,932 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 193) no Hoare annotation was computed. [2021-10-11 00:32:45,932 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2021-10-11 00:32:45,932 INFO L262 CegarLoopResult]: For program point L175(lines 175 277) no Hoare annotation was computed. [2021-10-11 00:32:45,932 INFO L262 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2021-10-11 00:32:45,932 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2021-10-11 00:32:45,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:32:45 BoogieIcfgContainer [2021-10-11 00:32:45,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:32:45,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:32:45,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:32:45,954 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:32:45,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:40" (3/4) ... [2021-10-11 00:32:45,958 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 00:32:45,971 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-11 00:32:45,971 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 00:32:45,972 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:32:45,972 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:32:46,025 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0fcb563c-2c86-4377-b727-f7cce12952e8/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:32:46,026 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:32:46,027 INFO L168 Benchmark]: Toolchain (without parser) took 6021.92 ms. Allocated memory was 104.9 MB in the beginning and 163.6 MB in the end (delta: 58.7 MB). Free memory was 73.9 MB in the beginning and 88.2 MB in the end (delta: -14.2 MB). Peak memory consumption was 44.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:46,027 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 104.9 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:32:46,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.63 ms. Allocated memory was 104.9 MB in the beginning and 136.3 MB in the end (delta: 31.5 MB). Free memory was 73.7 MB in the beginning and 104.7 MB in the end (delta: -31.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:46,028 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.43 ms. Allocated memory is still 136.3 MB. Free memory was 104.7 MB in the beginning and 103.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:46,029 INFO L168 Benchmark]: Boogie Preprocessor took 64.82 ms. Allocated memory is still 136.3 MB. Free memory was 103.1 MB in the beginning and 101.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:32:46,029 INFO L168 Benchmark]: RCFGBuilder took 479.81 ms. Allocated memory is still 136.3 MB. Free memory was 101.7 MB in the beginning and 79.5 MB in the end (delta: 22.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:46,029 INFO L168 Benchmark]: TraceAbstraction took 4954.38 ms. Allocated memory was 136.3 MB in the beginning and 163.6 MB in the end (delta: 27.3 MB). Free memory was 79.5 MB in the beginning and 93.4 MB in the end (delta: -13.9 MB). Peak memory consumption was 64.7 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:46,030 INFO L168 Benchmark]: Witness Printer took 72.38 ms. Allocated memory is still 163.6 MB. Free memory was 92.4 MB in the beginning and 88.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:46,032 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 104.9 MB. Free memory is still 58.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 342.63 ms. Allocated memory was 104.9 MB in the beginning and 136.3 MB in the end (delta: 31.5 MB). Free memory was 73.7 MB in the beginning and 104.7 MB in the end (delta: -31.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.43 ms. Allocated memory is still 136.3 MB. Free memory was 104.7 MB in the beginning and 103.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 64.82 ms. Allocated memory is still 136.3 MB. Free memory was 103.1 MB in the beginning and 101.7 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 479.81 ms. Allocated memory is still 136.3 MB. Free memory was 101.7 MB in the beginning and 79.5 MB in the end (delta: 22.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4954.38 ms. Allocated memory was 136.3 MB in the beginning and 163.6 MB in the end (delta: 27.3 MB). Free memory was 79.5 MB in the beginning and 93.4 MB in the end (delta: -13.9 MB). Peak memory consumption was 64.7 MB. Max. memory is 16.1 GB. * Witness Printer took 72.38 ms. Allocated memory is still 163.6 MB. Free memory was 92.4 MB in the beginning and 88.2 MB in the end (delta: 4.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: - PositiveResult [Line: 59]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 165]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 153]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 217]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 112]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 141]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 193]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 245]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 229]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 205]: 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((0 <= main__j && main__j + 5 <= main__bufsize) && 0 <= main__i) && main__i < main__len) && main__limit + 4 <= main__bufsize - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((main__j == 0 && 0 <= main__i) && main__i < main__len) && main__limit + 4 <= main__bufsize) || (((((main__j + 4 <= main__bufsize && 1 <= main__i) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i)) && 1 <= main__j) && !(__VERIFIER_assert__cond == 0)) && main__limit + 4 <= main__bufsize)) || (((main__j + 4 <= main__bufsize && ((main__j + 4 <= main__bufsize && 1 <= main__i) || (!(__VERIFIER_assert__cond == 0) && 1 <= main__i))) && 1 <= main__j) && main__limit + 4 <= main__bufsize) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 <= main__i && main__limit + 4 <= main__bufsize - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 883 SDtfs, 1261 SDslu, 715 SDs, 0 SdLazy, 912 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 436 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 25 NumberOfFragments, 109 HoareAnnotationTreeSize, 4 FomulaSimplifications, 233044656 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 253791 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 9440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...