./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678b828e 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 /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_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 67c1edf7cc09dc6bdffe29ac25be18cb489d87f4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-678b828 [2020-12-07 17:12:45,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-07 17:12:45,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-07 17:12:45,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-07 17:12:45,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-07 17:12:45,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-07 17:12:45,334 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-07 17:12:45,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-07 17:12:45,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-07 17:12:45,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-07 17:12:45,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-07 17:12:45,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-07 17:12:45,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-07 17:12:45,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-07 17:12:45,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-07 17:12:45,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-07 17:12:45,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-07 17:12:45,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-07 17:12:45,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-07 17:12:45,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-07 17:12:45,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-07 17:12:45,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-07 17:12:45,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-07 17:12:45,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-07 17:12:45,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-07 17:12:45,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-07 17:12:45,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-07 17:12:45,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-07 17:12:45,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-07 17:12:45,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-07 17:12:45,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-07 17:12:45,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-07 17:12:45,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-07 17:12:45,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-07 17:12:45,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-07 17:12:45,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-07 17:12:45,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-07 17:12:45,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-07 17:12:45,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-07 17:12:45,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-07 17:12:45,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-07 17:12:45,373 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-07 17:12:45,409 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-07 17:12:45,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-07 17:12:45,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-07 17:12:45,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-07 17:12:45,411 INFO L138 SettingsManager]: * Use SBE=true [2020-12-07 17:12:45,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-07 17:12:45,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-07 17:12:45,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-07 17:12:45,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-07 17:12:45,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-07 17:12:45,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-07 17:12:45,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-07 17:12:45,413 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-07 17:12:45,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-07 17:12:45,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-07 17:12:45,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-07 17:12:45,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-07 17:12:45,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-07 17:12:45,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-07 17:12:45,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-07 17:12:45,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-07 17:12:45,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-07 17:12:45,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-07 17:12:45,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-07 17:12:45,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-07 17:12:45,417 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 -> 67c1edf7cc09dc6bdffe29ac25be18cb489d87f4 [2020-12-07 17:12:45,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-07 17:12:45,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-07 17:12:45,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-07 17:12:45,883 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-07 17:12:45,884 INFO L275 PluginConnector]: CDTParser initialized [2020-12-07 17:12:45,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_harness.i [2020-12-07 17:12:45,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399780e38/2b5889a246ca49f99042c33ee5caedcc/FLAG2d3b89053 [2020-12-07 17:12:47,002 INFO L306 CDTParser]: Found 1 translation units. [2020-12-07 17:12:47,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_harness.i [2020-12-07 17:12:47,053 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399780e38/2b5889a246ca49f99042c33ee5caedcc/FLAG2d3b89053 [2020-12-07 17:12:47,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/399780e38/2b5889a246ca49f99042c33ee5caedcc [2020-12-07 17:12:47,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-07 17:12:47,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-07 17:12:47,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-07 17:12:47,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-07 17:12:47,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-07 17:12:47,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:12:47" (1/1) ... [2020-12-07 17:12:47,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392cda45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:47, skipping insertion in model container [2020-12-07 17:12:47,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:12:47" (1/1) ... [2020-12-07 17:12:47,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-07 17:12:47,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-07 17:12:47,899 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2020-12-07 17:12:47,910 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2020-12-07 17:12:47,940 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-07 17:12:47,949 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-07 17:12:48,773 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,778 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,779 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,782 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,783 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,811 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,812 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,816 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:48,818 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,202 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-07 17:12:49,204 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-07 17:12:49,205 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-07 17:12:49,206 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-07 17:12:49,218 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-07 17:12:49,219 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-07 17:12:49,220 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-07 17:12:49,221 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-07 17:12:49,222 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-07 17:12:49,223 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-07 17:12:49,383 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-07 17:12:49,502 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,503 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-07 17:12:49,717 INFO L203 MainTranslator]: Completed pre-run [2020-12-07 17:12:49,750 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_harness.i[4499,4512] [2020-12-07 17:12:49,753 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_string_eq_byte_cursor_harness.i[4559,4572] [2020-12-07 17:12:49,761 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-07 17:12:49,764 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-07 17:12:49,840 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,843 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,843 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,844 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,846 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,858 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,859 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,860 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,864 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:49,933 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-07 17:12:49,934 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-07 17:12:49,936 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-07 17:12:49,936 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-07 17:12:49,938 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-07 17:12:49,939 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-07 17:12:49,939 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-07 17:12:49,940 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-07 17:12:49,940 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-07 17:12:49,941 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-07 17:12:49,970 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-07 17:12:50,077 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:50,078 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-07 17:12:50,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-07 17:12:51,293 INFO L208 MainTranslator]: Completed translation [2020-12-07 17:12:51,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51 WrapperNode [2020-12-07 17:12:51,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-07 17:12:51,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-07 17:12:51,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-07 17:12:51,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-07 17:12:51,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-07 17:12:51,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-07 17:12:51,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-07 17:12:51,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-07 17:12:51,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... [2020-12-07 17:12:51,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-07 17:12:51,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-07 17:12:51,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-07 17:12:51,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-07 17:12:51,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-07 17:12:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2020-12-07 17:12:51,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-07 17:12:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-07 17:12:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-07 17:12:51,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-07 17:12:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-07 17:12:51,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-07 17:12:51,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-07 17:12:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-07 17:12:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-07 17:12:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-07 17:12:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-07 17:12:51,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-07 17:13:01,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-07 17:13:01,632 INFO L299 CfgBuilder]: Removed 74 assume(true) statements. [2020-12-07 17:13:01,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:13:01 BoogieIcfgContainer [2020-12-07 17:13:01,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-07 17:13:01,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-07 17:13:01,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-07 17:13:01,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-07 17:13:01,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:12:47" (1/3) ... [2020-12-07 17:13:01,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d43727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:13:01, skipping insertion in model container [2020-12-07 17:13:01,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:12:51" (2/3) ... [2020-12-07 17:13:01,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d43727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:13:01, skipping insertion in model container [2020-12-07 17:13:01,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:13:01" (3/3) ... [2020-12-07 17:13:01,643 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_eq_byte_cursor_harness.i [2020-12-07 17:13:01,659 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-07 17:13:01,664 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-07 17:13:01,676 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-07 17:13:01,715 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-07 17:13:01,716 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-07 17:13:01,716 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-07 17:13:01,716 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-07 17:13:01,716 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-07 17:13:01,717 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-07 17:13:01,718 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-07 17:13:01,718 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-07 17:13:01,736 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2020-12-07 17:13:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-07 17:13:01,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:01,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:01,746 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash -924134613, now seen corresponding path program 1 times [2020-12-07 17:13:01,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:01,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166852284] [2020-12-07 17:13:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:02,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166852284] [2020-12-07 17:13:02,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:02,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-07 17:13:02,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193634581] [2020-12-07 17:13:02,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-07 17:13:02,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:02,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-07 17:13:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-07 17:13:02,529 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 2 states. [2020-12-07 17:13:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:02,562 INFO L93 Difference]: Finished difference Result 236 states and 326 transitions. [2020-12-07 17:13:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-07 17:13:02,564 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2020-12-07 17:13:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:02,576 INFO L225 Difference]: With dead ends: 236 [2020-12-07 17:13:02,577 INFO L226 Difference]: Without dead ends: 116 [2020-12-07 17:13:02,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-07 17:13:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-12-07 17:13:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-12-07 17:13:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-07 17:13:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2020-12-07 17:13:02,636 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 34 [2020-12-07 17:13:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:02,642 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2020-12-07 17:13:02,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-07 17:13:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2020-12-07 17:13:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-07 17:13:02,652 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:02,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:02,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-07 17:13:02,655 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -4215317, now seen corresponding path program 1 times [2020-12-07 17:13:02,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:02,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058672440] [2020-12-07 17:13:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:02,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058672440] [2020-12-07 17:13:02,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:02,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 17:13:02,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127707120] [2020-12-07 17:13:03,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 17:13:03,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:03,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 17:13:03,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 17:13:03,003 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand 4 states. [2020-12-07 17:13:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:03,124 INFO L93 Difference]: Finished difference Result 199 states and 255 transitions. [2020-12-07 17:13:03,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 17:13:03,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-07 17:13:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:03,127 INFO L225 Difference]: With dead ends: 199 [2020-12-07 17:13:03,127 INFO L226 Difference]: Without dead ends: 116 [2020-12-07 17:13:03,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 17:13:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-12-07 17:13:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2020-12-07 17:13:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-07 17:13:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 146 transitions. [2020-12-07 17:13:03,142 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 146 transitions. Word has length 34 [2020-12-07 17:13:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:03,143 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 146 transitions. [2020-12-07 17:13:03,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 17:13:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 146 transitions. [2020-12-07 17:13:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-07 17:13:03,144 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:03,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:03,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-07 17:13:03,145 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:03,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:03,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2121258970, now seen corresponding path program 1 times [2020-12-07 17:13:03,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:03,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182623629] [2020-12-07 17:13:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:03,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182623629] [2020-12-07 17:13:03,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:03,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 17:13:03,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62133133] [2020-12-07 17:13:03,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 17:13:03,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:03,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 17:13:03,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-07 17:13:03,562 INFO L87 Difference]: Start difference. First operand 116 states and 146 transitions. Second operand 5 states. [2020-12-07 17:13:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:03,734 INFO L93 Difference]: Finished difference Result 237 states and 298 transitions. [2020-12-07 17:13:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-07 17:13:03,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-12-07 17:13:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:03,740 INFO L225 Difference]: With dead ends: 237 [2020-12-07 17:13:03,741 INFO L226 Difference]: Without dead ends: 193 [2020-12-07 17:13:03,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-07 17:13:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2020-12-07 17:13:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 142. [2020-12-07 17:13:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-07 17:13:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 181 transitions. [2020-12-07 17:13:03,775 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 181 transitions. Word has length 37 [2020-12-07 17:13:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:03,776 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 181 transitions. [2020-12-07 17:13:03,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 17:13:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 181 transitions. [2020-12-07 17:13:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-07 17:13:03,780 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:03,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:03,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-07 17:13:03,781 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1356059876, now seen corresponding path program 1 times [2020-12-07 17:13:03,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:03,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185282514] [2020-12-07 17:13:03,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:04,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185282514] [2020-12-07 17:13:04,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:04,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 17:13:04,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209239468] [2020-12-07 17:13:04,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 17:13:04,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:04,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 17:13:04,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 17:13:04,221 INFO L87 Difference]: Start difference. First operand 142 states and 181 transitions. Second operand 4 states. [2020-12-07 17:13:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:04,274 INFO L93 Difference]: Finished difference Result 283 states and 362 transitions. [2020-12-07 17:13:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 17:13:04,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-12-07 17:13:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:04,277 INFO L225 Difference]: With dead ends: 283 [2020-12-07 17:13:04,277 INFO L226 Difference]: Without dead ends: 241 [2020-12-07 17:13:04,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 17:13:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-12-07 17:13:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 226. [2020-12-07 17:13:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-12-07 17:13:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 293 transitions. [2020-12-07 17:13:04,315 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 293 transitions. Word has length 37 [2020-12-07 17:13:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:04,316 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 293 transitions. [2020-12-07 17:13:04,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 17:13:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 293 transitions. [2020-12-07 17:13:04,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-07 17:13:04,321 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:04,321 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:04,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-07 17:13:04,322 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:04,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash 154674179, now seen corresponding path program 1 times [2020-12-07 17:13:04,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:04,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794564700] [2020-12-07 17:13:04,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:05,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794564700] [2020-12-07 17:13:05,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:05,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-07 17:13:05,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893826899] [2020-12-07 17:13:05,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-07 17:13:05,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-07 17:13:05,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-07 17:13:05,023 INFO L87 Difference]: Start difference. First operand 226 states and 293 transitions. Second operand 6 states. [2020-12-07 17:13:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:05,225 INFO L93 Difference]: Finished difference Result 364 states and 462 transitions. [2020-12-07 17:13:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-07 17:13:05,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-07 17:13:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:05,228 INFO L225 Difference]: With dead ends: 364 [2020-12-07 17:13:05,228 INFO L226 Difference]: Without dead ends: 358 [2020-12-07 17:13:05,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-07 17:13:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-12-07 17:13:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 226. [2020-12-07 17:13:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-12-07 17:13:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 292 transitions. [2020-12-07 17:13:05,239 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 292 transitions. Word has length 38 [2020-12-07 17:13:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:05,239 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 292 transitions. [2020-12-07 17:13:05,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-07 17:13:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 292 transitions. [2020-12-07 17:13:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-07 17:13:05,241 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:05,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:05,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-07 17:13:05,242 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:05,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:05,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1163274757, now seen corresponding path program 1 times [2020-12-07 17:13:05,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:05,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692644698] [2020-12-07 17:13:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:05,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692644698] [2020-12-07 17:13:05,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:05,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-07 17:13:05,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205985938] [2020-12-07 17:13:05,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-07 17:13:05,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-07 17:13:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-07 17:13:05,962 INFO L87 Difference]: Start difference. First operand 226 states and 292 transitions. Second operand 7 states. [2020-12-07 17:13:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:10,789 INFO L93 Difference]: Finished difference Result 544 states and 692 transitions. [2020-12-07 17:13:10,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-07 17:13:10,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2020-12-07 17:13:10,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:10,793 INFO L225 Difference]: With dead ends: 544 [2020-12-07 17:13:10,793 INFO L226 Difference]: Without dead ends: 435 [2020-12-07 17:13:10,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-07 17:13:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2020-12-07 17:13:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 311. [2020-12-07 17:13:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-12-07 17:13:10,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 404 transitions. [2020-12-07 17:13:10,812 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 404 transitions. Word has length 42 [2020-12-07 17:13:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:10,812 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 404 transitions. [2020-12-07 17:13:10,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-07 17:13:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 404 transitions. [2020-12-07 17:13:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-07 17:13:10,817 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:10,817 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:10,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-07 17:13:10,818 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 489246643, now seen corresponding path program 1 times [2020-12-07 17:13:10,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:10,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125743087] [2020-12-07 17:13:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:11,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125743087] [2020-12-07 17:13:11,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:11,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-07 17:13:11,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065806355] [2020-12-07 17:13:11,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-07 17:13:11,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-07 17:13:11,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-07 17:13:11,446 INFO L87 Difference]: Start difference. First operand 311 states and 404 transitions. Second operand 7 states. [2020-12-07 17:13:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:11,765 INFO L93 Difference]: Finished difference Result 624 states and 793 transitions. [2020-12-07 17:13:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-07 17:13:11,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2020-12-07 17:13:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:11,769 INFO L225 Difference]: With dead ends: 624 [2020-12-07 17:13:11,769 INFO L226 Difference]: Without dead ends: 444 [2020-12-07 17:13:11,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-12-07 17:13:11,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2020-12-07 17:13:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 311. [2020-12-07 17:13:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-12-07 17:13:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 402 transitions. [2020-12-07 17:13:11,783 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 402 transitions. Word has length 46 [2020-12-07 17:13:11,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:11,784 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 402 transitions. [2020-12-07 17:13:11,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-07 17:13:11,784 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 402 transitions. [2020-12-07 17:13:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-07 17:13:11,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:11,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:11,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-07 17:13:11,786 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1364595712, now seen corresponding path program 1 times [2020-12-07 17:13:11,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:11,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379899117] [2020-12-07 17:13:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:12,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379899117] [2020-12-07 17:13:12,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:12,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 17:13:12,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056198163] [2020-12-07 17:13:12,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 17:13:12,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:12,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 17:13:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-07 17:13:12,118 INFO L87 Difference]: Start difference. First operand 311 states and 402 transitions. Second operand 9 states. [2020-12-07 17:13:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:12,535 INFO L93 Difference]: Finished difference Result 572 states and 737 transitions. [2020-12-07 17:13:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-07 17:13:12,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2020-12-07 17:13:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:12,539 INFO L225 Difference]: With dead ends: 572 [2020-12-07 17:13:12,539 INFO L226 Difference]: Without dead ends: 419 [2020-12-07 17:13:12,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2020-12-07 17:13:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2020-12-07 17:13:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 311. [2020-12-07 17:13:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-12-07 17:13:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 398 transitions. [2020-12-07 17:13:12,554 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 398 transitions. Word has length 48 [2020-12-07 17:13:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:12,554 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 398 transitions. [2020-12-07 17:13:12,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 17:13:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 398 transitions. [2020-12-07 17:13:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-07 17:13:12,555 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:12,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:12,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-07 17:13:12,556 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:12,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:12,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1167265266, now seen corresponding path program 1 times [2020-12-07 17:13:12,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:12,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45485117] [2020-12-07 17:13:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:13,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45485117] [2020-12-07 17:13:13,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:13,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 17:13:13,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096466370] [2020-12-07 17:13:13,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 17:13:13,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 17:13:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-07 17:13:13,110 INFO L87 Difference]: Start difference. First operand 311 states and 398 transitions. Second operand 5 states. [2020-12-07 17:13:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:15,618 INFO L93 Difference]: Finished difference Result 657 states and 828 transitions. [2020-12-07 17:13:15,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 17:13:15,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-12-07 17:13:15,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:15,622 INFO L225 Difference]: With dead ends: 657 [2020-12-07 17:13:15,622 INFO L226 Difference]: Without dead ends: 431 [2020-12-07 17:13:15,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-07 17:13:15,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-12-07 17:13:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 311. [2020-12-07 17:13:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-12-07 17:13:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 389 transitions. [2020-12-07 17:13:15,641 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 389 transitions. Word has length 48 [2020-12-07 17:13:15,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:15,642 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 389 transitions. [2020-12-07 17:13:15,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 17:13:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 389 transitions. [2020-12-07 17:13:15,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-07 17:13:15,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:15,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:15,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-07 17:13:15,644 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:15,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash 883718732, now seen corresponding path program 1 times [2020-12-07 17:13:15,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:15,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479768762] [2020-12-07 17:13:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:20,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479768762] [2020-12-07 17:13:20,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:20,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-07 17:13:20,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38153654] [2020-12-07 17:13:20,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-07 17:13:20,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:20,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-07 17:13:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-07 17:13:20,705 INFO L87 Difference]: Start difference. First operand 311 states and 389 transitions. Second operand 8 states. [2020-12-07 17:13:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:25,800 INFO L93 Difference]: Finished difference Result 766 states and 937 transitions. [2020-12-07 17:13:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-07 17:13:25,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-12-07 17:13:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:25,804 INFO L225 Difference]: With dead ends: 766 [2020-12-07 17:13:25,805 INFO L226 Difference]: Without dead ends: 522 [2020-12-07 17:13:25,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-12-07 17:13:25,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-12-07 17:13:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 329. [2020-12-07 17:13:25,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-12-07 17:13:25,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 404 transitions. [2020-12-07 17:13:25,823 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 404 transitions. Word has length 48 [2020-12-07 17:13:25,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:25,823 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 404 transitions. [2020-12-07 17:13:25,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-07 17:13:25,824 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 404 transitions. [2020-12-07 17:13:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-07 17:13:25,825 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:25,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:25,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-07 17:13:25,825 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:25,826 INFO L82 PathProgramCache]: Analyzing trace with hash 377585824, now seen corresponding path program 1 times [2020-12-07 17:13:25,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:25,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440005317] [2020-12-07 17:13:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:30,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440005317] [2020-12-07 17:13:30,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:30,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 17:13:30,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022067491] [2020-12-07 17:13:30,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 17:13:30,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:30,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 17:13:30,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-07 17:13:30,030 INFO L87 Difference]: Start difference. First operand 329 states and 404 transitions. Second operand 9 states. [2020-12-07 17:13:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:34,896 INFO L93 Difference]: Finished difference Result 532 states and 649 transitions. [2020-12-07 17:13:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-07 17:13:34,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-12-07 17:13:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:34,902 INFO L225 Difference]: With dead ends: 532 [2020-12-07 17:13:34,902 INFO L226 Difference]: Without dead ends: 525 [2020-12-07 17:13:34,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2020-12-07 17:13:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2020-12-07 17:13:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 329. [2020-12-07 17:13:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2020-12-07 17:13:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 403 transitions. [2020-12-07 17:13:34,926 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 403 transitions. Word has length 51 [2020-12-07 17:13:34,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:34,926 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 403 transitions. [2020-12-07 17:13:34,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 17:13:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 403 transitions. [2020-12-07 17:13:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-07 17:13:34,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:34,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:34,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-07 17:13:34,928 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1057644194, now seen corresponding path program 1 times [2020-12-07 17:13:34,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:34,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876816170] [2020-12-07 17:13:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:35,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876816170] [2020-12-07 17:13:35,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:35,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 17:13:35,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183782184] [2020-12-07 17:13:35,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 17:13:35,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 17:13:35,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 17:13:35,444 INFO L87 Difference]: Start difference. First operand 329 states and 403 transitions. Second operand 4 states. [2020-12-07 17:13:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:37,857 INFO L93 Difference]: Finished difference Result 475 states and 572 transitions. [2020-12-07 17:13:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 17:13:37,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-12-07 17:13:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:37,861 INFO L225 Difference]: With dead ends: 475 [2020-12-07 17:13:37,861 INFO L226 Difference]: Without dead ends: 327 [2020-12-07 17:13:37,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 17:13:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-12-07 17:13:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2020-12-07 17:13:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-12-07 17:13:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 382 transitions. [2020-12-07 17:13:37,879 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 382 transitions. Word has length 51 [2020-12-07 17:13:37,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:37,880 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 382 transitions. [2020-12-07 17:13:37,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 17:13:37,880 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 382 transitions. [2020-12-07 17:13:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-07 17:13:37,881 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:37,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:37,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-07 17:13:37,882 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:37,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1312240936, now seen corresponding path program 1 times [2020-12-07 17:13:37,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:37,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191062850] [2020-12-07 17:13:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:38,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191062850] [2020-12-07 17:13:38,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:38,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-07 17:13:38,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079064390] [2020-12-07 17:13:38,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-07 17:13:38,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-07 17:13:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-07 17:13:38,274 INFO L87 Difference]: Start difference. First operand 315 states and 382 transitions. Second operand 9 states. [2020-12-07 17:13:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:38,679 INFO L93 Difference]: Finished difference Result 393 states and 469 transitions. [2020-12-07 17:13:38,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-07 17:13:38,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-12-07 17:13:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:38,683 INFO L225 Difference]: With dead ends: 393 [2020-12-07 17:13:38,683 INFO L226 Difference]: Without dead ends: 330 [2020-12-07 17:13:38,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2020-12-07 17:13:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-12-07 17:13:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 263. [2020-12-07 17:13:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2020-12-07 17:13:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2020-12-07 17:13:38,698 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 53 [2020-12-07 17:13:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:38,700 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2020-12-07 17:13:38,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-07 17:13:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2020-12-07 17:13:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-07 17:13:38,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:38,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:38,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-07 17:13:38,702 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:38,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1904494503, now seen corresponding path program 1 times [2020-12-07 17:13:38,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:38,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154658978] [2020-12-07 17:13:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:39,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154658978] [2020-12-07 17:13:39,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:39,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-07 17:13:39,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637317303] [2020-12-07 17:13:39,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-07 17:13:39,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:39,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-07 17:13:39,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-12-07 17:13:39,316 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 11 states. [2020-12-07 17:13:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:44,555 INFO L93 Difference]: Finished difference Result 471 states and 566 transitions. [2020-12-07 17:13:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-07 17:13:44,556 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2020-12-07 17:13:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:44,560 INFO L225 Difference]: With dead ends: 471 [2020-12-07 17:13:44,560 INFO L226 Difference]: Without dead ends: 314 [2020-12-07 17:13:44,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2020-12-07 17:13:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2020-12-07 17:13:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 103. [2020-12-07 17:13:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-07 17:13:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2020-12-07 17:13:44,571 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 53 [2020-12-07 17:13:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:44,571 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2020-12-07 17:13:44,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-07 17:13:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2020-12-07 17:13:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-07 17:13:44,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:44,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:44,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-07 17:13:44,573 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:44,573 INFO L82 PathProgramCache]: Analyzing trace with hash 621986550, now seen corresponding path program 1 times [2020-12-07 17:13:44,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:44,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717610060] [2020-12-07 17:13:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:45,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717610060] [2020-12-07 17:13:45,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:45,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-07 17:13:45,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407149057] [2020-12-07 17:13:45,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-07 17:13:45,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:45,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-07 17:13:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-07 17:13:45,065 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand 10 states. [2020-12-07 17:13:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:45,694 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2020-12-07 17:13:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-07 17:13:45,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2020-12-07 17:13:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:45,696 INFO L225 Difference]: With dead ends: 190 [2020-12-07 17:13:45,696 INFO L226 Difference]: Without dead ends: 163 [2020-12-07 17:13:45,697 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2020-12-07 17:13:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-07 17:13:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 130. [2020-12-07 17:13:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-12-07 17:13:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2020-12-07 17:13:45,708 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 54 [2020-12-07 17:13:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:45,708 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2020-12-07 17:13:45,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-07 17:13:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2020-12-07 17:13:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-07 17:13:45,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:45,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:45,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-07 17:13:45,710 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:45,710 INFO L82 PathProgramCache]: Analyzing trace with hash 684026164, now seen corresponding path program 1 times [2020-12-07 17:13:45,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:45,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045520975] [2020-12-07 17:13:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:46,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045520975] [2020-12-07 17:13:46,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:46,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 17:13:46,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607801369] [2020-12-07 17:13:46,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 17:13:46,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:46,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 17:13:46,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 17:13:46,050 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand 4 states. [2020-12-07 17:13:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:46,094 INFO L93 Difference]: Finished difference Result 157 states and 178 transitions. [2020-12-07 17:13:46,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 17:13:46,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-07 17:13:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:46,097 INFO L225 Difference]: With dead ends: 157 [2020-12-07 17:13:46,097 INFO L226 Difference]: Without dead ends: 130 [2020-12-07 17:13:46,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 17:13:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-12-07 17:13:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2020-12-07 17:13:46,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-07 17:13:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2020-12-07 17:13:46,106 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 54 [2020-12-07 17:13:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:46,106 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2020-12-07 17:13:46,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 17:13:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2020-12-07 17:13:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-07 17:13:46,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:46,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:46,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-07 17:13:46,108 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:46,109 INFO L82 PathProgramCache]: Analyzing trace with hash -313917039, now seen corresponding path program 1 times [2020-12-07 17:13:46,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:46,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482262924] [2020-12-07 17:13:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:46,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482262924] [2020-12-07 17:13:46,419 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:46,419 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-07 17:13:46,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31355688] [2020-12-07 17:13:46,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-07 17:13:46,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-07 17:13:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-07 17:13:46,421 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 6 states. [2020-12-07 17:13:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:46,669 INFO L93 Difference]: Finished difference Result 201 states and 226 transitions. [2020-12-07 17:13:46,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-07 17:13:46,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2020-12-07 17:13:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:46,672 INFO L225 Difference]: With dead ends: 201 [2020-12-07 17:13:46,672 INFO L226 Difference]: Without dead ends: 163 [2020-12-07 17:13:46,673 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-07 17:13:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-07 17:13:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 114. [2020-12-07 17:13:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-07 17:13:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2020-12-07 17:13:46,686 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 59 [2020-12-07 17:13:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:46,686 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2020-12-07 17:13:46,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-07 17:13:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2020-12-07 17:13:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-07 17:13:46,688 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:46,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:46,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-07 17:13:46,689 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash 387682835, now seen corresponding path program 1 times [2020-12-07 17:13:46,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:46,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908792395] [2020-12-07 17:13:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:46,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908792395] [2020-12-07 17:13:46,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:46,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-07 17:13:46,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68269380] [2020-12-07 17:13:46,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-07 17:13:46,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:46,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-07 17:13:46,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-07 17:13:46,982 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 4 states. [2020-12-07 17:13:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:47,048 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2020-12-07 17:13:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-07 17:13:47,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-07 17:13:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:47,050 INFO L225 Difference]: With dead ends: 163 [2020-12-07 17:13:47,050 INFO L226 Difference]: Without dead ends: 103 [2020-12-07 17:13:47,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-07 17:13:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-07 17:13:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-12-07 17:13:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-07 17:13:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2020-12-07 17:13:47,059 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 59 [2020-12-07 17:13:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:47,060 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2020-12-07 17:13:47,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-07 17:13:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2020-12-07 17:13:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-07 17:13:47,061 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:47,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:47,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-07 17:13:47,061 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 759909220, now seen corresponding path program 1 times [2020-12-07 17:13:47,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:47,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616508105] [2020-12-07 17:13:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:47,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616508105] [2020-12-07 17:13:47,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:47,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-07 17:13:47,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605253382] [2020-12-07 17:13:47,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-07 17:13:47,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:47,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-07 17:13:47,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-07 17:13:47,416 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 6 states. [2020-12-07 17:13:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:47,607 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2020-12-07 17:13:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-07 17:13:47,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-12-07 17:13:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:47,609 INFO L225 Difference]: With dead ends: 143 [2020-12-07 17:13:47,609 INFO L226 Difference]: Without dead ends: 103 [2020-12-07 17:13:47,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-07 17:13:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-07 17:13:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-12-07 17:13:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-07 17:13:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2020-12-07 17:13:47,617 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 62 [2020-12-07 17:13:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:47,617 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2020-12-07 17:13:47,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-07 17:13:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-12-07 17:13:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-07 17:13:47,618 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:47,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:47,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-07 17:13:47,619 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:47,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 262116169, now seen corresponding path program 1 times [2020-12-07 17:13:47,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:47,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525685364] [2020-12-07 17:13:47,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:47,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525685364] [2020-12-07 17:13:47,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:47,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-07 17:13:47,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823830729] [2020-12-07 17:13:47,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-07 17:13:47,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:47,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-07 17:13:47,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-07 17:13:47,963 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand 5 states. [2020-12-07 17:13:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:48,045 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2020-12-07 17:13:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-07 17:13:48,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2020-12-07 17:13:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:48,047 INFO L225 Difference]: With dead ends: 131 [2020-12-07 17:13:48,047 INFO L226 Difference]: Without dead ends: 103 [2020-12-07 17:13:48,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-07 17:13:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-07 17:13:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-12-07 17:13:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-07 17:13:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2020-12-07 17:13:48,055 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 64 [2020-12-07 17:13:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:48,056 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2020-12-07 17:13:48,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-07 17:13:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2020-12-07 17:13:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-07 17:13:48,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-07 17:13:48,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-07 17:13:48,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-07 17:13:48,057 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-07 17:13:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-07 17:13:48,057 INFO L82 PathProgramCache]: Analyzing trace with hash -366028880, now seen corresponding path program 1 times [2020-12-07 17:13:48,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-07 17:13:48,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180209034] [2020-12-07 17:13:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-07 17:13:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-07 17:13:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-07 17:13:49,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180209034] [2020-12-07 17:13:49,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-07 17:13:49,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-07 17:13:49,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140168669] [2020-12-07 17:13:49,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-07 17:13:49,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-07 17:13:49,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-07 17:13:49,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-07 17:13:49,018 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 6 states. [2020-12-07 17:13:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-07 17:13:49,137 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2020-12-07 17:13:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-07 17:13:49,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-12-07 17:13:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-07 17:13:49,138 INFO L225 Difference]: With dead ends: 103 [2020-12-07 17:13:49,138 INFO L226 Difference]: Without dead ends: 0 [2020-12-07 17:13:49,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-07 17:13:49,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-07 17:13:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-07 17:13:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-07 17:13:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-07 17:13:49,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2020-12-07 17:13:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-07 17:13:49,139 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-07 17:13:49,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-07 17:13:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-07 17:13:49,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-07 17:13:49,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-07 17:13:49,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-07 17:13:49,339 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 116 [2020-12-07 17:13:49,485 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 115 [2020-12-07 17:13:49,594 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 118 [2020-12-07 17:13:50,395 WARN L197 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-12-07 17:13:51,004 WARN L197 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 63 [2020-12-07 17:13:51,591 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 60 [2020-12-07 17:13:52,194 WARN L197 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 54 [2020-12-07 17:13:52,460 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 41 [2020-12-07 17:13:52,757 WARN L197 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2020-12-07 17:13:52,767 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,767 INFO L262 CegarLoopResult]: For program point L9549(lines 9549 9550) no Hoare annotation was computed. [2020-12-07 17:13:52,768 INFO L262 CegarLoopResult]: For program point L9549-2(lines 9549 9550) no Hoare annotation was computed. [2020-12-07 17:13:52,768 INFO L262 CegarLoopResult]: For program point L9549-3(lines 9549 9559) no Hoare annotation was computed. [2020-12-07 17:13:52,768 INFO L258 CegarLoopResult]: At program point L6890(lines 6889 6891) the Hoare annotation is: false [2020-12-07 17:13:52,768 INFO L262 CegarLoopResult]: For program point L9549-4(lines 9549 9559) no Hoare annotation was computed. [2020-12-07 17:13:52,769 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-07 17:13:52,769 INFO L262 CegarLoopResult]: For program point L7370(lines 7370 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,769 INFO L262 CegarLoopResult]: For program point L7370-4(lines 7370 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,769 INFO L258 CegarLoopResult]: At program point L7370-3(lines 7368 7372) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0)) (.cse4 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0)) (.cse0 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset|)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0))) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base))) (or (and .cse0 .cse1 (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))) .cse3 .cse4 .cse5) (and (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) .cse0 .cse1 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0)) .cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0)) (and .cse0 .cse3 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 0) .cse5 (<= 0 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)))) [2020-12-07 17:13:52,769 INFO L262 CegarLoopResult]: For program point L7370-2(lines 7370 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,769 INFO L262 CegarLoopResult]: For program point L7370-8(lines 7370 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,770 INFO L258 CegarLoopResult]: At program point L7370-7(lines 7368 7372) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0)) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0))) (.cse8 (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset|))) (<= .cse12 (* 18446744073709551616 (div .cse12 18446744073709551616))))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse3 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0)) (.cse5 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse5) (and (= ULTIMATE.start_aws_string_eq_byte_cursor_~cur.offset 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1551.offset| 0) .cse2 (let ((.cse9 (not .cse5)) (.cse10 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse11 (not (= ULTIMATE.start_aws_string_eq_byte_cursor_~str.base 0)))) (or (and .cse9 .cse10 .cse8 .cse11 .cse1 .cse3 .cse7) (and .cse9 .cse10 .cse11 .cse1 .cse3 .cse4 .cse7))) (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1492|) (= ULTIMATE.start_aws_string_eq_byte_cursor_~cur.base 0) .cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1551.base| 0) (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))))) [2020-12-07 17:13:52,770 INFO L262 CegarLoopResult]: For program point L7370-6(lines 7370 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,770 INFO L258 CegarLoopResult]: At program point L7370-11(lines 7368 7372) the Hoare annotation is: (and (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0))) [2020-12-07 17:13:52,770 INFO L262 CegarLoopResult]: For program point L7370-10(lines 7370 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,770 INFO L262 CegarLoopResult]: For program point L7371(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,770 INFO L262 CegarLoopResult]: For program point L7371-5(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,770 INFO L262 CegarLoopResult]: For program point L7371-4(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-2(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-8(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-6(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-12(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-11(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-10(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L6810(lines 6810 6811) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-17(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-16(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-14(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,771 INFO L262 CegarLoopResult]: For program point L7371-20(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L6810-2(lines 6810 6811) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-18(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-24(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-23(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-22(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-29(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-28(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-26(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-32(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-30(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,772 INFO L262 CegarLoopResult]: For program point L7371-35(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,773 INFO L262 CegarLoopResult]: For program point L7371-34(line 7371) no Hoare annotation was computed. [2020-12-07 17:13:52,773 INFO L258 CegarLoopResult]: At program point L7703(lines 7684 7704) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse3 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse10 (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset|))) (<= .cse12 (* 18446744073709551616 (div .cse12 18446744073709551616))))) (.cse0 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0)) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0))) (.cse5 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1551.base| 0)) (= |ULTIMATE.start_aws_array_eq_#res| 0) .cse2 (let ((.cse8 (not .cse5)) (.cse9 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse11 (not (= ULTIMATE.start_aws_string_eq_byte_cursor_~str.base 0)))) (or (and .cse8 .cse9 .cse10 .cse11 .cse1 .cse3 .cse7) (and .cse8 .cse9 .cse11 .cse1 .cse3 .cse4 .cse7))) (not (= ULTIMATE.start_aws_string_eq_byte_cursor_~cur.base 0)) .cse6 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0))) (and .cse10 .cse0 .cse2 .cse5))) [2020-12-07 17:13:52,773 INFO L262 CegarLoopResult]: For program point L9553(lines 9553 9558) no Hoare annotation was computed. [2020-12-07 17:13:52,773 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-07 17:13:52,773 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-07 17:13:52,773 INFO L262 CegarLoopResult]: For program point L9537(lines 9537 9561) no Hoare annotation was computed. [2020-12-07 17:13:52,773 INFO L262 CegarLoopResult]: For program point L222-2(lines 7101 7111) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L9538(lines 9538 9539) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L9340(lines 9340 9348) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L9538-2(lines 9538 9539) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,774 INFO L262 CegarLoopResult]: For program point L223-6(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point L223-7(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point L9555(lines 9555 9557) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point L223-9(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point L223-10(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point L223-12(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point L223-13(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L258 CegarLoopResult]: At program point L6815(lines 6806 6816) the Hoare annotation is: false [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-07 17:13:52,775 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-1(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-5(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-6(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-7(lines 7691 7695) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L210-8(lines 210 212) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,776 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,777 INFO L262 CegarLoopResult]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,777 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,777 INFO L262 CegarLoopResult]: For program point L6256(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,777 INFO L262 CegarLoopResult]: For program point L211-6(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,777 INFO L262 CegarLoopResult]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,777 INFO L258 CegarLoopResult]: At program point L6256-6(lines 6252 6257) the Hoare annotation is: (let ((.cse14 (let ((.cse17 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse17 (* 18446744073709551616 (div .cse17 18446744073709551616))))) (.cse1 (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1)) (.cse4 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0))) (.cse3 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse5 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0))) (.cse6 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (.cse9 (not |ULTIMATE.start_aws_string_eq_byte_cursor_#t~short1490|)) (.cse12 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset|)) (.cse16 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0)) (.cse10 (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|)) (.cse11 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse15 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0)) (.cse0 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0))) (.cse13 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0))) (or (and (= ULTIMATE.start_aws_string_eq_byte_cursor_~cur.offset 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1551.offset| 0) (= ULTIMATE.start_aws_string_eq_byte_cursor_~cur.base 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_#t~ite1551.base| 0) .cse0 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (let ((.cse2 (not (= ULTIMATE.start_aws_string_eq_byte_cursor_~str.base 0))) (.cse7 (not .cse15)) (.cse8 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse4 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse11 .cse14 .cse13)))) (and .cse12 .cse16 .cse14 .cse4 .cse15 .cse6) (and .cse1 .cse4 .cse3 .cse5 .cse6 .cse9 .cse12 .cse16 .cse10 .cse11 .cse15 .cse0 .cse13))) [2020-12-07 17:13:52,777 INFO L262 CegarLoopResult]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L262 CegarLoopResult]: For program point L211-8(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L262 CegarLoopResult]: For program point L211-10(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L262 CegarLoopResult]: For program point L6256-9(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L262 CegarLoopResult]: For program point L6256-10(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L262 CegarLoopResult]: For program point L211-12(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L262 CegarLoopResult]: For program point L6256-7(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L265 CegarLoopResult]: At program point L261(line 261) the Hoare annotation is: true [2020-12-07 17:13:52,778 INFO L262 CegarLoopResult]: For program point L211-14(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,778 INFO L258 CegarLoopResult]: At program point L6256-13(lines 6252 6257) the Hoare annotation is: false [2020-12-07 17:13:52,778 INFO L258 CegarLoopResult]: At program point L261-1(line 261) the Hoare annotation is: false [2020-12-07 17:13:52,779 INFO L258 CegarLoopResult]: At program point L261-2(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0) (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0) (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0)) [2020-12-07 17:13:52,779 INFO L262 CegarLoopResult]: For program point L211-16(line 211) no Hoare annotation was computed. [2020-12-07 17:13:52,779 INFO L258 CegarLoopResult]: At program point L261-3(line 261) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset|)) (.cse1 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0)) (.cse3 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0))) (.cse4 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0)) (.cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base))) (or (and .cse0 .cse1 (let ((.cse2 (select (select |#memory_int| ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (<= .cse2 (* 18446744073709551616 (div .cse2 18446744073709551616)))) .cse3 .cse4 .cse5) (and (<= |ULTIMATE.start_aws_byte_cursor_is_valid_#res| 1) (<= 1 |ULTIMATE.start_aws_byte_cursor_is_valid_#res|) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) .cse0 .cse1 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) .cse3 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0)) .cse4 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) .cse5 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0)))) [2020-12-07 17:13:52,779 INFO L262 CegarLoopResult]: For program point L6256-12(line 6256) no Hoare annotation was computed. [2020-12-07 17:13:52,779 INFO L262 CegarLoopResult]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2020-12-07 17:13:52,779 INFO L262 CegarLoopResult]: For program point L9329(line 9329) no Hoare annotation was computed. [2020-12-07 17:13:52,779 INFO L262 CegarLoopResult]: For program point L9329-2(line 9329) no Hoare annotation was computed. [2020-12-07 17:13:52,779 INFO L262 CegarLoopResult]: For program point L9330(line 9330) no Hoare annotation was computed. [2020-12-07 17:13:52,779 INFO L258 CegarLoopResult]: At program point L6803(lines 6800 6804) the Hoare annotation is: false [2020-12-07 17:13:52,780 INFO L262 CegarLoopResult]: For program point L9330-2(line 9330) no Hoare annotation was computed. [2020-12-07 17:13:52,780 INFO L258 CegarLoopResult]: At program point L6886(lines 6882 6887) the Hoare annotation is: false [2020-12-07 17:13:52,780 INFO L258 CegarLoopResult]: At program point L6886-1(lines 6882 6887) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0) (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0) (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0) (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0) (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0)) [2020-12-07 17:13:52,780 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-07 17:13:52,780 INFO L265 CegarLoopResult]: At program point L9562(line 9562) the Hoare annotation is: true [2020-12-07 17:13:52,780 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-07 17:13:52,780 INFO L262 CegarLoopResult]: For program point L9331(lines 9331 9339) no Hoare annotation was computed. [2020-12-07 17:13:52,780 INFO L262 CegarLoopResult]: For program point L6672(lines 6672 6676) no Hoare annotation was computed. [2020-12-07 17:13:52,780 INFO L262 CegarLoopResult]: For program point L6673-2(lines 6673 6675) no Hoare annotation was computed. [2020-12-07 17:13:52,781 INFO L262 CegarLoopResult]: For program point L6673(lines 6673 6675) no Hoare annotation was computed. [2020-12-07 17:13:52,781 INFO L262 CegarLoopResult]: For program point L7697(lines 7697 7701) no Hoare annotation was computed. [2020-12-07 17:13:52,781 INFO L258 CegarLoopResult]: At program point L9349(lines 9327 9350) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.offset 0)) (.cse2 (not (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| 0))) (.cse8 (let ((.cse12 (select (select |#memory_int| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset|))) (<= .cse12 (* 18446744073709551616 (div .cse12 18446744073709551616))))) (.cse1 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base| ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base)) (.cse3 (= ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset 0)) (.cse4 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.base|) 8) 0))) (.cse7 (= |ULTIMATE.start_aws_string_eq_byte_cursor_harness_~#cursor~2.offset| 0)) (.cse5 (= ULTIMATE.start_aws_string_eq_byte_cursor_harness_~str~3.base 0)) (.cse6 (not (= |ULTIMATE.start_bounded_malloc_#res.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse5) (and .cse2 (let ((.cse9 (not .cse5)) (.cse10 (not (= |ULTIMATE.start_ensure_string_is_allocated_bounded_length_#res.base| 0))) (.cse11 (not (= ULTIMATE.start_aws_string_eq_byte_cursor_~str.base 0)))) (or (and .cse9 .cse10 .cse8 .cse11 .cse1 .cse3 .cse7) (and .cse9 .cse10 .cse11 .cse1 .cse3 .cse4 .cse7))) .cse6 (not (= |ULTIMATE.start_ensure_string_is_allocated_#res.base| 0)) (not (= ULTIMATE.start_ensure_string_is_allocated_~str~0.base 0)) (= |ULTIMATE.start_aws_string_eq_byte_cursor_#res| 0)))) [2020-12-07 17:13:52,781 INFO L258 CegarLoopResult]: At program point L266(line 266) the Hoare annotation is: (= ULTIMATE.start_ensure_string_is_allocated_bounded_length_~max_size 16) [2020-12-07 17:13:52,781 INFO L258 CegarLoopResult]: At program point L266-1(line 266) the Hoare annotation is: false [2020-12-07 17:13:52,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,800 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,810 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,813 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,814 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,816 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,817 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,819 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,820 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,822 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,822 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,824 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,825 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,826 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:52,827 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,827 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:52,828 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,829 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,830 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,831 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:52,831 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,832 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:52,832 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,833 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,834 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:52,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:13:52 BoogieIcfgContainer [2020-12-07 17:13:52,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-07 17:13:52,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-07 17:13:52,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-07 17:13:52,841 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-07 17:13:52,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:13:01" (3/4) ... [2020-12-07 17:13:52,845 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-07 17:13:52,874 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 136 nodes and edges [2020-12-07 17:13:52,876 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2020-12-07 17:13:52,878 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2020-12-07 17:13:52,880 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-07 17:13:52,882 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-07 17:13:52,884 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-07 17:13:52,885 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-07 17:13:52,887 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-07 17:13:52,925 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((cursor == cursor && str == 0) && cursor == 0) && !(cursor == 0)) && #memory_$Pointer$[cursor][8] == 0) && str == 0) && #memory_$Pointer$[cursor][8] == 0) && !(\result == 0)) && cursor == 0 [2020-12-07 17:13:52,925 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((cursor == cursor && str == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(cursor == 0)) && str == 0) && cursor == cursor) || (((((((((((\result <= 1 && 1 <= \result) && cursor == cursor) && cursor == cursor) && str == 0) && cursor == 0) && !(cursor == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == cursor) && cursor == 0)) || ((((cursor == cursor && !(cursor == 0)) && \result <= 0) && cursor == cursor) && 0 <= \result) [2020-12-07 17:13:52,926 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((cursor == cursor && str == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(cursor == 0)) && str == 0) && cursor == cursor) || (((((((((((\result <= 1 && 1 <= \result) && cursor == cursor) && cursor == cursor) && str == 0) && cursor == 0) && !(cursor == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == cursor) && cursor == 0) [2020-12-07 17:13:52,926 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((cur == 0 && nondet_parameter ? &cursor : ((void *)0) == 0) && cur == 0) && nondet_parameter ? &cursor : ((void *)0) == 0) && !(\result == 0)) && !(\result == 0)) && !(str == 0)) && (((((((((((((\result <= 1 && !(str == 0)) && cursor == 0) && !(cursor == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && !(str == 0)) && !(\result == 0)) && !aux-!str || aws_string_is_valid(str)-aux) && 1 <= \result) && cursor == cursor) && cursor == cursor) && cursor == 0) || ((((((((((((\result <= 1 && !(str == 0)) && !(cursor == 0)) && cursor == 0) && cursor == cursor) && !(str == 0)) && !(\result == 0)) && !aux-!str || aws_string_is_valid(str)-aux) && 1 <= \result) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0))) || (((((cursor == cursor && str == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(cursor == 0)) && str == 0) && cursor == cursor)) || ((((((((((((\result <= 1 && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && !aux-!str || aws_string_is_valid(str)-aux) && cursor == cursor) && str == 0) && 1 <= \result) && cursor == cursor) && str == 0) && !(\result == 0)) && cursor == 0) [2020-12-07 17:13:52,926 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((str == 0 && cursor == cursor) && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == 0) || (((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && str == 0) && !(cursor == 0)) && str == 0)) || (((((!(cursor == 0) && (((((((!(str == 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == 0) || ((((((!(str == 0) && !(\result == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0))) && !(\result == 0)) && !(\result == 0)) && !(str == 0)) && \result == 0) [2020-12-07 17:13:52,927 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((str == 0 && cursor == cursor) && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == 0) || (((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && str == 0) && !(cursor == 0)) && str == 0)) || (((((((((cur == 0 && nondet_parameter ? &cursor : ((void *)0) == 0) && !(cursor == 0)) && (((((((!(str == 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == 0) || ((((((!(str == 0) && !(\result == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0))) && !aux-!cur || aws_byte_cursor_is_valid(cur)-aux) && cur == 0) && !(\result == 0)) && nondet_parameter ? &cursor : ((void *)0) == 0) && !(\result == 0)) && !(str == 0)) [2020-12-07 17:13:52,928 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((str == 0 && cursor == cursor) && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == 0) || (((((((!(nondet_parameter ? &cursor : ((void *)0) == 0) && \result == 0) && !(cursor == 0)) && (((((((!(str == 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == 0) || ((((((!(str == 0) && !(\result == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0))) && !(cur == 0)) && !(\result == 0)) && !(\result == 0)) && !(str == 0))) || (((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && str == 0) && !(cursor == 0)) && str == 0) [2020-12-07 17:13:52,928 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result <= 1 && 1 <= \result) && !(cursor == 0) [2020-12-07 17:13:54,009 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-07 17:13:54,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-07 17:13:54,011 INFO L168 Benchmark]: Toolchain (without parser) took 66642.26 ms. Allocated memory was 44.0 MB in the beginning and 736.1 MB in the end (delta: 692.1 MB). Free memory was 19.9 MB in the beginning and 375.9 MB in the end (delta: -356.0 MB). Peak memory consumption was 506.4 MB. Max. memory is 16.1 GB. [2020-12-07 17:13:54,012 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 35.7 MB. Free memory was 20.3 MB in the beginning and 20.3 MB in the end (delta: 22.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-07 17:13:54,012 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3923.84 ms. Allocated memory was 44.0 MB in the beginning and 123.7 MB in the end (delta: 79.7 MB). Free memory was 19.7 MB in the beginning and 25.8 MB in the end (delta: -6.1 MB). Peak memory consumption was 82.7 MB. Max. memory is 16.1 GB. [2020-12-07 17:13:54,013 INFO L168 Benchmark]: Boogie Procedure Inliner took 347.10 ms. Allocated memory is still 123.7 MB. Free memory was 25.8 MB in the beginning and 70.3 MB in the end (delta: -44.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. [2020-12-07 17:13:54,013 INFO L168 Benchmark]: Boogie Preprocessor took 126.35 ms. Allocated memory is still 123.7 MB. Free memory was 70.3 MB in the beginning and 61.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-07 17:13:54,014 INFO L168 Benchmark]: RCFGBuilder took 9863.69 ms. Allocated memory was 123.7 MB in the beginning and 446.7 MB in the end (delta: 323.0 MB). Free memory was 61.9 MB in the beginning and 374.8 MB in the end (delta: -312.9 MB). Peak memory consumption was 263.0 MB. Max. memory is 16.1 GB. [2020-12-07 17:13:54,014 INFO L168 Benchmark]: TraceAbstraction took 51204.23 ms. Allocated memory was 446.7 MB in the beginning and 736.1 MB in the end (delta: 289.4 MB). Free memory was 374.8 MB in the beginning and 336.0 MB in the end (delta: 38.8 MB). Peak memory consumption was 328.2 MB. Max. memory is 16.1 GB. [2020-12-07 17:13:54,014 INFO L168 Benchmark]: Witness Printer took 1169.01 ms. Allocated memory is still 736.1 MB. Free memory was 336.0 MB in the beginning and 375.9 MB in the end (delta: -39.9 MB). Peak memory consumption was 128.9 MB. Max. memory is 16.1 GB. [2020-12-07 17:13:54,017 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.26 ms. Allocated memory is still 35.7 MB. Free memory was 20.3 MB in the beginning and 20.3 MB in the end (delta: 22.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 3923.84 ms. Allocated memory was 44.0 MB in the beginning and 123.7 MB in the end (delta: 79.7 MB). Free memory was 19.7 MB in the beginning and 25.8 MB in the end (delta: -6.1 MB). Peak memory consumption was 82.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 347.10 ms. Allocated memory is still 123.7 MB. Free memory was 25.8 MB in the beginning and 70.3 MB in the end (delta: -44.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 126.35 ms. Allocated memory is still 123.7 MB. Free memory was 70.3 MB in the beginning and 61.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9863.69 ms. Allocated memory was 123.7 MB in the beginning and 446.7 MB in the end (delta: 323.0 MB). Free memory was 61.9 MB in the beginning and 374.8 MB in the end (delta: -312.9 MB). Peak memory consumption was 263.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 51204.23 ms. Allocated memory was 446.7 MB in the beginning and 736.1 MB in the end (delta: 289.4 MB). Free memory was 374.8 MB in the beginning and 336.0 MB in the end (delta: 38.8 MB). Peak memory consumption was 328.2 MB. Max. memory is 16.1 GB. * Witness Printer took 1169.01 ms. Allocated memory is still 736.1 MB. Free memory was 336.0 MB in the beginning and 375.9 MB in the end (delta: -39.9 MB). Peak memory consumption was 128.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7368]: Loop Invariant Derived loop invariant: (\result <= 1 && 1 <= \result) && !(cursor == 0) - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6252]: Loop Invariant [2020-12-07 17:13:54,031 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,032 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,034 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,034 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((cur == 0 && nondet_parameter ? &cursor : ((void *)0) == 0) && cur == 0) && nondet_parameter ? &cursor : ((void *)0) == 0) && !(\result == 0)) && !(\result == 0)) && !(str == 0)) && (((((((((((((\result <= 1 && !(str == 0)) && cursor == 0) && !(cursor == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && !(str == 0)) && !(\result == 0)) && !aux-!str || aws_string_is_valid(str)-aux) && 1 <= \result) && cursor == cursor) && cursor == cursor) && cursor == 0) || ((((((((((((\result <= 1 && !(str == 0)) && !(cursor == 0)) && cursor == 0) && cursor == cursor) && !(str == 0)) && !(\result == 0)) && !aux-!str || aws_string_is_valid(str)-aux) && 1 <= \result) && cursor == cursor) && cursor == cursor) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && cursor == 0))) || (((((cursor == cursor && str == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(cursor == 0)) && str == 0) && cursor == cursor)) || ((((((((((((\result <= 1 && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == cursor) && !aux-!str || aws_string_is_valid(str)-aux) && cursor == cursor) && str == 0) && 1 <= \result) && cursor == cursor) && str == 0) && !(\result == 0)) && cursor == 0) - InvariantResult [Line: 6889]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7368]: Loop Invariant [2020-12-07 17:13:54,036 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,037 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,038 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,039 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((str == 0 && cursor == cursor) && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == 0) || (((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && str == 0) && !(cursor == 0)) && str == 0)) || (((((((((cur == 0 && nondet_parameter ? &cursor : ((void *)0) == 0) && !(cursor == 0)) && (((((((!(str == 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == 0) || ((((((!(str == 0) && !(\result == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0))) && !aux-!cur || aws_byte_cursor_is_valid(cur)-aux) && cur == 0) && !(\result == 0)) && nondet_parameter ? &cursor : ((void *)0) == 0) && !(\result == 0)) && !(str == 0)) - InvariantResult [Line: 6252]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7684]: Loop Invariant [2020-12-07 17:13:54,040 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,041 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,042 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((str == 0 && cursor == cursor) && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == 0) || (((((((!(nondet_parameter ? &cursor : ((void *)0) == 0) && \result == 0) && !(cursor == 0)) && (((((((!(str == 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == 0) || ((((((!(str == 0) && !(\result == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0))) && !(cur == 0)) && !(\result == 0)) && !(\result == 0)) && !(str == 0))) || (((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && str == 0) && !(cursor == 0)) && str == 0) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: max_size == 16 - InvariantResult [Line: 9327]: Loop Invariant [2020-12-07 17:13:54,044 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,045 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,045 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,046 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((str == 0 && cursor == cursor) && !(cursor == 0)) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == 0) || (((unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616) && str == 0) && !(cursor == 0)) && str == 0)) || (((((!(cursor == 0) && (((((((!(str == 0) && !(\result == 0)) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(str == 0)) && cursor == cursor) && cursor == 0) && cursor == 0) || ((((((!(str == 0) && !(\result == 0)) && !(str == 0)) && cursor == cursor) && cursor == 0) && !(#memory_$Pointer$[cursor][8] == 0)) && cursor == 0))) && !(\result == 0)) && !(\result == 0)) && !(str == 0)) && \result == 0) - InvariantResult [Line: 6882]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 9562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6882]: Loop Invariant [2020-12-07 17:13:54,047 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:54,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:54,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((cursor == cursor && str == 0) && cursor == 0) && !(cursor == 0)) && #memory_$Pointer$[cursor][8] == 0) && str == 0) && #memory_$Pointer$[cursor][8] == 0) && !(\result == 0)) && cursor == 0 - InvariantResult [Line: 261]: Loop Invariant [2020-12-07 17:13:54,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,050 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((cursor == cursor && str == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(cursor == 0)) && str == 0) && cursor == cursor) || (((((((((((\result <= 1 && 1 <= \result) && cursor == cursor) && cursor == cursor) && str == 0) && cursor == 0) && !(cursor == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == cursor) && cursor == 0) - InvariantResult [Line: 6800]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 261]: Loop Invariant [2020-12-07 17:13:54,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:54,051 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-07 17:13:54,052 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((cursor == cursor && str == 0) && cursor == 0) && !(cursor == 0)) && #memory_$Pointer$[cursor][8] == 0) && str == 0) && #memory_$Pointer$[cursor][8] == 0) && cursor == 0 - InvariantResult [Line: 7368]: Loop Invariant [2020-12-07 17:13:54,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-07 17:13:54,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((cursor == cursor && str == 0) && unknown-#memory_int-unknown[cursor][cursor] <= 18446744073709551616 * (unknown-#memory_int-unknown[cursor][cursor] / 18446744073709551616)) && !(cursor == 0)) && str == 0) && cursor == cursor) || (((((((((((\result <= 1 && 1 <= \result) && cursor == cursor) && cursor == cursor) && str == 0) && cursor == 0) && !(cursor == 0)) && !(#memory_$Pointer$[cursor][8] == 0)) && str == 0) && !(\result == 0)) && cursor == cursor) && cursor == 0)) || ((((cursor == cursor && !(cursor == 0)) && \result <= 0) && cursor == cursor) && 0 <= \result) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 121 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 47.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3031 SDtfs, 5429 SDslu, 9110 SDs, 0 SdLazy, 1587 SolverSat, 175 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 23.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 225 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1471 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 57 NumberOfFragments, 934 HoareAnnotationTreeSize, 19 FomulaSimplifications, 242911 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 2862 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1037 NumberOfCodeBlocks, 1037 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1016 ConstructedInterpolants, 0 QuantifiedInterpolants, 148211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...