./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_array_eq_ignore_case_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 8de283a79f01a407383b7daa040c59e7c5c73f52f0f9c705f7021a208716cd24 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:09:25,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:09:25,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:09:25,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:09:25,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:09:25,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:09:25,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:09:25,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:09:25,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:09:25,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:09:25,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:09:25,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:09:25,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:09:25,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:09:25,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:09:25,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:09:25,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:09:25,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:09:25,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:09:25,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:09:25,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:09:25,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:09:25,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:09:25,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:09:25,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:09:25,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:09:25,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:09:25,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:09:25,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:09:25,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:09:25,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:09:25,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:09:25,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:09:25,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:09:25,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:09:25,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:09:25,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:09:25,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:09:25,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:09:25,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:09:25,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:09:25,243 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 12:09:25,265 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:09:25,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:09:25,265 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:09:25,266 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:09:25,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:09:25,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:09:25,267 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:09:25,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:09:25,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 12:09:25,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:09:25,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:09:25,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:09:25,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:09:25,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:09:25,268 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:09:25,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:09:25,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:09:25,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:09:25,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:09:25,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:09:25,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:09:25,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:09:25,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:09:25,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 12:09:25,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 12:09:25,270 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:09:25,270 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:09:25,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:09:25,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:09:25,271 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 -> 8de283a79f01a407383b7daa040c59e7c5c73f52f0f9c705f7021a208716cd24 [2021-11-02 12:09:25,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:09:25,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:09:25,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:09:25,505 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:09:25,506 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:09:25,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-11-02 12:09:25,568 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dff4752/424b7cd2588540f4a4b9cf2d4c43bdc3/FLAG919b6c855 [2021-11-02 12:09:26,148 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:09:26,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_array_eq_ignore_case_harness.i [2021-11-02 12:09:26,183 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dff4752/424b7cd2588540f4a4b9cf2d4c43bdc3/FLAG919b6c855 [2021-11-02 12:09:26,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dff4752/424b7cd2588540f4a4b9cf2d4c43bdc3 [2021-11-02 12:09:26,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:09:26,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:09:26,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:09:26,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:09:26,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:09:26,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:09:26" (1/1) ... [2021-11-02 12:09:26,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762b18b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:26, skipping insertion in model container [2021-11-02 12:09:26,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:09:26" (1/1) ... [2021-11-02 12:09:26,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:09:26,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:09:26,862 WARN L228 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_array_eq_ignore_case_harness.i[4498,4511] [2021-11-02 12:09:26,869 WARN L228 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_array_eq_ignore_case_harness.i[4558,4571] [2021-11-02 12:09:26,880 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:09:26,883 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:09:27,356 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,357 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,358 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,358 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,359 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,368 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,368 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,372 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,372 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,555 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:09:27,556 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:09:27,557 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:09:27,557 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:09:27,558 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:09:27,558 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:09:27,559 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:09:27,559 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:09:27,560 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:09:27,560 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:09:27,655 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:09:27,753 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,764 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:09:27,860 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:09:27,878 WARN L228 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_array_eq_ignore_case_harness.i[4498,4511] [2021-11-02 12:09:27,880 WARN L228 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_array_eq_ignore_case_harness.i[4558,4571] [2021-11-02 12:09:27,881 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:09:27,882 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:09:27,969 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,983 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,984 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,984 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,985 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,994 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,994 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,995 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:27,995 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:28,048 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:09:28,049 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:09:28,049 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:09:28,050 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:09:28,051 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:09:28,051 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:09:28,051 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:09:28,052 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:09:28,052 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:09:28,052 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:09:28,095 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:09:28,165 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:28,165 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:09:28,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:09:28,422 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:09:28,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28 WrapperNode [2021-11-02 12:09:28,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:09:28,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:09:28,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:09:28,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:09:28,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:09:28,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:09:28,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:09:28,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:09:28,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:09:28,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:09:28,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:09:28,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:09:28,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (1/1) ... [2021-11-02 12:09:28,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:09:28,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:09:28,910 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-11-02 12:09:28,912 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-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:09:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 12:09:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 12:09:33,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:09:33,466 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-11-02 12:09:33,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:09:33 BoogieIcfgContainer [2021-11-02 12:09:33,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:09:33,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:09:33,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:09:33,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:09:33,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:09:26" (1/3) ... [2021-11-02 12:09:33,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6addae21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:09:33, skipping insertion in model container [2021-11-02 12:09:33,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:09:28" (2/3) ... [2021-11-02 12:09:33,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6addae21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:09:33, skipping insertion in model container [2021-11-02 12:09:33,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:09:33" (3/3) ... [2021-11-02 12:09:33,478 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_array_eq_ignore_case_harness.i [2021-11-02 12:09:33,481 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:09:33,482 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-11-02 12:09:33,519 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:09:33,523 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-11-02 12:09:33,523 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-11-02 12:09:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:33,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 12:09:33,543 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:33,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 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-11-02 12:09:33,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:33,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1732099540, now seen corresponding path program 1 times [2021-11-02 12:09:33,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:33,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411199960] [2021-11-02 12:09:33,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:33,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:33,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:33,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411199960] [2021-11-02 12:09:33,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411199960] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:33,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:33,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 12:09:33,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946640023] [2021-11-02 12:09:33,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:09:33,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:09:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:09:34,016 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 66 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:36,096 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:36,628 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2021-11-02 12:09:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:09:36,630 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-02 12:09:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:36,635 INFO L225 Difference]: With dead ends: 131 [2021-11-02 12:09:36,635 INFO L226 Difference]: Without dead ends: 61 [2021-11-02 12:09:36,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:09:36,639 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2331.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.39ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2578.77ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:36,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 79 Unknown, 0 Unchecked, 1.39ms Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 2578.77ms Time] [2021-11-02 12:09:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-11-02 12:09:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-11-02 12:09:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 60 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2021-11-02 12:09:36,664 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 27 [2021-11-02 12:09:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:36,665 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2021-11-02 12:09:36,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:36,665 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2021-11-02 12:09:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-02 12:09:36,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:36,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 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-11-02 12:09:36,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 12:09:36,666 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:36,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:36,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1816466470, now seen corresponding path program 1 times [2021-11-02 12:09:36,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:36,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044481199] [2021-11-02 12:09:36,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:36,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:36,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:36,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:36,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044481199] [2021-11-02 12:09:36,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044481199] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:36,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:36,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:09:36,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681789816] [2021-11-02 12:09:36,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:09:36,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:36,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:09:36,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:36,894 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:38,940 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:39,931 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2021-11-02 12:09:39,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:09:39,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-02 12:09:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:39,932 INFO L225 Difference]: With dead ends: 132 [2021-11-02 12:09:39,932 INFO L226 Difference]: Without dead ends: 116 [2021-11-02 12:09:39,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 55.46ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:09:39,933 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2698.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.37ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2969.14ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:39,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 222 Unknown, 0 Unchecked, 6.37ms Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 1 Unknown, 0 Unchecked, 2969.14ms Time] [2021-11-02 12:09:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-02 12:09:39,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2021-11-02 12:09:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2021-11-02 12:09:39,941 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 27 [2021-11-02 12:09:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:39,941 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2021-11-02 12:09:39,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2021-11-02 12:09:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 12:09:39,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:39,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-11-02 12:09:39,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 12:09:39,942 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1086636907, now seen corresponding path program 1 times [2021-11-02 12:09:39,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:39,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030136298] [2021-11-02 12:09:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:39,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:40,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:40,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030136298] [2021-11-02 12:09:40,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030136298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:40,468 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:40,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:09:40,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458509942] [2021-11-02 12:09:40,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:09:40,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:40,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:09:40,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:40,469 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:42,518 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:43,377 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2021-11-02 12:09:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:09:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-02 12:09:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:43,379 INFO L225 Difference]: With dead ends: 104 [2021-11-02 12:09:43,379 INFO L226 Difference]: Without dead ends: 102 [2021-11-02 12:09:43,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 81.22ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:09:43,381 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2616.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2850.02ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:43,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 218 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 1 Unknown, 0 Unchecked, 2850.02ms Time] [2021-11-02 12:09:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-11-02 12:09:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2021-11-02 12:09:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 86 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2021-11-02 12:09:43,386 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 29 [2021-11-02 12:09:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:43,387 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2021-11-02 12:09:43,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2021-11-02 12:09:43,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-02 12:09:43,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:43,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-11-02 12:09:43,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 12:09:43,391 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash -571433758, now seen corresponding path program 1 times [2021-11-02 12:09:43,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:43,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273962512] [2021-11-02 12:09:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:43,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:43,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:43,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273962512] [2021-11-02 12:09:43,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273962512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:43,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:43,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:09:43,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961032359] [2021-11-02 12:09:43,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:09:43,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:43,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:09:43,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:09:43,743 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:46,193 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:47,863 INFO L93 Difference]: Finished difference Result 250 states and 292 transitions. [2021-11-02 12:09:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:09:47,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-02 12:09:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:47,866 INFO L225 Difference]: With dead ends: 250 [2021-11-02 12:09:47,866 INFO L226 Difference]: Without dead ends: 241 [2021-11-02 12:09:47,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 267.36ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:09:47,867 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3638.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.77ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3917.70ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:47,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 456 Unknown, 0 Unchecked, 8.77ms Time], IncrementalHoareTripleChecker [5 Valid, 450 Invalid, 1 Unknown, 0 Unchecked, 3917.70ms Time] [2021-11-02 12:09:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-11-02 12:09:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 154. [2021-11-02 12:09:47,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 1.218543046357616) internal successors, (184), 153 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 184 transitions. [2021-11-02 12:09:47,877 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 184 transitions. Word has length 31 [2021-11-02 12:09:47,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:47,877 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 184 transitions. [2021-11-02 12:09:47,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 184 transitions. [2021-11-02 12:09:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 12:09:47,878 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:47,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:09:47,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 12:09:47,879 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash -518323106, now seen corresponding path program 1 times [2021-11-02 12:09:47,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:47,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190608731] [2021-11-02 12:09:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:47,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:48,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:48,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:48,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190608731] [2021-11-02 12:09:48,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190608731] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:48,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:48,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:09:48,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554683094] [2021-11-02 12:09:48,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:09:48,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:48,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:09:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:48,122 INFO L87 Difference]: Start difference. First operand 154 states and 184 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:50,163 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:51,011 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2021-11-02 12:09:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:09:51,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-02 12:09:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:51,013 INFO L225 Difference]: With dead ends: 172 [2021-11-02 12:09:51,013 INFO L226 Difference]: Without dead ends: 167 [2021-11-02 12:09:51,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.15ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:09:51,016 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2611.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.01ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2846.24ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:51,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 210 Unknown, 0 Unchecked, 2.01ms Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2846.24ms Time] [2021-11-02 12:09:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-11-02 12:09:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 156. [2021-11-02 12:09:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 153 states have (on average 1.2156862745098038) internal successors, (186), 155 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 186 transitions. [2021-11-02 12:09:51,041 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 186 transitions. Word has length 32 [2021-11-02 12:09:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:51,041 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 186 transitions. [2021-11-02 12:09:51,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:51,041 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 186 transitions. [2021-11-02 12:09:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 12:09:51,042 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:51,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:09:51,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 12:09:51,043 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:51,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash 618600592, now seen corresponding path program 1 times [2021-11-02 12:09:51,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:51,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597961818] [2021-11-02 12:09:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:51,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:51,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:51,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597961818] [2021-11-02 12:09:51,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597961818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:51,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:51,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 12:09:51,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095559937] [2021-11-02 12:09:51,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:09:51,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:09:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:09:51,475 INFO L87 Difference]: Start difference. First operand 156 states and 186 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:53,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:55,776 INFO L93 Difference]: Finished difference Result 240 states and 282 transitions. [2021-11-02 12:09:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:09:55,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-02 12:09:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:55,778 INFO L225 Difference]: With dead ends: 240 [2021-11-02 12:09:55,778 INFO L226 Difference]: Without dead ends: 202 [2021-11-02 12:09:55,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 523.70ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-11-02 12:09:55,779 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3598.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.62ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3899.05ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:55,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 574 Unknown, 0 Unchecked, 10.62ms Time], IncrementalHoareTripleChecker [12 Valid, 561 Invalid, 1 Unknown, 0 Unchecked, 3899.05ms Time] [2021-11-02 12:09:55,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-02 12:09:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 188. [2021-11-02 12:09:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 185 states have (on average 1.2108108108108109) internal successors, (224), 187 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2021-11-02 12:09:55,788 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 33 [2021-11-02 12:09:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:55,788 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2021-11-02 12:09:55,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2021-11-02 12:09:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-02 12:09:55,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:55,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:09:55,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 12:09:55,790 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash -358402595, now seen corresponding path program 1 times [2021-11-02 12:09:55,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:55,791 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93296062] [2021-11-02 12:09:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:55,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:56,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:56,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93296062] [2021-11-02 12:09:56,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93296062] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:56,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:56,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:09:56,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577039678] [2021-11-02 12:09:56,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:09:56,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:56,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:09:56,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:09:56,055 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:58,100 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:09:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:09:58,958 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2021-11-02 12:09:58,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:09:58,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-02 12:09:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:09:58,965 INFO L225 Difference]: With dead ends: 239 [2021-11-02 12:09:58,965 INFO L226 Difference]: Without dead ends: 213 [2021-11-02 12:09:58,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.65ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:09:58,967 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2656.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.60ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2858.53ms IncrementalHoareTripleChecker+Time [2021-11-02 12:09:58,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 236 Unknown, 0 Unchecked, 2.60ms Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 2858.53ms Time] [2021-11-02 12:09:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-11-02 12:09:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 196. [2021-11-02 12:09:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 193 states have (on average 1.1917098445595855) internal successors, (230), 195 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 230 transitions. [2021-11-02 12:09:58,981 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 230 transitions. Word has length 33 [2021-11-02 12:09:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:09:58,983 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 230 transitions. [2021-11-02 12:09:58,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:09:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 230 transitions. [2021-11-02 12:09:58,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-02 12:09:58,987 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:09:58,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:09:58,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 12:09:58,990 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:09:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:09:58,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1248189667, now seen corresponding path program 1 times [2021-11-02 12:09:58,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:09:58,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497448259] [2021-11-02 12:09:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:09:58,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:09:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:09:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:09:59,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:09:59,565 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497448259] [2021-11-02 12:09:59,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497448259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:09:59,566 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:09:59,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:09:59,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350643545] [2021-11-02 12:09:59,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:09:59,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:09:59,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:09:59,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:09:59,567 INFO L87 Difference]: Start difference. First operand 196 states and 230 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:01,614 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:04,896 INFO L93 Difference]: Finished difference Result 308 states and 350 transitions. [2021-11-02 12:10:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 12:10:04,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-11-02 12:10:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:04,898 INFO L225 Difference]: With dead ends: 308 [2021-11-02 12:10:04,898 INFO L226 Difference]: Without dead ends: 294 [2021-11-02 12:10:04,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1198.63ms TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:10:04,899 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 520 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4002.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.77ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4354.60ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:04,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 0 Invalid, 742 Unknown, 0 Unchecked, 12.77ms Time], IncrementalHoareTripleChecker [6 Valid, 735 Invalid, 1 Unknown, 0 Unchecked, 4354.60ms Time] [2021-11-02 12:10:04,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-02 12:10:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 220. [2021-11-02 12:10:04,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 217 states have (on average 1.1889400921658986) internal successors, (258), 219 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:04,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 258 transitions. [2021-11-02 12:10:04,905 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 258 transitions. Word has length 34 [2021-11-02 12:10:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:04,905 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 258 transitions. [2021-11-02 12:10:04,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 258 transitions. [2021-11-02 12:10:04,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-02 12:10:04,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:04,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:04,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 12:10:04,906 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:04,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash 513264780, now seen corresponding path program 1 times [2021-11-02 12:10:04,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:04,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182091502] [2021-11-02 12:10:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:04,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:05,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:05,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182091502] [2021-11-02 12:10:05,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182091502] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:05,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:05,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:10:05,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52801941] [2021-11-02 12:10:05,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:10:05,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:10:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:10:05,234 INFO L87 Difference]: Start difference. First operand 220 states and 258 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:07,277 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:08,097 INFO L93 Difference]: Finished difference Result 252 states and 295 transitions. [2021-11-02 12:10:08,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:10:08,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-02 12:10:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:08,098 INFO L225 Difference]: With dead ends: 252 [2021-11-02 12:10:08,098 INFO L226 Difference]: Without dead ends: 222 [2021-11-02 12:10:08,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 84.04ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:10:08,099 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2550.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.79ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2812.79ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:08,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 205 Unknown, 0 Unchecked, 1.79ms Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 1 Unknown, 0 Unchecked, 2812.79ms Time] [2021-11-02 12:10:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-11-02 12:10:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2021-11-02 12:10:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.175531914893617) internal successors, (221), 189 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2021-11-02 12:10:08,104 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 35 [2021-11-02 12:10:08,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:08,104 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2021-11-02 12:10:08,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2021-11-02 12:10:08,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 12:10:08,105 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:08,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:08,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 12:10:08,105 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:08,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1203766261, now seen corresponding path program 1 times [2021-11-02 12:10:08,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:08,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525245230] [2021-11-02 12:10:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:08,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:08,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:08,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525245230] [2021-11-02 12:10:08,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525245230] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:08,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:08,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:10:08,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010740519] [2021-11-02 12:10:08,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:10:08,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:10:08,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:10:08,485 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:10,527 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:12,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:12,095 INFO L93 Difference]: Finished difference Result 228 states and 262 transitions. [2021-11-02 12:10:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 12:10:12,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-02 12:10:12,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:12,096 INFO L225 Difference]: With dead ends: 228 [2021-11-02 12:10:12,096 INFO L226 Difference]: Without dead ends: 198 [2021-11-02 12:10:12,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 471.45ms TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:10:12,105 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3083.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.40ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3280.71ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:12,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 4.40ms Time], IncrementalHoareTripleChecker [5 Valid, 422 Invalid, 1 Unknown, 0 Unchecked, 3280.71ms Time] [2021-11-02 12:10:12,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-02 12:10:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2021-11-02 12:10:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 188 states have (on average 1.1702127659574468) internal successors, (220), 189 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2021-11-02 12:10:12,111 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 36 [2021-11-02 12:10:12,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:12,112 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2021-11-02 12:10:12,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2021-11-02 12:10:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 12:10:12,112 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:12,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:12,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 12:10:12,113 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:12,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1546392854, now seen corresponding path program 1 times [2021-11-02 12:10:12,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:12,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43746910] [2021-11-02 12:10:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:12,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:12,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:12,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43746910] [2021-11-02 12:10:12,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43746910] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:12,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:12,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:10:12,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469831487] [2021-11-02 12:10:12,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:10:12,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:10:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:10:12,451 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:14,495 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:15,356 INFO L93 Difference]: Finished difference Result 281 states and 326 transitions. [2021-11-02 12:10:15,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:10:15,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-02 12:10:15,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:15,358 INFO L225 Difference]: With dead ends: 281 [2021-11-02 12:10:15,358 INFO L226 Difference]: Without dead ends: 258 [2021-11-02 12:10:15,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 164.31ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:10:15,359 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2610.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.11ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2832.33ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:15,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 220 Unknown, 0 Unchecked, 2.11ms Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 1 Unknown, 0 Unchecked, 2832.33ms Time] [2021-11-02 12:10:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-02 12:10:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 194. [2021-11-02 12:10:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.1770833333333333) internal successors, (226), 193 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 226 transitions. [2021-11-02 12:10:15,364 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 226 transitions. Word has length 37 [2021-11-02 12:10:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:15,364 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 226 transitions. [2021-11-02 12:10:15,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 226 transitions. [2021-11-02 12:10:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-02 12:10:15,365 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:15,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:15,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 12:10:15,365 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:15,365 INFO L85 PathProgramCache]: Analyzing trace with hash -865834336, now seen corresponding path program 1 times [2021-11-02 12:10:15,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:15,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941782402] [2021-11-02 12:10:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:15,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:15,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:15,874 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941782402] [2021-11-02 12:10:15,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941782402] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:15,874 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:15,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:10:15,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002625096] [2021-11-02 12:10:15,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:10:15,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:10:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:10:15,874 INFO L87 Difference]: Start difference. First operand 194 states and 226 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:17,915 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:20,700 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2021-11-02 12:10:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 12:10:20,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-02 12:10:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:20,702 INFO L225 Difference]: With dead ends: 261 [2021-11-02 12:10:20,702 INFO L226 Difference]: Without dead ends: 231 [2021-11-02 12:10:20,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 760.93ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-11-02 12:10:20,703 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 501 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3898.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.90ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4199.84ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:20,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [501 Valid, 0 Invalid, 748 Unknown, 0 Unchecked, 12.90ms Time], IncrementalHoareTripleChecker [13 Valid, 734 Invalid, 1 Unknown, 0 Unchecked, 4199.84ms Time] [2021-11-02 12:10:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-02 12:10:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 194. [2021-11-02 12:10:20,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.171875) internal successors, (225), 193 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 225 transitions. [2021-11-02 12:10:20,708 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 225 transitions. Word has length 37 [2021-11-02 12:10:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:20,708 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 225 transitions. [2021-11-02 12:10:20,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 225 transitions. [2021-11-02 12:10:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-02 12:10:20,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:20,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:20,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 12:10:20,709 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1604639621, now seen corresponding path program 1 times [2021-11-02 12:10:20,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:20,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092502422] [2021-11-02 12:10:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:20,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:21,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:21,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092502422] [2021-11-02 12:10:21,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092502422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:21,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:21,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:10:21,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353150995] [2021-11-02 12:10:21,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:10:21,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:21,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:10:21,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:10:21,162 INFO L87 Difference]: Start difference. First operand 194 states and 225 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:23,205 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:25,912 INFO L93 Difference]: Finished difference Result 276 states and 320 transitions. [2021-11-02 12:10:25,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:10:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-02 12:10:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:25,914 INFO L225 Difference]: With dead ends: 276 [2021-11-02 12:10:25,914 INFO L226 Difference]: Without dead ends: 230 [2021-11-02 12:10:25,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 753.08ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:10:25,914 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 324 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3870.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.14ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4176.60ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:25,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 0 Invalid, 668 Unknown, 0 Unchecked, 20.14ms Time], IncrementalHoareTripleChecker [4 Valid, 663 Invalid, 1 Unknown, 0 Unchecked, 4176.60ms Time] [2021-11-02 12:10:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-02 12:10:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2021-11-02 12:10:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.1614583333333333) internal successors, (223), 193 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2021-11-02 12:10:25,920 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 39 [2021-11-02 12:10:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:25,920 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2021-11-02 12:10:25,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2021-11-02 12:10:25,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-02 12:10:25,920 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:25,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:25,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 12:10:25,920 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1876182655, now seen corresponding path program 1 times [2021-11-02 12:10:25,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:25,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936725243] [2021-11-02 12:10:25,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:25,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:38,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:38,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936725243] [2021-11-02 12:10:38,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936725243] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:38,169 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:38,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-02 12:10:38,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203451553] [2021-11-02 12:10:38,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-02 12:10:38,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:38,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-02 12:10:38,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:10:38,171 INFO L87 Difference]: Start difference. First operand 194 states and 223 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:40,677 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:47,806 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2021-11-02 12:10:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-02 12:10:47,806 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-11-02 12:10:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:47,807 INFO L225 Difference]: With dead ends: 238 [2021-11-02 12:10:47,807 INFO L226 Difference]: Without dead ends: 236 [2021-11-02 12:10:47,808 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 4143.44ms TimeCoverageRelationStatistics Valid=289, Invalid=833, Unknown=0, NotChecked=0, Total=1122 [2021-11-02 12:10:47,808 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 527 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6218.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.20ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6677.04ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:47,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 17.20ms Time], IncrementalHoareTripleChecker [46 Valid, 1224 Invalid, 1 Unknown, 0 Unchecked, 6677.04ms Time] [2021-11-02 12:10:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-11-02 12:10:47,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2021-11-02 12:10:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.1597938144329898) internal successors, (225), 195 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:47,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2021-11-02 12:10:47,815 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 40 [2021-11-02 12:10:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:47,816 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2021-11-02 12:10:47,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2021-11-02 12:10:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:10:47,818 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:47,818 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:47,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 12:10:47,818 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1569116892, now seen corresponding path program 1 times [2021-11-02 12:10:47,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:47,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133914613] [2021-11-02 12:10:47,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:47,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:10:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:10:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:10:51,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:10:51,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133914613] [2021-11-02 12:10:51,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133914613] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:10:51,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:10:51,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:10:51,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366204133] [2021-11-02 12:10:51,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:10:51,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:10:51,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:10:51,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:10:51,808 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:54,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:10:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:10:58,464 INFO L93 Difference]: Finished difference Result 254 states and 289 transitions. [2021-11-02 12:10:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-02 12:10:58,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-02 12:10:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:10:58,465 INFO L225 Difference]: With dead ends: 254 [2021-11-02 12:10:58,465 INFO L226 Difference]: Without dead ends: 208 [2021-11-02 12:10:58,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1587.27ms TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2021-11-02 12:10:58,466 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4942.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.85ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5457.69ms IncrementalHoareTripleChecker+Time [2021-11-02 12:10:58,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 934 Unknown, 0 Unchecked, 9.85ms Time], IncrementalHoareTripleChecker [26 Valid, 907 Invalid, 1 Unknown, 0 Unchecked, 5457.69ms Time] [2021-11-02 12:10:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-02 12:10:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 196. [2021-11-02 12:10:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.1494845360824741) internal successors, (223), 195 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2021-11-02 12:10:58,473 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 41 [2021-11-02 12:10:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:10:58,473 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2021-11-02 12:10:58,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:10:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2021-11-02 12:10:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 12:10:58,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:10:58,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:10:58,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 12:10:58,474 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:10:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:10:58,474 INFO L85 PathProgramCache]: Analyzing trace with hash 664052998, now seen corresponding path program 1 times [2021-11-02 12:10:58,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:10:58,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477362180] [2021-11-02 12:10:58,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:10:58,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:11:02,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:02,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477362180] [2021-11-02 12:11:02,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477362180] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:02,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:02,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:11:02,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521910982] [2021-11-02 12:11:02,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:11:02,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:02,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:11:02,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:11:02,114 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:04,715 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:07,801 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2021-11-02 12:11:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:11:07,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-02 12:11:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:07,803 INFO L225 Difference]: With dead ends: 204 [2021-11-02 12:11:07,803 INFO L226 Difference]: Without dead ends: 130 [2021-11-02 12:11:07,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 981.26ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:11:07,803 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4594.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.79ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5068.54ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:07,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 765 Unknown, 0 Unchecked, 7.79ms Time], IncrementalHoareTripleChecker [4 Valid, 760 Invalid, 1 Unknown, 0 Unchecked, 5068.54ms Time] [2021-11-02 12:11:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-02 12:11:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2021-11-02 12:11:07,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0978260869565217) internal successors, (101), 93 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2021-11-02 12:11:07,807 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 42 [2021-11-02 12:11:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:07,807 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2021-11-02 12:11:07,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2021-11-02 12:11:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 12:11:07,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:07,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:11:07,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 12:11:07,808 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:11:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1320231428, now seen corresponding path program 1 times [2021-11-02 12:11:07,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:07,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179972969] [2021-11-02 12:11:07,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:07,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:28,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:11:28,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:28,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179972969] [2021-11-02 12:11:28,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179972969] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:28,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:28,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 12:11:28,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119520481] [2021-11-02 12:11:28,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 12:11:28,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:28,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 12:11:28,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:11:28,134 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:30,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:34,977 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2021-11-02 12:11:34,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 12:11:34,977 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-02 12:11:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:34,978 INFO L225 Difference]: With dead ends: 130 [2021-11-02 12:11:34,978 INFO L226 Difference]: Without dead ends: 92 [2021-11-02 12:11:34,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3090.64ms TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2021-11-02 12:11:34,979 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 359 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4152.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.09ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4510.05ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:34,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 0 Invalid, 685 Unknown, 0 Unchecked, 9.09ms Time], IncrementalHoareTripleChecker [5 Valid, 679 Invalid, 1 Unknown, 0 Unchecked, 4510.05ms Time] [2021-11-02 12:11:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-11-02 12:11:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2021-11-02 12:11:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-11-02 12:11:34,982 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 44 [2021-11-02 12:11:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:34,982 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-11-02 12:11:34,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-11-02 12:11:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-02 12:11:34,982 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:34,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:11:34,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 12:11:34,982 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:11:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2088300975, now seen corresponding path program 1 times [2021-11-02 12:11:34,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:34,983 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814563113] [2021-11-02 12:11:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:34,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:11:35,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:35,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814563113] [2021-11-02 12:11:35,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814563113] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:35,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:35,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:11:35,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856163533] [2021-11-02 12:11:35,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:11:35,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:35,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:11:35,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:11:35,310 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:37,358 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:38,539 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2021-11-02 12:11:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:11:38,539 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-02 12:11:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:38,540 INFO L225 Difference]: With dead ends: 92 [2021-11-02 12:11:38,540 INFO L226 Difference]: Without dead ends: 56 [2021-11-02 12:11:38,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 231.03ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:11:38,540 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2783.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.25ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3113.94ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:38,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 280 Unknown, 0 Unchecked, 2.25ms Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 1 Unknown, 0 Unchecked, 3113.94ms Time] [2021-11-02 12:11:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-11-02 12:11:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-11-02 12:11:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-11-02 12:11:38,543 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2021-11-02 12:11:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:38,543 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-11-02 12:11:38,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-11-02 12:11:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 12:11:38,544 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:11:38,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-02 12:11:38,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 12:11:38,544 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 12:11:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:11:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1768480620, now seen corresponding path program 1 times [2021-11-02 12:11:38,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:11:38,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128530837] [2021-11-02 12:11:38,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:11:38,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:11:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:11:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:11:42,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:11:42,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128530837] [2021-11-02 12:11:42,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128530837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:11:42,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:11:42,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-02 12:11:42,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353579139] [2021-11-02 12:11:42,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:11:42,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:11:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:11:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:11:42,805 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:44,849 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:11:47,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:11:47,238 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-11-02 12:11:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 12:11:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-02 12:11:47,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:11:47,240 INFO L225 Difference]: With dead ends: 56 [2021-11-02 12:11:47,240 INFO L226 Difference]: Without dead ends: 0 [2021-11-02 12:11:47,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1647.35ms TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2021-11-02 12:11:47,240 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3022.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.62ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3374.69ms IncrementalHoareTripleChecker+Time [2021-11-02 12:11:47,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 356 Unknown, 0 Unchecked, 3.62ms Time], IncrementalHoareTripleChecker [23 Valid, 332 Invalid, 1 Unknown, 0 Unchecked, 3374.69ms Time] [2021-11-02 12:11:47,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-02 12:11:47,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-02 12:11:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-02 12:11:47,241 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-11-02 12:11:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:11:47,241 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-02 12:11:47,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:11:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-02 12:11:47,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-02 12:11:47,243 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-11-02 12:11:47,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2021-11-02 12:11:47,251 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2021-11-02 12:11:47,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 12:11:47,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-02 12:11:47,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:47,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-02 12:11:55,524 WARN L210 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 188 DAG size of output: 135 [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point L7129-2(lines 7129 7131) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point L7129(lines 7129 7131) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,873 INFO L858 garLoopResultBuilder]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L210-7(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L210-9(lines 7686 7690) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L6900-2(lines 6900 6902) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L6900(lines 6900 6902) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L6900-6(lines 6900 6902) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L211-4(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L6900-4(lines 6900 6902) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L854 garLoopResultBuilder]: At program point L6900-3(lines 6899 6903) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 (<= |~#s_tolower_table~0.offset| 0) (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (and (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse0 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L211-6(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,874 INFO L858 garLoopResultBuilder]: For program point L211-8(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,875 INFO L854 garLoopResultBuilder]: At program point L6900-7(lines 6899 6903) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse1 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse12 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse2 (<= 0 |~#s_tolower_table~0.offset|)) (.cse3 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse4 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse5 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse7 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse8 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse9 (<= |~#s_tolower_table~0.offset| 0)) (.cse10 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse11 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse12 .cse11) (and .cse13 .cse7 .cse8 .cse12) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-11-02 12:12:02,875 INFO L861 garLoopResultBuilder]: At program point L9006(line 9006) the Hoare annotation is: true [2021-11-02 12:12:02,875 INFO L858 garLoopResultBuilder]: For program point L211-10(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,875 INFO L858 garLoopResultBuilder]: For program point L211-12(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,875 INFO L854 garLoopResultBuilder]: At program point L261(line 261) the Hoare annotation is: (= |~#s_tolower_table~0.offset| 0) [2021-11-02 12:12:02,875 INFO L858 garLoopResultBuilder]: For program point L211-14(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,875 INFO L854 garLoopResultBuilder]: At program point L261-1(line 261) the Hoare annotation is: (let ((.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse2 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 .cse1 .cse2 (<= |~#s_tolower_table~0.offset| 0) .cse3) (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (not .cse3) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse1 .cse2 (not .cse0) (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-11-02 12:12:02,875 INFO L854 garLoopResultBuilder]: At program point L261-2(line 261) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0))) (or (and (<= 0 |~#s_tolower_table~0.offset|) (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0) .cse0 (<= |~#s_tolower_table~0.offset| 0)) (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse0 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)))) [2021-11-02 12:12:02,875 INFO L858 garLoopResultBuilder]: For program point L211-16(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,875 INFO L858 garLoopResultBuilder]: For program point L211-18(line 211) no Hoare annotation was computed. [2021-11-02 12:12:02,876 INFO L854 garLoopResultBuilder]: At program point L7702(lines 7675 7705) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0)) (.cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse36 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse43 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0))) (let ((.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse32 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse39 (or (and .cse36 .cse43) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse40 (not .cse2)) (.cse23 (not .cse6)) (.cse26 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse5 (= |ULTIMATE.start_aws_array_eq_ignore_case_#res| 0))) (let ((.cse14 (or (and .cse23 .cse26 .cse39 .cse40 .cse5) (and .cse23 .cse26 .cse2 .cse3 .cse5))) (.cse22 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse33 (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse37 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (.cse16 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse20 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse24 (let ((.cse45 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base|))) (= (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base) (select .cse45 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset|)) (select .cse45 8)))) (.cse27 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse28 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse30 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse41 (or (and .cse23 .cse26 .cse2 .cse3) (and .cse23 .cse26 .cse39 .cse40))) (.cse34 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse38 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse17 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse18 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse19 (<= 0 |~#s_tolower_table~0.offset|)) (.cse21 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse25 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse29 (let ((.cse44 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse44 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse44 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|))))) (.cse31 (<= |~#s_tolower_table~0.offset| 0)) (.cse35 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse4 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse7 (or (not (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) .cse32)) (.cse42 (not .cse43)) (.cse8 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse9 (or (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| 0) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0 0))) (.cse10 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse11 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse12 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse13 (not .cse1)) (.cse15 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse24 .cse25 .cse26 .cse8 .cse27 .cse28 .cse3 .cse29 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse15) (and .cse0 .cse1 .cse26 .cse4 .cse39 .cse40 .cse5 .cse6) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse41 .cse13 .cse15) (and .cse16 .cse7 .cse19 .cse20 .cse21 .cse0 .cse24 .cse25 .cse8 .cse27 .cse28 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse34 .cse35 .cse14 .cse38 .cse15) (and .cse16 .cse17 .cse7 .cse18 .cse42 .cse19 .cse20 .cse21 .cse0 .cse22 .cse23 .cse24 .cse25 .cse26 .cse8 .cse27 .cse28 .cse3 .cse29 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse33 .cse5 .cse34 .cse35 .cse36 .cse37 .cse38 .cse15) (and .cse32 (or (and .cse0 .cse1 .cse26 .cse4 .cse39 .cse40 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6))) (and .cse42 .cse23 .cse26 .cse39 .cse32 .cse40) (and .cse16 .cse19 .cse20 .cse21 .cse0 .cse24 .cse25 .cse8 .cse27 .cse28 .cse4 .cse30 .cse10 .cse11 .cse12 .cse31 .cse32 .cse41 .cse34 .cse35 .cse38 .cse15) (and .cse17 .cse18 .cse19 .cse21 .cse25 .cse3 .cse29 .cse31 (or (and .cse0 .cse1 .cse26 .cse4 .cse11 .cse32 .cse6) (and .cse23 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse15)) .cse35 .cse36) (and .cse17 .cse18 .cse19 .cse21 .cse25 .cse3 .cse29 .cse31 .cse35 .cse36 (or (and .cse7 .cse0 .cse1 .cse26 .cse4 .cse11 .cse5 .cse6) (and .cse7 .cse42 .cse23 .cse26 .cse8 .cse9 .cse10 .cse11 .cse12 .cse5 .cse13 .cse15))))))) [2021-11-02 12:12:02,876 INFO L858 garLoopResultBuilder]: For program point L7694-4(lines 7694 7700) no Hoare annotation was computed. [2021-11-02 12:12:02,876 INFO L854 garLoopResultBuilder]: At program point L7694-3(lines 7694 7700) the Hoare annotation is: (let ((.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse19 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse28 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0)) (.cse7 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse20 (not .cse7)) (.cse8 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse9 (or (and .cse19 .cse28) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse6 (= ULTIMATE.start_aws_array_eq_ignore_case_~len_b ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse10 (not .cse3)) (.cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0))) (let ((.cse22 (or (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| 0) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0 0))) (.cse26 (not .cse2)) (.cse11 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse12 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse16 (let ((.cse39 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse39 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse39 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|))))) (.cse30 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse13 (<= 0 |~#s_tolower_table~0.offset|)) (.cse31 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse14 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse29 (or (and .cse20 .cse8 .cse3 .cse4 .cse6) (and .cse20 .cse8 .cse9 .cse6 .cse10))) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse32 (let ((.cse38 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base|))) (= (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base) (select .cse38 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset|)) (select .cse38 8)))) (.cse15 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse21 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse33 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse34 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse5 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0)) (.cse35 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse23 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse24 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_~len_a)) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse17 (<= |~#s_tolower_table~0.offset| 0)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse36 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse18 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse37 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse27 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse8 .cse5 .cse9 .cse6 .cse10 .cse7))) (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse4 .cse16 .cse17 .cse18 .cse19 (or (and .cse20 .cse8 .cse21 .cse22 .cse23 .cse24 .cse6 .cse25 .cse0 .cse26 .cse27) (and .cse1 .cse2 .cse8 .cse5 .cse24 .cse6 .cse0 .cse7))) (and (not .cse28) .cse20 .cse8 .cse9 .cse6 .cse0 .cse10) (and .cse29 .cse21 .cse22 .cse23 .cse24 .cse25 .cse0 .cse26 .cse27) (and .cse30 .cse11 .cse12 .cse13 .cse31 .cse14 .cse1 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) .cse20 .cse32 .cse15 .cse8 .cse21 .cse33 .cse34 .cse4 .cse16 .cse5 .cse35 .cse23 .cse24 .cse6 .cse25 .cse17 .cse0 (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base)) .cse36 .cse18 .cse19 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1) .cse37 .cse27) (and .cse30 .cse13 .cse31 .cse14 .cse29 .cse1 .cse32 .cse15 .cse21 .cse33 .cse34 .cse5 .cse35 .cse23 .cse24 .cse25 .cse17 .cse0 .cse36 .cse18 .cse37 .cse27))))) [2021-11-02 12:12:02,876 INFO L858 garLoopResultBuilder]: For program point L7694-2(lines 7694 7700) no Hoare annotation was computed. [2021-11-02 12:12:02,876 INFO L858 garLoopResultBuilder]: For program point L8999(lines 8967 9005) no Hoare annotation was computed. [2021-11-02 12:12:02,876 INFO L858 garLoopResultBuilder]: For program point L8975-2(lines 8975 8981) no Hoare annotation was computed. [2021-11-02 12:12:02,876 INFO L858 garLoopResultBuilder]: For program point L7695(lines 7695 7699) no Hoare annotation was computed. [2021-11-02 12:12:02,876 INFO L858 garLoopResultBuilder]: For program point L8975(lines 8975 8981) no Hoare annotation was computed. [2021-11-02 12:12:02,876 INFO L854 garLoopResultBuilder]: At program point L6886(lines 6882 6887) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_bounded_malloc_#res.offset| 0) (= |~#s_tolower_table~0.offset| 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) [2021-11-02 12:12:02,876 INFO L854 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: (let ((.cse5 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse8 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse10 (not .cse3)) (.cse13 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse14 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse16 (not .cse5)) (.cse9 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse11 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse12 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse7 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse15 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (let ((.cse0 (= |~#s_tolower_table~0.offset| 0)) (.cse1 (let ((.cse17 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse18 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse19 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse20 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse21 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_save_byte_from_array_~size)) (.cse22 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse23 (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base)) (.cse24 (not (= ULTIMATE.start_save_byte_from_array_~storage.base 0))) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse26 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0))) (or (and .cse17 .cse18 .cse19 .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse7 .cse20 .cse21 .cse14 .cse15 .cse16 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse17 .cse18 .cse19 .cse9 .cse4 .cse11 .cse5 .cse12 .cse7 .cse20 .cse21 .cse3 .cse15 .cse22 .cse23 .cse24 .cse25 .cse26 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0)))))) (.cse6 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse2 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (and .cse4 .cse5 .cse6 .cse7 .cse2 .cse3) (and (<= 0 |~#s_tolower_table~0.offset|) .cse8 .cse9 .cse4 .cse10 .cse11 .cse12 .cse13 .cse6 .cse7 .cse2 (<= |~#s_tolower_table~0.offset| 0) .cse14 .cse15 .cse16))))) [2021-11-02 12:12:02,877 INFO L854 garLoopResultBuilder]: At program point L263-1(line 263) the Hoare annotation is: (let ((.cse30 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0)) (.cse8 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset| 0)) (.cse31 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| 0)) (.cse6 (= |ULTIMATE.start_can_fail_malloc_#res.base| 0))) (let ((.cse18 (= ULTIMATE.start_save_byte_from_array_~array.offset 0)) (.cse11 (<= 0 |~#s_tolower_table~0.offset|)) (.cse7 (<= (+ |ULTIMATE.start_can_fail_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse12 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse13 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse20 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.offset| 0)) (.cse21 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 1) |#StackHeapBarrier|)) (.cse22 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base ULTIMATE.start_save_byte_from_array_~array.base)) (.cse23 (not (= ULTIMATE.start_save_byte_from_array_~array.base ULTIMATE.start_save_byte_from_array_~storage.base))) (.cse24 (= ULTIMATE.start_save_byte_from_array_~size ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0)) (.cse25 (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_rhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (.cse16 (<= |~#s_tolower_table~0.offset| 0)) (.cse26 (= (select |#valid| |ULTIMATE.start_can_fail_malloc_#res.base|) 1)) (.cse17 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1)) (.cse27 (= ULTIMATE.start_save_byte_from_array_~storage.offset 0)) (.cse28 (not (= ULTIMATE.start_save_byte_from_array_~array.base 0))) (.cse19 (not .cse6)) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse4 (or (and .cse8 .cse31) (<= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 0))) (.cse5 (not .cse30)) (.cse0 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.offset 0)) (.cse1 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs~0.base 0)) (.cse14 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse3 (= |ULTIMATE.start_can_fail_malloc_#res.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (not (= |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base| ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base ULTIMATE.start_save_byte_from_array_~storage.base)) .cse8 (let ((.cse9 (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|)) (.cse10 (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1)) (.cse15 (let ((.cse29 (select |#memory_int| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|))) (= (select .cse29 8) (select (select |#memory_int| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) (select .cse29 |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.offset|)))))) (or (and .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse1 .cse2 .cse14 .cse15 .cse3 .cse16 .cse6 .cse17) (and .cse18 .cse9 .cse10 .cse11 .cse12 .cse0 .cse19 .cse13 .cse2 .cse20 .cse21 .cse22 .cse14 .cse15 .cse3 .cse23 .cse24 .cse25 .cse16 .cse26 .cse17 .cse27 .cse28))) (= (select |#valid| |ULTIMATE.start_aws_array_eq_ignore_case_harness_~#old_byte_from_lhs~0.base|) 1)) (and .cse18 .cse11 .cse7 .cse12 .cse0 .cse13 .cse20 .cse21 .cse22 .cse3 .cse23 .cse24 .cse25 .cse16 (or (and .cse19 .cse2 .cse30 .cse14) (and .cse19 .cse2 .cse4 .cse5)) .cse26 .cse17 .cse27 .cse28) (and (not .cse31) .cse19 .cse2 .cse4 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs_len~0 ULTIMATE.start_aws_array_eq_ignore_case_harness_~rhs_len~0) .cse5) (and .cse0 .cse1 .cse30 .cse14 .cse3 .cse6)))) [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L8967(lines 8967 9005) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L854 garLoopResultBuilder]: At program point L6886-1(lines 6882 6887) the Hoare annotation is: (let ((.cse0 (<= (+ |ULTIMATE.start_bounded_malloc_#res.base| 1) |#StackHeapBarrier|)) (.cse1 (= |ULTIMATE.start_bounded_malloc_#res.offset| 0)) (.cse2 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse3 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.offset 0)) (.cse4 (= (select |#valid| |ULTIMATE.start_bounded_malloc_#res.base|) 1))) (or (and (<= (+ ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 1) |#StackHeapBarrier|) (= (select |#valid| ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base) 1) .cse0 .cse1 (= |~#s_tolower_table~0.offset| 0) .cse2 .cse3 .cse4) (and (<= 0 |~#s_tolower_table~0.offset|) .cse0 .cse1 .cse2 (= ULTIMATE.start_aws_array_eq_ignore_case_harness_~lhs~0.base 0) .cse3 (<= |~#s_tolower_table~0.offset| 0) .cse4))) [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L7134(lines 7134 7140) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L7134-1(lines 7134 7140) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L7135(lines 7135 7139) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L223-3(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L223-4(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L7135-2(lines 7135 7139) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L223-6(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L223-7(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L9002(lines 9002 9004) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L8994(lines 8994 8996) no Hoare annotation was computed. [2021-11-02 12:12:02,877 INFO L858 garLoopResultBuilder]: For program point L8994-1(lines 8967 9005) no Hoare annotation was computed. [2021-11-02 12:12:02,878 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-11-02 12:12:02,880 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:12:02,881 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 12:12:02,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:12:02 BoogieIcfgContainer [2021-11-02 12:12:02,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 12:12:02,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 12:12:02,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 12:12:02,968 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 12:12:02,968 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:09:33" (3/4) ... [2021-11-02 12:12:02,971 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-02 12:12:02,991 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 131 nodes and edges [2021-11-02 12:12:02,992 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2021-11-02 12:12:02,993 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2021-11-02 12:12:02,994 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-11-02 12:12:02,994 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-11-02 12:12:02,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-02 12:12:02,996 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-02 12:12:02,997 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-02 12:12:03,021 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= s_tolower_table && \result == 0) && s_tolower_table <= 0) && \result == 0) || (((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \valid[\result] == 1 [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 <= s_tolower_table && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) || ((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && !(lhs == 0)) && \valid[\result] == 1) && \valid[\result] == 1) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \result == 0) || (((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \valid[\old_byte_from_lhs] == 1)) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 <= s_tolower_table && lhs == 0) && lhs == 0) && s_tolower_table <= 0) || (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((\result + 1 <= unknown-#StackHeapBarrier-unknown && !(\old_byte_from_lhs == storage)) && !(lhs == storage)) && \old_byte_from_lhs == 0) && ((((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1) || ((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)))) && \valid[\old_byte_from_lhs] == 1)) || ((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1)) || (((lhs == 0 && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) || (((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && s_tolower_table <= 0) && \valid[\result] == 1) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) && \result == 0) || (((((((((!(len_b == len_a) || lhs_len == rhs_len) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && !(rhs == 0)) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && !(array == 0))) || ((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) && \result == 0)) || ((((((((\old_byte_from_rhs == 0 && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((array == 0 && (!(len_b == len_a) || lhs_len == rhs_len)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && storage == 0) && !(array == 0))) || ((((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && (!(len_b == len_a) || lhs_len == rhs_len)) && \valid[lhs] == 1) && !(\old_byte_from_lhs == 0)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && !(lhs == storage)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && lhs_len == rhs_len) && \result == 0) || (((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)))) && \valid[\result] == 1) && \old_byte_from_lhs == 0)) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((!(len_b == len_a) || lhs_len == rhs_len) && rhs == 0) && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && \result == 0) && \result == 0) || ((((((((((((!(len_b == len_a) || lhs_len == rhs_len) && !(\old_byte_from_lhs == 0)) && !(\result == 0)) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && \result == 0) && !(rhs == 0)) && !(array == 0)))) [2021-11-02 12:12:03,022 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && len_b == len_a) && \result == 0) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)) && \result == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && len_b == len_a) && lhs_len == rhs_len) && \result == 0)))) || ((((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0))) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && (((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)))) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)) [2021-11-02 12:12:03,531 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-02 12:12:03,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 12:12:03,532 INFO L158 Benchmark]: Toolchain (without parser) took 156938.52ms. Allocated memory was 104.9MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 64.2MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 891.5MB. Max. memory is 16.1GB. [2021-11-02 12:12:03,532 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 12:12:03,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1836.20ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 63.8MB in the beginning and 66.3MB in the end (delta: -2.5MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2021-11-02 12:12:03,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 307.10ms. Allocated memory is still 132.1MB. Free memory was 66.3MB in the beginning and 54.5MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-02 12:12:03,533 INFO L158 Benchmark]: Boogie Preprocessor took 125.00ms. Allocated memory is still 132.1MB. Free memory was 54.5MB in the beginning and 47.4MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-02 12:12:03,533 INFO L158 Benchmark]: RCFGBuilder took 4603.06ms. Allocated memory was 132.1MB in the beginning and 415.2MB in the end (delta: 283.1MB). Free memory was 47.4MB in the beginning and 298.4MB in the end (delta: -251.0MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. [2021-11-02 12:12:03,533 INFO L158 Benchmark]: TraceAbstraction took 149496.35ms. Allocated memory was 415.2MB in the beginning and 1.4GB in the end (delta: 964.7MB). Free memory was 297.4MB in the beginning and 1.1GB in the end (delta: -821.1MB). Peak memory consumption was 790.6MB. Max. memory is 16.1GB. [2021-11-02 12:12:03,533 INFO L158 Benchmark]: Witness Printer took 564.19ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: -3.8MB). Peak memory consumption was 671.1MB. Max. memory is 16.1GB. [2021-11-02 12:12:03,534 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.17ms. Allocated memory is still 104.9MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1836.20ms. Allocated memory was 104.9MB in the beginning and 132.1MB in the end (delta: 27.3MB). Free memory was 63.8MB in the beginning and 66.3MB in the end (delta: -2.5MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 307.10ms. Allocated memory is still 132.1MB. Free memory was 66.3MB in the beginning and 54.5MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.00ms. Allocated memory is still 132.1MB. Free memory was 54.5MB in the beginning and 47.4MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4603.06ms. Allocated memory was 132.1MB in the beginning and 415.2MB in the end (delta: 283.1MB). Free memory was 47.4MB in the beginning and 298.4MB in the end (delta: -251.0MB). Peak memory consumption was 183.9MB. Max. memory is 16.1GB. * TraceAbstraction took 149496.35ms. Allocated memory was 415.2MB in the beginning and 1.4GB in the end (delta: 964.7MB). Free memory was 297.4MB in the beginning and 1.1GB in the end (delta: -821.1MB). Peak memory consumption was 790.6MB. Max. memory is 16.1GB. * Witness Printer took 564.19ms. Allocated memory is still 1.4GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: -3.8MB). Peak memory consumption was 671.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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 1 procedures, 67 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 149363.58ms, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 25.58ms, AutomataDifference: 83657.43ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 15621.18ms, InitialAbstractionConstructionTime: 8.13ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 4025 SdHoareTripleChecker+Valid, 71778.28ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4025 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 65882.39ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5588 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9122 IncrementalHoareTripleChecker+Invalid, 9297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 0 mSDtfsCounter, 9122 mSolverCounterSat, 138.43ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 16138.02ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=220occurred in iteration=8, InterpolantAutomatonStates: 195, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 128.78ms AutomataMinimizationTime, 19 MinimizatonAttempts, 555 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.00ms HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 85 NumberOfFragments, 2871 HoareAnnotationTreeSize, 12 FomulaSimplifications, 12887 FormulaSimplificationTreeSizeReduction, 231.44ms HoareSimplificationTime, 12 FomulaSimplificationsInter, 6251 FormulaSimplificationTreeSizeReductionInter, 15379.51ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 209.04ms SsaConstructionTime, 39624.04ms SatisfiabilityAnalysisTime, 9782.08ms InterpolantComputationTime, 688 NumberOfCodeBlocks, 688 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 5286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \result == 0) || (((s_tolower_table == 0 && (((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && !(array == storage)) && lhs_len == size) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) || ((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && !(array == storage)) && lhs_len == size) && \result == 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && array == lhs) && !(storage == 0)) && \old_byte_from_lhs == storage) && storage == 0) && !(array == 0)))) && \result == 0) && \valid[\old_byte_from_lhs] == 1)) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && !(rhs == 0)) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) || (((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && s_tolower_table <= 0) && \valid[\result] == 1) - InvariantResult [Line: 7675]: Loop Invariant Derived loop invariant: ((((((((((((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) && \result == 0) || (((((((((!(len_b == len_a) || lhs_len == rhs_len) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && !(rhs == 0)) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && !(array == 0))) || ((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) && \result == 0)) || ((((((((\old_byte_from_rhs == 0 && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((array == 0 && (!(len_b == len_a) || lhs_len == rhs_len)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && (((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0))) && storage == 0) && !(array == 0))) || ((((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && (!(len_b == len_a) || lhs_len == rhs_len)) && \valid[lhs] == 1) && !(\old_byte_from_lhs == 0)) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && !(lhs == storage)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0)))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && lhs_len == rhs_len) && \result == 0) || (((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)))) && \valid[\result] == 1) && \old_byte_from_lhs == 0)) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((!(len_b == len_a) || lhs_len == rhs_len) && rhs == 0) && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && \result == 0) && \result == 0) || ((((((((((((!(len_b == len_a) || lhs_len == rhs_len) && !(\old_byte_from_lhs == 0)) && !(\result == 0)) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && \result == 0) && !(rhs == 0)) && !(array == 0)))) - InvariantResult [Line: 7694]: Loop Invariant Derived loop invariant: (((((lhs_len == rhs_len && (((((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && len_b == len_a) && \result == 0) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)) && \result == 0))) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && s_tolower_table <= 0) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && (((((((((((!(\result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0)) || (((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && lhs_len == len_a) && len_b == len_a) && lhs_len == rhs_len) && \result == 0)))) || ((((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && lhs_len == rhs_len) && !(lhs == 0))) || (((((((((((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0))) && \old_byte_from_rhs == 0) && (\old_byte_from_rhs == 0 || rhs_len <= 0)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && lhs_len == rhs_len) && !(rhs == 0)) && !(array == 0))) || (((((((((((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\old_byte_from_lhs == storage)) && !(\result == 0)) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && len_b == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && !(lhs == storage)) && \valid[\result] == 1) && \valid[\result] == 1) && \old_byte_from_lhs == 0) && \valid[\old_byte_from_lhs] == 1) && storage == 0) && !(array == 0))) || (((((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && (((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && len_b == len_a) || ((((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && len_b == len_a) && !(lhs == 0)))) && rhs == 0) && unknown-#memory_int-unknown[rhs][unknown-#memory_int-unknown[\old_byte_from_rhs][\old_byte_from_rhs]] == unknown-#memory_int-unknown[\old_byte_from_rhs][8]) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && lhs_len == len_a) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && lhs_len == rhs_len) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((((0 <= s_tolower_table && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) || ((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && !(\result == 0)) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && !(lhs == 0)) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 6899]: Loop Invariant Derived loop invariant: (((0 <= s_tolower_table && \result == 0) && s_tolower_table <= 0) && \result == 0) || (((((((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \result == 0) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: (((((((((rhs == 0 && rhs == 0) && !(\result == 0)) && \result == 0) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)) && \result == 0) || (((((\result + 1 <= unknown-#StackHeapBarrier-unknown && !(\old_byte_from_lhs == storage)) && !(lhs == storage)) && \old_byte_from_lhs == 0) && ((((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && rhs == 0) && !(\result == 0)) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1) || ((((((((((((((((((((((array == 0 && lhs + 1 <= unknown-#StackHeapBarrier-unknown) && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && !(\result == 0)) && \result == 0) && !(\result == 0)) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && lhs == 0) && unknown-#memory_int-unknown[\old_byte_from_lhs][8] == unknown-#memory_int-unknown[lhs][unknown-#memory_int-unknown[\old_byte_from_lhs][\old_byte_from_lhs]]) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0)))) && \valid[\old_byte_from_lhs] == 1)) || ((((((((((((((((((array == 0 && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == 0) && \result == 0) && \old_byte_from_rhs == 0) && rhs + 1 <= unknown-#StackHeapBarrier-unknown) && rhs == array) && \result == 0) && !(array == storage)) && size == rhs_len) && \old_byte_from_rhs == storage) && s_tolower_table <= 0) && ((((!(\result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) || (((!(\result == 0) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && !(lhs == 0)))) && \valid[\result] == 1) && \valid[\result] == 1) && storage == 0) && !(array == 0))) || (((((!(\old_byte_from_lhs == 0) && !(\result == 0)) && !(\result == 0)) && ((\old_byte_from_lhs == 0 && \old_byte_from_lhs == 0) || lhs_len <= 0)) && lhs_len == rhs_len) && !(lhs == 0))) || (((((rhs == 0 && rhs == 0) && lhs == 0) && lhs == 0) && \result == 0) && \result == 0) - InvariantResult [Line: 6899]: Loop Invariant Derived loop invariant: (((((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) || ((((((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && 0 <= s_tolower_table) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \result == 0) && \valid[\result] == 1)) || (((lhs == 0 && lhs == 0) && \result == 0) && \result == 0)) || ((((((((((0 <= s_tolower_table && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && !(\result == 0)) && lhs == 0) && lhs == 0) && \result == 0) && s_tolower_table <= 0) && \valid[\result] == 1) && \valid[\result] == 1) - InvariantResult [Line: 9006]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: (((\result + 1 <= unknown-#StackHeapBarrier-unknown && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && \valid[\result] == 1 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (((0 <= s_tolower_table && lhs == 0) && lhs == 0) && s_tolower_table <= 0) || (((((((lhs + 1 <= unknown-#StackHeapBarrier-unknown && \valid[lhs] == 1) && \result + 1 <= unknown-#StackHeapBarrier-unknown) && \result == 0) && s_tolower_table == 0) && !(\result == 0)) && lhs == 0) && \valid[\result] == 1) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: s_tolower_table == 0 RESULT: Ultimate proved your program to be correct! [2021-11-02 12:12:03,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE