./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 64bit --witnessprinter.graph.data.programhash 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 17:09:34,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 17:09:34,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 17:09:34,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 17:09:34,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 17:09:34,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 17:09:34,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 17:09:34,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 17:09:34,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 17:09:34,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 17:09:34,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 17:09:34,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 17:09:34,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 17:09:34,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 17:09:34,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 17:09:34,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 17:09:34,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 17:09:34,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 17:09:34,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 17:09:34,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 17:09:34,841 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 17:09:34,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 17:09:34,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 17:09:34,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 17:09:34,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 17:09:34,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 17:09:34,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 17:09:34,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 17:09:34,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 17:09:34,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 17:09:34,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 17:09:34,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 17:09:34,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 17:09:34,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 17:09:34,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 17:09:34,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 17:09:34,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 17:09:34,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 17:09:34,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 17:09:34,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 17:09:34,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 17:09:34,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-14 17:09:34,879 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 17:09:34,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 17:09:34,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 17:09:34,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 17:09:34,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 17:09:34,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 17:09:34,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 17:09:34,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 17:09:34,882 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 17:09:34,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 17:09:34,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 17:09:34,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 17:09:34,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-14 17:09:34,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 17:09:34,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-14 17:09:34,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-14 17:09:34,884 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 17:09:34,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-14 17:09:34,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 17:09:34,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 17:09:34,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 17:09:34,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:09:34,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 17:09:34,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 17:09:34,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-14 17:09:34,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 17:09:34,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 17:09:34,887 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-14 17:09:34,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-14 17:09:34,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-14 17:09:34,887 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 17:09:34,887 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69a4e17497471d2fff231bad199d28dc26e616d1fdaf7fc57a8b45b8dfdd40ce [2021-12-14 17:09:35,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 17:09:35,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 17:09:35,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 17:09:35,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 17:09:35,150 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 17:09:35,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-12-14 17:09:35,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a0fbc9e/44765e63d078455687125947e7769eec/FLAGce14fad7a [2021-12-14 17:09:35,986 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 17:09:35,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i [2021-12-14 17:09:36,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a0fbc9e/44765e63d078455687125947e7769eec/FLAGce14fad7a [2021-12-14 17:09:36,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a0fbc9e/44765e63d078455687125947e7769eec [2021-12-14 17:09:36,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 17:09:36,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 17:09:36,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 17:09:36,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 17:09:36,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 17:09:36,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:09:36" (1/1) ... [2021-12-14 17:09:36,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19026f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:36, skipping insertion in model container [2021-12-14 17:09:36,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:09:36" (1/1) ... [2021-12-14 17:09:36,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 17:09:36,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 17:09:36,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2021-12-14 17:09:36,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2021-12-14 17:09:37,397 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,398 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,398 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,399 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,399 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,408 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,409 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,410 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,411 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:37,657 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:09:37,658 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:09:37,659 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:09:37,662 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:09:37,672 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:09:37,673 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:09:37,681 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:09:37,682 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:09:37,683 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:09:37,686 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:09:37,846 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:09:38,022 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,027 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:09:38,422 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 17:09:38,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4496,4509] [2021-12-14 17:09:38,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_eq_byte_buf_harness.i[4556,4569] [2021-12-14 17:09:38,520 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,521 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,522 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,523 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,524 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,533 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,534 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,535 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,536 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,635 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-14 17:09:38,636 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-14 17:09:38,637 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-14 17:09:38,637 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-14 17:09:38,638 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-14 17:09:38,638 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-14 17:09:38,638 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-14 17:09:38,639 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-14 17:09:38,639 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-14 17:09:38,639 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-14 17:09:38,670 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-14 17:09:38,819 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,820 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-14 17:09:38,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 17:09:39,148 INFO L208 MainTranslator]: Completed translation [2021-12-14 17:09:39,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39 WrapperNode [2021-12-14 17:09:39,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 17:09:39,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 17:09:39,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 17:09:39,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 17:09:39,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,354 INFO L137 Inliner]: procedures = 693, calls = 2792, calls flagged for inlining = 61, calls inlined = 8, statements flattened = 879 [2021-12-14 17:09:39,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 17:09:39,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 17:09:39,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 17:09:39,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 17:09:39,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 17:09:39,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 17:09:39,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 17:09:39,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 17:09:39,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (1/1) ... [2021-12-14 17:09:39,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 17:09:39,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:39,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 17:09:39,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 17:09:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-14 17:09:39,530 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-14 17:09:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_buf_is_valid [2021-12-14 17:09:39,530 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_buf_is_valid [2021-12-14 17:09:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-14 17:09:39,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-14 17:09:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-14 17:09:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 17:09:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-14 17:09:39,532 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-14 17:09:39,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 17:09:39,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-14 17:09:39,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-14 17:09:39,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 17:09:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 17:09:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 17:09:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 17:09:39,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 17:09:39,534 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-14 17:09:39,535 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-14 17:09:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-14 17:09:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-14 17:09:39,535 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-14 17:09:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 17:09:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 17:09:39,535 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2021-12-14 17:09:39,536 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2021-12-14 17:09:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 17:09:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-14 17:09:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-14 17:09:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-14 17:09:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-14 17:09:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 17:09:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 17:09:39,823 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 17:09:39,824 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 17:09:40,753 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 17:09:40,764 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 17:09:40,765 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-14 17:09:40,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:09:40 BoogieIcfgContainer [2021-12-14 17:09:40,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 17:09:40,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 17:09:40,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 17:09:40,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 17:09:40,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:09:36" (1/3) ... [2021-12-14 17:09:40,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ac655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:09:40, skipping insertion in model container [2021-12-14 17:09:40,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:09:39" (2/3) ... [2021-12-14 17:09:40,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c8ac655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:09:40, skipping insertion in model container [2021-12-14 17:09:40,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:09:40" (3/3) ... [2021-12-14 17:09:40,777 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_buf_harness.i [2021-12-14 17:09:40,781 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 17:09:40,782 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-14 17:09:40,837 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 17:09:40,851 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 17:09:40,853 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-14 17:09:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-14 17:09:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 17:09:40,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:40,883 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:40,884 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1812998439, now seen corresponding path program 1 times [2021-12-14 17:09:40,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:40,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206446438] [2021-12-14 17:09:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:40,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 17:09:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 17:09:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 17:09:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-14 17:09:41,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:41,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206446438] [2021-12-14 17:09:41,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206446438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:41,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:09:41,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 17:09:41,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020456721] [2021-12-14 17:09:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:41,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 17:09:41,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 17:09:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 17:09:41,625 INFO L87 Difference]: Start difference. First operand has 131 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 17:09:41,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:41,902 INFO L93 Difference]: Finished difference Result 253 states and 352 transitions. [2021-12-14 17:09:41,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 17:09:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2021-12-14 17:09:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:41,912 INFO L225 Difference]: With dead ends: 253 [2021-12-14 17:09:41,913 INFO L226 Difference]: Without dead ends: 126 [2021-12-14 17:09:41,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-12-14 17:09:41,919 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:41,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 219 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 17:09:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-14 17:09:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-12-14 17:09:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 85 states have internal predecessors, (106), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2021-12-14 17:09:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 167 transitions. [2021-12-14 17:09:41,996 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 167 transitions. Word has length 72 [2021-12-14 17:09:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:41,998 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 167 transitions. [2021-12-14 17:09:41,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 17:09:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 167 transitions. [2021-12-14 17:09:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-14 17:09:42,002 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:42,002 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:42,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 17:09:42,002 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:42,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash -795992417, now seen corresponding path program 1 times [2021-12-14 17:09:42,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:42,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844961869] [2021-12-14 17:09:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:42,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-14 17:09:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-14 17:09:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-14 17:09:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-14 17:09:42,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:42,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844961869] [2021-12-14 17:09:42,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844961869] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:42,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:09:42,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:09:42,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563663896] [2021-12-14 17:09:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:42,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:09:42,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:42,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:09:42,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:09:42,402 INFO L87 Difference]: Start difference. First operand 126 states and 167 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 17:09:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:42,754 INFO L93 Difference]: Finished difference Result 213 states and 284 transitions. [2021-12-14 17:09:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:09:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 72 [2021-12-14 17:09:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:42,764 INFO L225 Difference]: With dead ends: 213 [2021-12-14 17:09:42,764 INFO L226 Difference]: Without dead ends: 129 [2021-12-14 17:09:42,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 17:09:42,774 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:42,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 456 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:09:42,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-14 17:09:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-14 17:09:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 86 states have (on average 1.255813953488372) internal successors, (108), 88 states have internal predecessors, (108), 31 states have call successors, (31), 10 states have call predecessors, (31), 11 states have return successors, (31), 30 states have call predecessors, (31), 30 states have call successors, (31) [2021-12-14 17:09:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2021-12-14 17:09:42,791 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 72 [2021-12-14 17:09:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:42,792 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2021-12-14 17:09:42,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-14 17:09:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2021-12-14 17:09:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-14 17:09:42,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:42,795 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:42,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 17:09:42,795 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:42,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:42,796 INFO L85 PathProgramCache]: Analyzing trace with hash -565003148, now seen corresponding path program 1 times [2021-12-14 17:09:42,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:42,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920333293] [2021-12-14 17:09:42,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:42,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-14 17:09:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 17:09:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-14 17:09:43,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:43,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920333293] [2021-12-14 17:09:43,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920333293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:43,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:09:43,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 17:09:43,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663175026] [2021-12-14 17:09:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:43,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 17:09:43,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 17:09:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:09:43,216 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-14 17:09:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:43,761 INFO L93 Difference]: Finished difference Result 225 states and 299 transitions. [2021-12-14 17:09:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:09:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 78 [2021-12-14 17:09:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:43,764 INFO L225 Difference]: With dead ends: 225 [2021-12-14 17:09:43,764 INFO L226 Difference]: Without dead ends: 167 [2021-12-14 17:09:43,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-12-14 17:09:43,766 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 226 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:43,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 665 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 17:09:43,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-14 17:09:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2021-12-14 17:09:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 100 states have internal predecessors, (123), 35 states have call successors, (35), 11 states have call predecessors, (35), 12 states have return successors, (36), 34 states have call predecessors, (36), 34 states have call successors, (36) [2021-12-14 17:09:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 194 transitions. [2021-12-14 17:09:43,785 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 194 transitions. Word has length 78 [2021-12-14 17:09:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:43,787 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 194 transitions. [2021-12-14 17:09:43,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2021-12-14 17:09:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 194 transitions. [2021-12-14 17:09:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-14 17:09:43,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:43,794 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:43,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 17:09:43,794 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:43,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:43,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1924525814, now seen corresponding path program 1 times [2021-12-14 17:09:43,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:43,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639351219] [2021-12-14 17:09:43,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:43,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:43,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-14 17:09:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 17:09:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2021-12-14 17:09:44,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:44,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639351219] [2021-12-14 17:09:44,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639351219] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:44,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:09:44,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 17:09:44,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093724965] [2021-12-14 17:09:44,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:44,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 17:09:44,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:44,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 17:09:44,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 17:09:44,110 INFO L87 Difference]: Start difference. First operand 146 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 17:09:44,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:44,395 INFO L93 Difference]: Finished difference Result 250 states and 338 transitions. [2021-12-14 17:09:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 17:09:44,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2021-12-14 17:09:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:44,397 INFO L225 Difference]: With dead ends: 250 [2021-12-14 17:09:44,397 INFO L226 Difference]: Without dead ends: 194 [2021-12-14 17:09:44,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 17:09:44,398 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:44,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 441 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:09:44,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-14 17:09:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2021-12-14 17:09:44,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 128 states have (on average 1.2578125) internal successors, (161), 130 states have internal predecessors, (161), 51 states have call successors, (51), 11 states have call predecessors, (51), 12 states have return successors, (54), 50 states have call predecessors, (54), 50 states have call successors, (54) [2021-12-14 17:09:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2021-12-14 17:09:44,415 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 78 [2021-12-14 17:09:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:44,415 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2021-12-14 17:09:44,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-14 17:09:44,416 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2021-12-14 17:09:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-14 17:09:44,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:44,419 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:44,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 17:09:44,419 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:44,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2071762423, now seen corresponding path program 1 times [2021-12-14 17:09:44,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:44,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609614540] [2021-12-14 17:09:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:44,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-14 17:09:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 17:09:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:09:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:44,722 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-14 17:09:44,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:44,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609614540] [2021-12-14 17:09:44,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609614540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:44,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:09:44,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-14 17:09:44,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973296949] [2021-12-14 17:09:44,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:44,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 17:09:44,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 17:09:44,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:09:44,725 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:09:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:45,105 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2021-12-14 17:09:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 17:09:45,105 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2021-12-14 17:09:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:45,107 INFO L225 Difference]: With dead ends: 203 [2021-12-14 17:09:45,107 INFO L226 Difference]: Without dead ends: 196 [2021-12-14 17:09:45,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:09:45,108 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:45,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 870 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:09:45,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-14 17:09:45,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-14 17:09:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 131 states have (on average 1.251908396946565) internal successors, (164), 134 states have internal predecessors, (164), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-12-14 17:09:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2021-12-14 17:09:45,123 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 90 [2021-12-14 17:09:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:45,123 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2021-12-14 17:09:45,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:09:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2021-12-14 17:09:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-14 17:09:45,125 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:45,125 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:45,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 17:09:45,125 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:45,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1055189439, now seen corresponding path program 1 times [2021-12-14 17:09:45,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:45,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859814545] [2021-12-14 17:09:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:45,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-14 17:09:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 17:09:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:09:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-14 17:09:45,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:45,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859814545] [2021-12-14 17:09:45,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859814545] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:45,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:09:45,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:09:45,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006695976] [2021-12-14 17:09:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:45,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:09:45,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:09:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:09:45,453 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:09:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:45,821 INFO L93 Difference]: Finished difference Result 362 states and 524 transitions. [2021-12-14 17:09:45,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 17:09:45,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2021-12-14 17:09:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:45,824 INFO L225 Difference]: With dead ends: 362 [2021-12-14 17:09:45,824 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 17:09:45,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-12-14 17:09:45,826 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 120 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:45,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 516 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:09:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 17:09:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2021-12-14 17:09:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 139 states have internal predecessors, (171), 51 states have call successors, (51), 11 states have call predecessors, (51), 13 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-12-14 17:09:45,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 282 transitions. [2021-12-14 17:09:45,840 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 282 transitions. Word has length 94 [2021-12-14 17:09:45,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:45,840 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 282 transitions. [2021-12-14 17:09:45,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:09:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 282 transitions. [2021-12-14 17:09:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-14 17:09:45,842 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:45,842 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:45,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 17:09:45,843 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1313354877, now seen corresponding path program 1 times [2021-12-14 17:09:45,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:45,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908886762] [2021-12-14 17:09:45,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:45,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-14 17:09:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 17:09:46,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:09:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-14 17:09:46,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908886762] [2021-12-14 17:09:46,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908886762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:09:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142454754] [2021-12-14 17:09:46,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:46,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:46,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:46,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:09:46,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 17:09:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:46,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 2607 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-14 17:09:46,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:09:47,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 17:09:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 17:09:47,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:09:47,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142454754] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:47,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:09:47,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 20 [2021-12-14 17:09:47,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775280484] [2021-12-14 17:09:47,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:47,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 17:09:47,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:47,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 17:09:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-12-14 17:09:47,404 INFO L87 Difference]: Start difference. First operand 201 states and 282 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-14 17:09:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:47,448 INFO L93 Difference]: Finished difference Result 373 states and 521 transitions. [2021-12-14 17:09:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 17:09:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2021-12-14 17:09:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:47,452 INFO L225 Difference]: With dead ends: 373 [2021-12-14 17:09:47,452 INFO L226 Difference]: Without dead ends: 220 [2021-12-14 17:09:47,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-12-14 17:09:47,454 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 20 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:47,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 941 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 57 Unchecked, 0.0s Time] [2021-12-14 17:09:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-14 17:09:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2021-12-14 17:09:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 154 states have (on average 1.2597402597402598) internal successors, (194), 157 states have internal predecessors, (194), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (60), 50 states have call predecessors, (60), 50 states have call successors, (60) [2021-12-14 17:09:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 305 transitions. [2021-12-14 17:09:47,474 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 305 transitions. Word has length 94 [2021-12-14 17:09:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:47,474 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 305 transitions. [2021-12-14 17:09:47,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 9 states have internal predecessors, (60), 4 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-14 17:09:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 305 transitions. [2021-12-14 17:09:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-14 17:09:47,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:47,477 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:47,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 17:09:47,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:47,704 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1354029627, now seen corresponding path program 1 times [2021-12-14 17:09:47,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:47,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787159559] [2021-12-14 17:09:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:47,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-14 17:09:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-14 17:09:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-14 17:09:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-14 17:09:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-12-14 17:09:47,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:47,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787159559] [2021-12-14 17:09:47,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787159559] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:09:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834218058] [2021-12-14 17:09:47,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:47,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:47,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:47,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:09:47,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 17:09:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:48,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 17:09:48,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:09:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-14 17:09:48,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:09:48,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834218058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:48,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:09:48,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-14 17:09:48,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262841549] [2021-12-14 17:09:48,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:48,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 17:09:48,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 17:09:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 17:09:48,552 INFO L87 Difference]: Start difference. First operand 220 states and 305 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:09:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:48,606 INFO L93 Difference]: Finished difference Result 379 states and 533 transitions. [2021-12-14 17:09:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 17:09:48,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2021-12-14 17:09:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:48,608 INFO L225 Difference]: With dead ends: 379 [2021-12-14 17:09:48,608 INFO L226 Difference]: Without dead ends: 229 [2021-12-14 17:09:48,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 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-12-14 17:09:48,609 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 20 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:48,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 493 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 17:09:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-14 17:09:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2021-12-14 17:09:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 149 states have internal predecessors, (185), 51 states have call successors, (51), 12 states have call predecessors, (51), 13 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2021-12-14 17:09:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2021-12-14 17:09:48,641 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 94 [2021-12-14 17:09:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:48,642 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2021-12-14 17:09:48,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:09:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2021-12-14 17:09:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-14 17:09:48,643 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:48,644 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:48,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 17:09:48,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-14 17:09:48,860 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:48,860 INFO L85 PathProgramCache]: Analyzing trace with hash -805510601, now seen corresponding path program 1 times [2021-12-14 17:09:48,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:48,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187753876] [2021-12-14 17:09:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:48,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 17:09:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 17:09:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-14 17:09:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-14 17:09:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-14 17:09:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-14 17:09:49,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187753876] [2021-12-14 17:09:49,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187753876] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:09:49,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24007706] [2021-12-14 17:09:49,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:49,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:49,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:49,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:09:49,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 17:09:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:49,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 2614 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 17:09:49,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:09:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 17:09:49,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:09:49,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24007706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:49,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:09:49,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2021-12-14 17:09:49,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255037492] [2021-12-14 17:09:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:49,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 17:09:49,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:49,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 17:09:49,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:09:49,881 INFO L87 Difference]: Start difference. First operand 212 states and 294 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 17:09:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:50,001 INFO L93 Difference]: Finished difference Result 367 states and 515 transitions. [2021-12-14 17:09:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 17:09:50,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2021-12-14 17:09:50,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:50,004 INFO L225 Difference]: With dead ends: 367 [2021-12-14 17:09:50,004 INFO L226 Difference]: Without dead ends: 217 [2021-12-14 17:09:50,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-14 17:09:50,005 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 12 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:50,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 1191 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 17:09:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-14 17:09:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-12-14 17:09:50,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 154 states have internal predecessors, (189), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-14 17:09:50,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 303 transitions. [2021-12-14 17:09:50,017 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 303 transitions. Word has length 98 [2021-12-14 17:09:50,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:50,017 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 303 transitions. [2021-12-14 17:09:50,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-14 17:09:50,018 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 303 transitions. [2021-12-14 17:09:50,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:09:50,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:50,019 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:50,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 17:09:50,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:50,235 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:50,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:50,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1170955310, now seen corresponding path program 1 times [2021-12-14 17:09:50,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:50,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670282143] [2021-12-14 17:09:50,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:50,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:09:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:09:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:09:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:09:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,466 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-14 17:09:50,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:50,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670282143] [2021-12-14 17:09:50,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670282143] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:09:50,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413712042] [2021-12-14 17:09:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:50,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:50,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:50,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:09:50,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 17:09:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:50,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 2619 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 17:09:50,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:09:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-14 17:09:51,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:09:51,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413712042] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:51,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:09:51,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-14 17:09:51,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825911499] [2021-12-14 17:09:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:51,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 17:09:51,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:51,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 17:09:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 17:09:51,071 INFO L87 Difference]: Start difference. First operand 217 states and 303 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:09:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:51,097 INFO L93 Difference]: Finished difference Result 377 states and 535 transitions. [2021-12-14 17:09:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 17:09:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2021-12-14 17:09:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:51,099 INFO L225 Difference]: With dead ends: 377 [2021-12-14 17:09:51,099 INFO L226 Difference]: Without dead ends: 220 [2021-12-14 17:09:51,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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-12-14 17:09:51,101 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 9 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:51,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 486 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 17:09:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-14 17:09:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2021-12-14 17:09:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 151 states have (on average 1.2384105960264902) internal successors, (187), 154 states have internal predecessors, (187), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-14 17:09:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 301 transitions. [2021-12-14 17:09:51,111 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 301 transitions. Word has length 100 [2021-12-14 17:09:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:51,111 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 301 transitions. [2021-12-14 17:09:51,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:09:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 301 transitions. [2021-12-14 17:09:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:09:51,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:51,113 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:51,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 17:09:51,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:51,327 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1786047986, now seen corresponding path program 1 times [2021-12-14 17:09:51,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:51,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886980844] [2021-12-14 17:09:51,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:51,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:09:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:09:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:09:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:09:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-12-14 17:09:51,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:51,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886980844] [2021-12-14 17:09:51,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886980844] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:09:51,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587021680] [2021-12-14 17:09:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:51,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:51,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:51,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:09:51,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 17:09:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:51,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 17:09:51,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:09:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-14 17:09:52,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 17:09:52,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587021680] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:09:52,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 17:09:52,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-14 17:09:52,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327285980] [2021-12-14 17:09:52,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:09:52,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 17:09:52,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 17:09:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 17:09:52,142 INFO L87 Difference]: Start difference. First operand 217 states and 301 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:09:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:52,168 INFO L93 Difference]: Finished difference Result 383 states and 546 transitions. [2021-12-14 17:09:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 17:09:52,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2021-12-14 17:09:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:52,171 INFO L225 Difference]: With dead ends: 383 [2021-12-14 17:09:52,171 INFO L226 Difference]: Without dead ends: 226 [2021-12-14 17:09:52,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 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-12-14 17:09:52,173 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 34 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:52,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 484 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 17:09:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-14 17:09:52,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 213. [2021-12-14 17:09:52,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 147 states have (on average 1.2244897959183674) internal successors, (180), 150 states have internal predecessors, (180), 51 states have call successors, (51), 12 states have call predecessors, (51), 14 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-14 17:09:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 294 transitions. [2021-12-14 17:09:52,185 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 294 transitions. Word has length 100 [2021-12-14 17:09:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:52,185 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 294 transitions. [2021-12-14 17:09:52,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-12-14 17:09:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 294 transitions. [2021-12-14 17:09:52,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:09:52,188 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:52,188 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:52,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 17:09:52,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-14 17:09:52,411 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:52,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1106775732, now seen corresponding path program 1 times [2021-12-14 17:09:52,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:52,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371546311] [2021-12-14 17:09:52,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:52,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:52,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:52,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:53,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:53,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:09:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:53,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:09:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:09:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:53,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:09:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-14 17:09:53,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371546311] [2021-12-14 17:09:53,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371546311] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:09:53,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122514089] [2021-12-14 17:09:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:53,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:53,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:53,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:09:53,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 17:09:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:53,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-14 17:09:53,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:09:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 17:09:54,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 17:09:54,913 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-14 17:09:54,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2021-12-14 17:09:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-14 17:09:54,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122514089] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 17:09:54,980 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 17:09:54,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2021-12-14 17:09:54,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743458756] [2021-12-14 17:09:54,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 17:09:54,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 17:09:54,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 17:09:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-12-14 17:09:54,982 INFO L87 Difference]: Start difference. First operand 213 states and 294 transitions. Second operand has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-14 17:09:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:09:56,167 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2021-12-14 17:09:56,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 17:09:56,168 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2021-12-14 17:09:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:09:56,170 INFO L225 Difference]: With dead ends: 259 [2021-12-14 17:09:56,170 INFO L226 Difference]: Without dead ends: 231 [2021-12-14 17:09:56,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 17:09:56,171 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 350 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 17:09:56,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 903 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 926 Invalid, 0 Unknown, 325 Unchecked, 0.8s Time] [2021-12-14 17:09:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-14 17:09:56,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2021-12-14 17:09:56,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 155 states have (on average 1.2129032258064516) internal successors, (188), 158 states have internal predecessors, (188), 51 states have call successors, (51), 14 states have call predecessors, (51), 16 states have return successors, (63), 50 states have call predecessors, (63), 50 states have call successors, (63) [2021-12-14 17:09:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 302 transitions. [2021-12-14 17:09:56,184 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 302 transitions. Word has length 100 [2021-12-14 17:09:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:09:56,184 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 302 transitions. [2021-12-14 17:09:56,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.375) internal successors, (129), 23 states have internal predecessors, (129), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-14 17:09:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 302 transitions. [2021-12-14 17:09:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:09:56,186 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:09:56,186 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:09:56,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 17:09:56,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:56,397 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:09:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:09:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash 61814546, now seen corresponding path program 1 times [2021-12-14 17:09:56,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:09:56,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252969278] [2021-12-14 17:09:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:56,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:09:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:09:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:09:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:09:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:09:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:09:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:09:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:09:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:09:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:09:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:09:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:09:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-12-14 17:09:56,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:09:56,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252969278] [2021-12-14 17:09:56,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252969278] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:09:56,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985784607] [2021-12-14 17:09:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:09:56,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:09:56,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:09:56,818 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:09:56,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 17:09:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:09:57,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 2613 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-14 17:09:57,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:09:58,395 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 17:09:58,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 17:09:59,105 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-14 17:09:59,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 1 [2021-12-14 17:09:59,303 INFO L354 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2021-12-14 17:09:59,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2021-12-14 17:09:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-14 17:09:59,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985784607] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 17:09:59,457 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 17:09:59,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 33 [2021-12-14 17:09:59,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133694182] [2021-12-14 17:09:59,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 17:09:59,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-14 17:09:59,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:09:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-14 17:09:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2021-12-14 17:09:59,459 INFO L87 Difference]: Start difference. First operand 223 states and 302 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2021-12-14 17:10:02,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:10:02,186 INFO L93 Difference]: Finished difference Result 353 states and 508 transitions. [2021-12-14 17:10:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-14 17:10:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) Word has length 100 [2021-12-14 17:10:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:10:02,189 INFO L225 Difference]: With dead ends: 353 [2021-12-14 17:10:02,189 INFO L226 Difference]: Without dead ends: 341 [2021-12-14 17:10:02,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 193 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=618, Invalid=2804, Unknown=0, NotChecked=0, Total=3422 [2021-12-14 17:10:02,192 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 313 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-14 17:10:02,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 1823 Invalid, 2396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1747 Invalid, 0 Unknown, 574 Unchecked, 1.5s Time] [2021-12-14 17:10:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-14 17:10:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 334. [2021-12-14 17:10:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 232 states have (on average 1.2155172413793103) internal successors, (282), 235 states have internal predecessors, (282), 81 states have call successors, (81), 17 states have call predecessors, (81), 20 states have return successors, (117), 81 states have call predecessors, (117), 80 states have call successors, (117) [2021-12-14 17:10:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 480 transitions. [2021-12-14 17:10:02,219 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 480 transitions. Word has length 100 [2021-12-14 17:10:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:10:02,220 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 480 transitions. [2021-12-14 17:10:02,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 32 states have internal predecessors, (135), 6 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 6 states have call predecessors, (26), 5 states have call successors, (26) [2021-12-14 17:10:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 480 transitions. [2021-12-14 17:10:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:10:02,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:10:02,222 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:10:02,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 17:10:02,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:10:02,424 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:10:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:10:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash 319979984, now seen corresponding path program 1 times [2021-12-14 17:10:02,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:10:02,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482869286] [2021-12-14 17:10:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:10:02,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:10:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:10:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:10:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:10:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:10:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:10:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:10:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:10:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:10:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:10:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:10:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:10:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-14 17:10:02,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:10:02,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482869286] [2021-12-14 17:10:02,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482869286] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:10:02,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:10:02,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 17:10:02,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789235201] [2021-12-14 17:10:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:10:02,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 17:10:02,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:10:02,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 17:10:02,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 17:10:02,761 INFO L87 Difference]: Start difference. First operand 334 states and 480 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:10:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:10:03,077 INFO L93 Difference]: Finished difference Result 490 states and 688 transitions. [2021-12-14 17:10:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 17:10:03,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2021-12-14 17:10:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:10:03,080 INFO L225 Difference]: With dead ends: 490 [2021-12-14 17:10:03,080 INFO L226 Difference]: Without dead ends: 325 [2021-12-14 17:10:03,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-14 17:10:03,081 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 78 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:10:03,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 515 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:10:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-14 17:10:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2021-12-14 17:10:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 81 states have call successors, (81), 17 states have call predecessors, (81), 19 states have return successors, (116), 81 states have call predecessors, (116), 80 states have call successors, (116) [2021-12-14 17:10:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 469 transitions. [2021-12-14 17:10:03,099 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 469 transitions. Word has length 100 [2021-12-14 17:10:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:10:03,099 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 469 transitions. [2021-12-14 17:10:03,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:10:03,100 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 469 transitions. [2021-12-14 17:10:03,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-14 17:10:03,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:10:03,101 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:10:03,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 17:10:03,102 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:10:03,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:10:03,102 INFO L85 PathProgramCache]: Analyzing trace with hash 102489296, now seen corresponding path program 1 times [2021-12-14 17:10:03,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:10:03,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212186574] [2021-12-14 17:10:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:10:03,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:10:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:10:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:10:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:10:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:10:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:10:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:10:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:10:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:10:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:10:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:10:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:10:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-14 17:10:04,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:10:04,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212186574] [2021-12-14 17:10:04,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212186574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:10:04,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368563345] [2021-12-14 17:10:04,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:10:04,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:10:04,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:10:04,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:10:04,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 17:10:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:04,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 2618 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-14 17:10:04,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:10:05,655 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-14 17:10:05,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 17:10:06,447 INFO L354 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2021-12-14 17:10:06,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 48 [2021-12-14 17:10:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-14 17:10:07,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368563345] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 17:10:07,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 17:10:07,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2021-12-14 17:10:07,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747568186] [2021-12-14 17:10:07,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 17:10:07,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 17:10:07,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:10:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 17:10:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2021-12-14 17:10:07,631 INFO L87 Difference]: Start difference. First operand 325 states and 469 transitions. Second operand has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-14 17:10:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:10:10,742 INFO L93 Difference]: Finished difference Result 349 states and 492 transitions. [2021-12-14 17:10:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 17:10:10,742 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 100 [2021-12-14 17:10:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:10:10,745 INFO L225 Difference]: With dead ends: 349 [2021-12-14 17:10:10,745 INFO L226 Difference]: Without dead ends: 337 [2021-12-14 17:10:10,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 198 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=382, Invalid=1780, Unknown=0, NotChecked=0, Total=2162 [2021-12-14 17:10:10,746 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 240 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-14 17:10:10,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 994 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1090 Invalid, 0 Unknown, 195 Unchecked, 1.2s Time] [2021-12-14 17:10:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2021-12-14 17:10:10,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2021-12-14 17:10:10,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 221 states have internal predecessors, (268), 81 states have call successors, (81), 17 states have call predecessors, (81), 18 states have return successors, (107), 81 states have call predecessors, (107), 80 states have call successors, (107) [2021-12-14 17:10:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 456 transitions. [2021-12-14 17:10:10,802 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 456 transitions. Word has length 100 [2021-12-14 17:10:10,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:10:10,802 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 456 transitions. [2021-12-14 17:10:10,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.333333333333333) internal successors, (130), 29 states have internal predecessors, (130), 5 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-14 17:10:10,803 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 456 transitions. [2021-12-14 17:10:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-14 17:10:10,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:10:10,809 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:10:10,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 17:10:11,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-14 17:10:11,027 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:10:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:10:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash -430654057, now seen corresponding path program 1 times [2021-12-14 17:10:11,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:10:11,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133649025] [2021-12-14 17:10:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:10:11,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:10:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:10:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:10:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:10:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:10:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:10:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:10:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:10:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:10:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:10:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:10:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:10:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-14 17:10:11,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:10:11,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133649025] [2021-12-14 17:10:11,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133649025] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:10:11,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:10:11,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 17:10:11,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572377725] [2021-12-14 17:10:11,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:10:11,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 17:10:11,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:10:11,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 17:10:11,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-14 17:10:11,277 INFO L87 Difference]: Start difference. First operand 320 states and 456 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:10:11,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:10:11,705 INFO L93 Difference]: Finished difference Result 331 states and 473 transitions. [2021-12-14 17:10:11,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 17:10:11,705 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2021-12-14 17:10:11,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:10:11,707 INFO L225 Difference]: With dead ends: 331 [2021-12-14 17:10:11,707 INFO L226 Difference]: Without dead ends: 289 [2021-12-14 17:10:11,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-14 17:10:11,710 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 84 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:10:11,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1092 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:10:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-12-14 17:10:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2021-12-14 17:10:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 197 states have (on average 1.2030456852791878) internal successors, (237), 199 states have internal predecessors, (237), 69 states have call successors, (69), 17 states have call predecessors, (69), 18 states have return successors, (86), 68 states have call predecessors, (86), 67 states have call successors, (86) [2021-12-14 17:10:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 392 transitions. [2021-12-14 17:10:11,726 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 392 transitions. Word has length 102 [2021-12-14 17:10:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:10:11,726 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 392 transitions. [2021-12-14 17:10:11,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2021-12-14 17:10:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 392 transitions. [2021-12-14 17:10:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-12-14 17:10:11,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:10:11,728 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:10:11,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 17:10:11,728 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:10:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:10:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash 704139607, now seen corresponding path program 1 times [2021-12-14 17:10:11,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:10:11,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374363093] [2021-12-14 17:10:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:10:11,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:10:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:10:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-14 17:10:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-14 17:10:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-14 17:10:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:10:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-14 17:10:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-14 17:10:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-14 17:10:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-14 17:10:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-14 17:10:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-14 17:10:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-14 17:10:12,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:10:12,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374363093] [2021-12-14 17:10:12,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374363093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 17:10:12,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 17:10:12,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-14 17:10:12,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124729355] [2021-12-14 17:10:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 17:10:12,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 17:10:12,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:10:12,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 17:10:12,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-12-14 17:10:12,416 INFO L87 Difference]: Start difference. First operand 285 states and 392 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-14 17:10:13,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:10:13,676 INFO L93 Difference]: Finished difference Result 295 states and 406 transitions. [2021-12-14 17:10:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 17:10:13,676 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2021-12-14 17:10:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:10:13,678 INFO L225 Difference]: With dead ends: 295 [2021-12-14 17:10:13,678 INFO L226 Difference]: Without dead ends: 230 [2021-12-14 17:10:13,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2021-12-14 17:10:13,679 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 177 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-14 17:10:13,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 1095 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-14 17:10:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-14 17:10:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 167. [2021-12-14 17:10:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 120 states have internal predecessors, (140), 33 states have call successors, (33), 14 states have call predecessors, (33), 15 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2021-12-14 17:10:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 209 transitions. [2021-12-14 17:10:13,701 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 209 transitions. Word has length 102 [2021-12-14 17:10:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:10:13,701 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 209 transitions. [2021-12-14 17:10:13,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 13 states have internal predecessors, (63), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-14 17:10:13,701 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 209 transitions. [2021-12-14 17:10:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-14 17:10:13,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 17:10:13,703 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:10:13,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-14 17:10:13,703 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-14 17:10:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 17:10:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash 523668838, now seen corresponding path program 1 times [2021-12-14 17:10:13,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 17:10:13,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051070082] [2021-12-14 17:10:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:10:13,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 17:10:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:13,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-14 17:10:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:13,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-14 17:10:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:10:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-14 17:10:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-14 17:10:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:10:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-14 17:10:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-14 17:10:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-14 17:10:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-14 17:10:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-14 17:10:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-14 17:10:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-14 17:10:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-14 17:10:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-14 17:10:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-14 17:10:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-12-14 17:10:14,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 17:10:14,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051070082] [2021-12-14 17:10:14,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051070082] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 17:10:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884838730] [2021-12-14 17:10:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 17:10:14,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 17:10:14,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 17:10:14,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 17:10:14,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 17:10:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 17:10:14,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 2725 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-14 17:10:14,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 17:10:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-14 17:10:15,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 17:10:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-12-14 17:10:15,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884838730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 17:10:15,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 17:10:15,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 23 [2021-12-14 17:10:15,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025356337] [2021-12-14 17:10:15,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 17:10:15,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 17:10:15,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 17:10:15,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 17:10:15,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2021-12-14 17:10:15,576 INFO L87 Difference]: Start difference. First operand 167 states and 209 transitions. Second operand has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2021-12-14 17:10:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 17:10:16,158 INFO L93 Difference]: Finished difference Result 185 states and 223 transitions. [2021-12-14 17:10:16,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 17:10:16,161 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) Word has length 118 [2021-12-14 17:10:16,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 17:10:16,161 INFO L225 Difference]: With dead ends: 185 [2021-12-14 17:10:16,161 INFO L226 Difference]: Without dead ends: 0 [2021-12-14 17:10:16,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2021-12-14 17:10:16,163 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 17:10:16,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 348 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 17:10:16,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-14 17:10:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-14 17:10:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 17:10:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-14 17:10:16,164 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2021-12-14 17:10:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 17:10:16,164 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-14 17:10:16,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.857142857142857) internal successors, (81), 17 states have internal predecessors, (81), 9 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (23), 11 states have call predecessors, (23), 9 states have call successors, (23) [2021-12-14 17:10:16,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-14 17:10:16,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-14 17:10:16,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-14 17:10:16,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 17:10:16,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-14 17:10:16,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-14 17:10:20,434 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-14 17:10:20,434 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-12-14 17:10:20,434 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-14 17:10:20,435 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-12-14 17:10:20,435 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)))) (and (= |old(#length)| |#length|) (or (<= |ensure_string_is_allocated_bounded_length_~len~1#1| (+ (* 18446744073709551616 (div |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616)) 15)) .cse0) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (<= (* 18446744073709551616 (div (+ 18446744073709551600 |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) 18446744073709551616)) |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1|) .cse0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2021-12-14 17:10:20,435 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-12-14 17:10:20,435 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (and (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (not (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.base| 0)) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16))) [2021-12-14 17:10:20,435 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-12-14 17:10:20,435 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-14 17:10:20,436 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (or (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= 16 |ensure_string_is_allocated_bounded_length_~max_size#1|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-14 17:10:20,436 INFO L861 garLoopResultBuilder]: At program point aws_array_eqENTRY(lines 7684 7704) the Hoare annotation is: true [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point aws_array_eqEXIT(lines 7684 7704) no Hoare annotation was computed. [2021-12-14 17:10:20,436 INFO L861 garLoopResultBuilder]: At program point L7686(line 7686) the Hoare annotation is: true [2021-12-14 17:10:20,436 INFO L858 garLoopResultBuilder]: For program point L7688(lines 7685 7704) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point aws_array_eqFINAL(lines 7684 7704) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L861 garLoopResultBuilder]: At program point L7686-1(line 7686) the Hoare annotation is: true [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7364-6(line 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7364-4(line 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7364-3(line 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7364-8(line 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L861 garLoopResultBuilder]: At program point aws_byte_buf_is_validENTRY(lines 7359 7365) the Hoare annotation is: true [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validFINAL(lines 7359 7365) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7361-3(line 7361) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7361-1(line 7361) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point aws_byte_buf_is_validEXIT(lines 7359 7365) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7361(lines 7361 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7361-7(lines 7361 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7361-6(lines 7361 7362) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7361-4(lines 7361 7362) no Hoare annotation was computed. [2021-12-14 17:10:20,437 INFO L858 garLoopResultBuilder]: For program point L7361-11(lines 7361 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point L7361-9(lines 7361 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point L7364-2(line 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point L7364(line 7364) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-14 17:10:20,438 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-14 17:10:20,438 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-12-14 17:10:20,438 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L854 garLoopResultBuilder]: At program point L9408(line 9408) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-12-14 17:10:20,439 INFO L858 garLoopResultBuilder]: For program point L9408-1(line 9408) no Hoare annotation was computed. [2021-12-14 17:10:20,439 INFO L854 garLoopResultBuilder]: At program point L9408-2(lines 9386 9409) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point L6609(lines 6609 6614) no Hoare annotation was computed. [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-14 17:10:20,440 INFO L854 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-14 17:10:20,440 INFO L861 garLoopResultBuilder]: At program point L9558(line 9558) the Hoare annotation is: true [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point L6610-3(lines 6610 6612) no Hoare annotation was computed. [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point L6610-1(lines 6610 6612) no Hoare annotation was computed. [2021-12-14 17:10:20,440 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-14 17:10:20,440 INFO L854 garLoopResultBuilder]: At program point L9551(line 9551) the Hoare annotation is: false [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point L9551-1(line 9551) no Hoare annotation was computed. [2021-12-14 17:10:20,440 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-14 17:10:20,441 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-14 17:10:20,441 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-14 17:10:20,441 INFO L858 garLoopResultBuilder]: For program point L6612-1(line 6612) no Hoare annotation was computed. [2021-12-14 17:10:20,441 INFO L854 garLoopResultBuilder]: At program point L6612(line 6612) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-14 17:10:20,441 INFO L854 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2021-12-14 17:10:20,441 INFO L858 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2021-12-14 17:10:20,441 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-14 17:10:20,441 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-14 17:10:20,441 INFO L858 garLoopResultBuilder]: For program point L6613-1(line 6613) no Hoare annotation was computed. [2021-12-14 17:10:20,441 INFO L854 garLoopResultBuilder]: At program point L6613(line 6613) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-14 17:10:20,441 INFO L858 garLoopResultBuilder]: For program point L9388(line 9388) no Hoare annotation was computed. [2021-12-14 17:10:20,441 INFO L854 garLoopResultBuilder]: At program point L9388-2(line 9388) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-12-14 17:10:20,442 INFO L854 garLoopResultBuilder]: At program point L9553(line 9553) the Hoare annotation is: false [2021-12-14 17:10:20,442 INFO L854 garLoopResultBuilder]: At program point L9553-1(line 9553) the Hoare annotation is: false [2021-12-14 17:10:20,442 INFO L858 garLoopResultBuilder]: For program point L9553-2(line 9553) no Hoare annotation was computed. [2021-12-14 17:10:20,442 INFO L858 garLoopResultBuilder]: For program point L9388-3(line 9388) no Hoare annotation was computed. [2021-12-14 17:10:20,442 INFO L854 garLoopResultBuilder]: At program point L9388-4(line 9388) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-12-14 17:10:20,442 INFO L858 garLoopResultBuilder]: For program point L9388-5(line 9388) no Hoare annotation was computed. [2021-12-14 17:10:20,442 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-14 17:10:20,442 INFO L858 garLoopResultBuilder]: For program point L9389(line 9389) no Hoare annotation was computed. [2021-12-14 17:10:20,442 INFO L854 garLoopResultBuilder]: At program point L9389-2(line 9389) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-12-14 17:10:20,442 INFO L854 garLoopResultBuilder]: At program point L9546(line 9546) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) (+ |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 8)) 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) [2021-12-14 17:10:20,442 INFO L858 garLoopResultBuilder]: For program point L9389-3(line 9389) no Hoare annotation was computed. [2021-12-14 17:10:20,443 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-14 17:10:20,443 INFO L858 garLoopResultBuilder]: For program point L9538(lines 9538 9557) no Hoare annotation was computed. [2021-12-14 17:10:20,443 INFO L854 garLoopResultBuilder]: At program point L9546-1(line 9546) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse3 (select .cse8 16)) (.cse4 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse2 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse5 (* .cse4 (- 1))) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse7 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse3) 18446744073709551616))))) (.cse0 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1| 0) .cse0 .cse1 (<= 0 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1351#1|)) (and .cse2 (<= .cse3 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse3 (* (div .cse4 18446744073709551616) 18446744073709551616) .cse5) 18446744073709551616)))) .cse6 .cse7 .cse0 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse1 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse2 (<= 0 (+ .cse4 (* 18446744073709551616 (div .cse5 18446744073709551616)))) .cse6 .cse7 .cse0 .cse1))))) [2021-12-14 17:10:20,443 INFO L854 garLoopResultBuilder]: At program point L9389-4(line 9389) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-12-14 17:10:20,443 INFO L858 garLoopResultBuilder]: For program point L9546-2(line 9546) no Hoare annotation was computed. [2021-12-14 17:10:20,443 INFO L858 garLoopResultBuilder]: For program point L9389-5(line 9389) no Hoare annotation was computed. [2021-12-14 17:10:20,443 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-14 17:10:20,443 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-14 17:10:20,443 INFO L858 garLoopResultBuilder]: For program point L9390(lines 9390 9398) no Hoare annotation was computed. [2021-12-14 17:10:20,443 INFO L861 garLoopResultBuilder]: At program point L9539(line 9539) the Hoare annotation is: true [2021-12-14 17:10:20,443 INFO L858 garLoopResultBuilder]: For program point L9539-1(lines 9539 9540) no Hoare annotation was computed. [2021-12-14 17:10:20,444 INFO L861 garLoopResultBuilder]: At program point L9539-2(line 9539) the Hoare annotation is: true [2021-12-14 17:10:20,444 INFO L858 garLoopResultBuilder]: For program point L9539-3(line 9539) no Hoare annotation was computed. [2021-12-14 17:10:20,444 INFO L858 garLoopResultBuilder]: For program point L9539-5(lines 9539 9540) no Hoare annotation was computed. [2021-12-14 17:10:20,444 INFO L854 garLoopResultBuilder]: At program point L9556(line 9556) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1| 1) (<= 1 |ULTIMATE.start_aws_string_eq_byte_buf_harness_#t~ret1360#1|) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2021-12-14 17:10:20,444 INFO L858 garLoopResultBuilder]: For program point L9556-1(line 9556) no Hoare annotation was computed. [2021-12-14 17:10:20,444 INFO L858 garLoopResultBuilder]: For program point L9399(lines 9399 9407) no Hoare annotation was computed. [2021-12-14 17:10:20,444 INFO L854 garLoopResultBuilder]: At program point L9548(line 9548) the Hoare annotation is: (let ((.cse8 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse1 (select .cse8 16)) (.cse2 (select .cse8 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0)) (.cse3 (* .cse2 (- 1))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0)) (.cse5 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse1) 18446744073709551616))))) (.cse6 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and .cse0 (<= .cse1 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse1 (* (div .cse2 18446744073709551616) 18446744073709551616) .cse3) 18446744073709551616)))) .cse4 .cse5 .cse6 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse7 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)) (and .cse0 (<= 0 (+ .cse2 (* 18446744073709551616 (div .cse3 18446744073709551616)))) .cse4 .cse5 .cse6 .cse7))))) [2021-12-14 17:10:20,444 INFO L858 garLoopResultBuilder]: For program point L9548-1(lines 9548 9549) no Hoare annotation was computed. [2021-12-14 17:10:20,444 INFO L854 garLoopResultBuilder]: At program point L6600(lines 6598 6601) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.base| 0) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~str~3#1.offset| 0) (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0)) [2021-12-14 17:10:20,444 INFO L858 garLoopResultBuilder]: For program point L9548-3(lines 9548 9549) no Hoare annotation was computed. [2021-12-14 17:10:20,444 INFO L858 garLoopResultBuilder]: For program point L9548-4(lines 9548 9554) no Hoare annotation was computed. [2021-12-14 17:10:20,445 INFO L854 garLoopResultBuilder]: At program point L9548-6(lines 9548 9554) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|))) (let ((.cse5 (select .cse6 16)) (.cse0 (select .cse6 |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset|))) (let ((.cse1 (* .cse0 (- 1))) (.cse2 (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse5) 18446744073709551616))))) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| 0))) (.cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.offset| 0))) (or (and (<= 0 (+ .cse0 (* 18446744073709551616 (div .cse1 18446744073709551616)))) .cse2 .cse3 .cse4) (and (<= .cse5 (+ 18446744073709551615 (* 18446744073709551616 (div (+ .cse5 (* (div .cse0 18446744073709551616) 18446744073709551616) .cse1) 18446744073709551616)))) .cse2 .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base|) ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR) 0)) .cse4 (= |ULTIMATE.start_aws_string_eq_byte_buf_harness_~#buf~3#1.base| |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.base|) (= |ULTIMATE.start_ensure_byte_buf_has_allocated_buffer_member_~buf#1.offset| 0)))))) [2021-12-14 17:10:20,445 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-14 17:10:20,445 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-14 17:10:20,445 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-14 17:10:20,445 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-14 17:10:20,445 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-14 17:10:20,445 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-14 17:10:20,448 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 17:10:20,449 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-14 17:10:20,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 17:10:20,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-14 17:10:20,462 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 17:10:20,462 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-14 17:10:20,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 05:10:20 BoogieIcfgContainer [2021-12-14 17:10:20,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-14 17:10:20,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-14 17:10:20,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-14 17:10:20,466 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-14 17:10:20,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:09:40" (3/4) ... [2021-12-14 17:10:20,468 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-14 17:10:20,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-14 17:10:20,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-14 17:10:20,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_array_eq [2021-12-14 17:10:20,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-14 17:10:20,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_buf_is_valid [2021-12-14 17:10:20,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-14 17:10:20,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-14 17:10:20,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-14 17:10:20,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-14 17:10:20,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-14 17:10:20,490 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 129 nodes and edges [2021-12-14 17:10:20,496 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2021-12-14 17:10:20,497 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-12-14 17:10:20,498 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-14 17:10:20,500 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-14 17:10:20,501 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-14 17:10:20,502 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-14 17:10:20,503 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-14 17:10:20,533 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16) [2021-12-14 17:10:21,348 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-14 17:10:21,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-14 17:10:21,350 INFO L158 Benchmark]: Toolchain (without parser) took 45124.98ms. Allocated memory was 88.1MB in the beginning and 497.0MB in the end (delta: 408.9MB). Free memory was 46.6MB in the beginning and 231.7MB in the end (delta: -185.1MB). Peak memory consumption was 330.5MB. Max. memory is 16.1GB. [2021-12-14 17:10:21,350 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 88.1MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 17:10:21,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2921.40ms. Allocated memory was 88.1MB in the beginning and 176.2MB in the end (delta: 88.1MB). Free memory was 46.6MB in the beginning and 78.4MB in the end (delta: -31.8MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2021-12-14 17:10:21,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 205.47ms. Allocated memory is still 176.2MB. Free memory was 78.4MB in the beginning and 115.2MB in the end (delta: -36.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2021-12-14 17:10:21,352 INFO L158 Benchmark]: Boogie Preprocessor took 96.97ms. Allocated memory is still 176.2MB. Free memory was 115.2MB in the beginning and 108.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-14 17:10:21,352 INFO L158 Benchmark]: RCFGBuilder took 1314.06ms. Allocated memory is still 176.2MB. Free memory was 108.9MB in the beginning and 82.9MB in the end (delta: 26.0MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2021-12-14 17:10:21,354 INFO L158 Benchmark]: TraceAbstraction took 39695.17ms. Allocated memory was 176.2MB in the beginning and 497.0MB in the end (delta: 320.9MB). Free memory was 82.9MB in the beginning and 180.1MB in the end (delta: -97.2MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. [2021-12-14 17:10:21,355 INFO L158 Benchmark]: Witness Printer took 883.94ms. Allocated memory is still 497.0MB. Free memory was 180.1MB in the beginning and 231.7MB in the end (delta: -51.5MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2021-12-14 17:10:21,358 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.74ms. Allocated memory is still 88.1MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2921.40ms. Allocated memory was 88.1MB in the beginning and 176.2MB in the end (delta: 88.1MB). Free memory was 46.6MB in the beginning and 78.4MB in the end (delta: -31.8MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 205.47ms. Allocated memory is still 176.2MB. Free memory was 78.4MB in the beginning and 115.2MB in the end (delta: -36.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.97ms. Allocated memory is still 176.2MB. Free memory was 115.2MB in the beginning and 108.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1314.06ms. Allocated memory is still 176.2MB. Free memory was 108.9MB in the beginning and 82.9MB in the end (delta: 26.0MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 39695.17ms. Allocated memory was 176.2MB in the beginning and 497.0MB in the end (delta: 320.9MB). Free memory was 82.9MB in the beginning and 180.1MB in the end (delta: -97.2MB). Peak memory consumption was 223.7MB. Max. memory is 16.1GB. * Witness Printer took 883.94ms. Allocated memory is still 497.0MB. Free memory was 180.1MB in the beginning and 231.7MB in the end (delta: -51.5MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 18, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2198 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2051 mSDsluCounter, 13532 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1151 IncrementalHoareTripleChecker+Unchecked, 10748 mSDsCounter, 680 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7394 IncrementalHoareTripleChecker+Invalid, 9225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 680 mSolverCounterUnsat, 2784 mSDtfsCounter, 7394 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1992 GetRequests, 1658 SyntacticMatches, 30 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2090 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=13, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 175 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 440 PreInvPairs, 484 NumberOfFragments, 1554 HoareAnnotationTreeSize, 440 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 45 FomulaSimplificationsInter, 3189 FormulaSimplificationTreeSizeReductionInter, 3.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2983 ConstructedInterpolants, 101 QuantifiedInterpolants, 16017 SizeOfPredicates, 75 NumberOfNonLiveVariables, 23635 ConjunctsInSsa, 183 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 1856/2033 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: ((str == 0 && str == 0) && !(buf == 0)) && buf == 0 - InvariantResult [Line: 9558]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9386]: Loop Invariant [2021-12-14 17:10:21,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 17:10:21,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR [2021-12-14 17:10:21,379 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-14 17:10:21,395 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR Derived loop invariant: ((((((((str == 0 && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((unknown-#memory_int-unknown[buf][16] + unknown-#memory_int-unknown[buf][buf] / 18446744073709551616 * 18446744073709551616 + unknown-#memory_int-unknown[buf][buf] * -1) / 18446744073709551616)) && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && !(#memory_$Pointer$[buf][~aws_common_error~0~AWS_ERROR_INVALID_BASE64_STR] == 0)) && buf == 0) && buf == buf) && buf == 0) || (((((str == 0 && 0 <= unknown-#memory_int-unknown[buf][buf] + 18446744073709551616 * (unknown-#memory_int-unknown[buf][buf] * -1 / 18446744073709551616)) && str == 0) && unknown-#memory_int-unknown[buf][16] <= 18446744073709551615 + 18446744073709551616 * ((-1 + unknown-#memory_int-unknown[buf][16]) / 18446744073709551616)) && !(buf == 0)) && buf == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((\old(max_size) == max_size || 16 == max_size) && !(str == 0)) && !(\result == 0)) && !(\old(max_size) == 16) RESULT: Ultimate proved your program to be correct! [2021-12-14 17:10:21,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE